Related papers: Factorization method and general second order line…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
We describe explicit algorithms for factoring q-difference operators and solving q-difference equations. These are well known results, presented in a "concrete" form. ----- Nous decrivons des algorithmes explicites pour la factorisation…
The Jacobi system on a full-line lattice is considered when it contains additional weight factors. A factorization formula is derived expressing the scattering from such a generalized Jacobi system in terms of the scattering from its…
This paper presents an algebraic approach to characterizing higher-order differential operators. While the foundational Leibniz rule addresses first-order derivatives, its extension to higher orders typically involves identities relating…
In this paper we establish a hypoellipticity result for second order linear operators comprised by a linear combination, with infinite vanishing coefficients, of subelliptic operators in separate spaces. This generalizes previous known…
The central idea of this article is to present a systematic approach to construct some recurrence relations for the solutions of the second-order linear difference equation of hypergeometric-type defined on the quadratic-type lattices. We…
A certain representation for the Heisenberg algebra in finite-difference operators is established. The Lie-algebraic procedure of discretization of differential equations with isospectral property is proposed. Using $sl_2$-algebra based…
The isospectral flows of an $n^{th}$ order linear scalar differential operator $L$ under the hypothesis that it possess a Baker-Akhiezer function were originally investigated by Segal and Wilson from the point of view of infinite…
In this paper we use some basic facts from the theory of (matrix) Lie groups and algebras to show that many of the classical matrix splittings used to construct stationary iterative methods and preconditioniers for Krylov subspace methods…
This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler…
We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by…
The aim of this note is to give some factorization formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those existing for Hall-Littlewood functions.
It has been proven by Rosu and Cornejo-Perez in 2005 that for some nonlinear second-order ODEs it is a very simple task to find one particular solution once the nonlinear equation is factorized with the use of two first-order differential…
We present a method for the explicit diagonalization of some Hankel operators. This method allows us to recover classical results on the diagonalization of Hankel operators with the absolutely continuous spectrum. It leads also to new…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
We propose asymmetric factorization method for supersymmetry involving complex operators. Model Hamiltonians satisfy supersymmetric energy conditions $E_{n}^{(+)}=E_{n+1}^{(-)}$; $E_{0}^{(-)}=0$.
The bivariate difference filed $(\mathbb{F}(\alpha, \beta), \sigma)$ provides an algebraic framework for a sequence satisfying a recurrence of order two and it could transform the summation involving a sequence satisfying a recurrence of…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
The generalization of the factorization method performed by Mielnik [J. Math. Phys. {\bf 25}, 3387 (1984)] opened new ways to generate exactly solvable potentials in quantum mechanics. We present an application of Mielnik's method to…
The factorization technique for superintegrable Hamiltonian systems is revisited and applied in order to obtain additional (higher-order) constants of the motion. In particular, the factorization approach to the classical anisotropic…