Decomposition of ordinary difference polynomials
This article presents an algorithm for decomposition of nonlinear ordinary difference polynomials. It is a generalization of \textit{D. Kozen} and \textit{S. Landau} [J. Symb. Comput. 7, No. 5, 445--456 (1989; Zbl 0691.68030)] to ordinary difference polynomials. The algorithm works in several steps. First, the problem is reduced to decomposition of a homogeneous difference polynomial. Next, this is reduced to decomposing the linear left decomposition factors of another homogeneous difference polynomial. Finally, these are computed using decomposition of linear difference polynomials. This whole procedure computes the right decomposition factors; it is easy to find the left factors corresponding to them. The final algorithm is exponential due to combinatorial selections in the algorithm. The authors point out that the complexity of decomposing linear difference polynomials is also exponential, and that their algorithm for the non-linear case is quite effective practically. Also, this algorithm does not introduce parameters and works in the coefficient field of the input. There exists an algorithm for differential (as opposed to difference) polynomials by the same authors [\textit{X.-S. Gao} and \textit{M. Zhang}, Appl. Algebra Eng. Commun. Comput. 19, No. 1, 1--25 (2008; Zbl 1180.12004)] which, according to them, is quite different from the one presented here, due to the different properties of differential and difference operators.
- An algorithm for finding all polynomial solutions of nonlinear difference equations
- On Detecting Solutions of Polynomial Nonlinear Difference Equations
- Decomposition of ordinary differential polynomials
- Rational solutions of linear difference equations: universal denominators and denominator bounds
- An algorithm for the decomposition of differential polynomials in the general case
- A characteristic set method for ordinary difference polynomial systems
- scientific article; zbMATH DE number 1254264
- On polynomial solutions of linear partial differential and \((q\)-)difference equations
- scientific article; zbMATH DE number 1254263
- Decomposition of differential polynomials with constant coefficients
- An algorithm for nonparametric decomposition of differential polynomials
- An algorithm for solving parametric linear systems
- An introduction to pseudo-linear algebra
- Associative differential operations
- Decomposition of differential polynomials with constant coefficients
- Decomposition of ordinary differential polynomials
- Functional decomposition of polynomials: the tame case
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 1262439 (Why is no real title available?)
- scientific article; zbMATH DE number 1263377 (Why is no real title available?)
- scientific article; zbMATH DE number 1467743 (Why is no real title available?)
- scientific article; zbMATH DE number 2151191 (Why is no real title available?)
- scientific article; zbMATH DE number 1860838 (Why is no real title available?)
- scientific article; zbMATH DE number 3207354 (Why is no real title available?)
- Liouvillian Solutions of n-th Order Homogeneous Linear Differential Equations
- On Ore rings, linear operators and factorization
- Polynomial decomposition algorithms
- Decomposition of differential polynomials with constant coefficients
- Efficient integer-linear decomposition of multivariate polynomials
- An algorithm for nonparametric decomposition of differential polynomials
- An algorithm for the decomposition of differential polynomials in the general case
- Decomposition of ordinary differential polynomials
This page was built for publication: Decomposition of ordinary difference polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840708)
