相关论文: Universal algorithms for generalized discrete matr…
A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…
Using a bidifferential graded algebra approach to integrable partial differential or difference equations, a unified treatment of continuous, semi-discrete (Ablowitz-Ladik) and fully discrete matrix NLS systems is presented. These equations…
A universal and rigorous ensemble framework for nonequilibrium system remains lacking. Here, we provide a concise framework for the generalized ensemble theory of nonequilibrium discrete systems using matrix-based approach. By introducing…
We explicitly construct the series expansion for a certain class of solutions to the 2D Toda hierarchy in the zero dispersion limit, which we call symmetric solutions. We express the Taylor coefficients through some universal combinatorial…
Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…
In this manuscript we present an approach to analyze the discontinuous Galerkin solution for general quasilinear elliptic problems. This approach is sufficiently general to extend most of the well-known discretization schemes, including…
One discovers why the solution of generalized umbral calculus difference nonhomogeneous equation in the form recently proposed by the author extends here now to generalized appellian delta operator and corresponding polynomials case almost…
We propose a new method for solving the Gelfand-Levitan-Marchenko equation (GLME) based on the block version of the Toeplitz Inner-Bordering (TIB) with an arbitrary point to start the calculation. This makes it possible to find solutions of…
In this note we construct a solution of a matrix interval linear equation of the form X=AX+B (the discrete stationary Bellman equation) over partially ordered semirings, including the semiring of nonnegative real numbers and all idempotent…
We discuss umbral calculus as a method of systematically discretizing linear differential equations while preserving their point symmetries as well as generalized symmetries. The method is then applied to the Schr\"{o}dinger equation in…
We propose deep Koopman-layered models with learnable parameters in the form of Toeplitz matrices for analyzing the transition of the dynamics of time-series data. The proposed model has both theoretical solidness and flexibility. By virtue…
We study algebraic properties of Toeplitz operators on Bergman spaces of polyanalytic functions on the unit disk. We obtain results on finite-rank commutators and semi-commutators of Toeplitz operators with harmonic symbols. We also raise…
We use "generalized" version of total variation, coarea formulas, isoperimetric inequalities to obtain sharp estimates for solutions (and for their gradients) to anisotropic elliptic equations with a lower order term, comparing them with…
We study existence, uniqueness, and distributional aspects of generalized solutions to the Cauchy problem for first-order symmetric (or Hermitian) hyperbolic systems of partial differential equations with Colombeau generalized functions as…
A modified Gauss's algorithm for solving a system of linear equations in an integral ring is proposed, as well as an appropriate algorithm for calculating the elements of the adjoint matrix.
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
In this paper, we introduce three new iterative methods for finding a common point of the set of fixed points of a symmetric generalized hybrid mapping and the set of solutions of an equilibrium problem in a real Hilbert space. Each method…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Toeplitz Block Toeplitz matrices using minimized matrix-vector products, with a complexity…
In this paper, the author present reliable symbolic algorithms for solving a general bordered tridiagonal linear system. The first algorithm is based on the LU decomposition of the coefficient matrix and the computational cost of it is…
Direct links between generalized harmonic numbers, linear Euler sums and Tornheim double series are established in a more perspicuous manner than is found in existing literature. We show that every linear Euler sum can be decomposed into a…