Sergei A. Abramov
ABSTRACT
We describe a new direct algorithm for transforming a linear system of recurrences into an equivalent one with nonsingular leading or trailing matrix. Our algorithm, which is an improvement to the EG elimination method [2], uses only elementary linear algebra operations (ranks, kernels and determinants) to produce an equation satisfied by the degrees of the solutions with finite support. As a consequence, we can bound and compute the polynomial and rational solutions of very general linear functional systems such as systems of differential or (q—) difference equations.
- 1.ABBOTT, J., BRONSTEIN, M., AND MULDERS, T. Fast deterministic computation of determinants of dense matrices. In Proceedings of ISSAC'99 (1999), S. Dooley, Ed., ACM Press, pp. 197-204. Google Scholar
Digital Library
- 2.ABRAMOV, S. EG-eliminations. Journal of Difference Equations and Applications 5 (1999), 393-433.Google ScholarCross Ref
- 3.ABRAMOV, S., AND BARKATOU, M. Rational solutions of first order difference systems. In Proceedings of ISSAC'98 (1998), O. Gloor, Ed., ACM Press, pp. 124-131. Google ScholarDigital Library
- 4.ABRAMOV, S., AND BRONSTEIN, M. Hypergeometric dispersion and the orbit problem. In Proceedings of ISSAC'2000 (2000), C. Traverso, Ed., ACM Press, pp. 8-13. Google ScholarDigital Library
- 5.ABRAMOV, S., BRONSTEIN, M., AND PETKOVSEK, M. On polynomial solutions of linear operator equations. In Proceedings of lSSAC'95 (1995), ACM Press, pp. 290-296. Google ScholarDigital Library
- 6.ABRAMOV, S., PETKOVSEK, M., AND RYABENKO, A. Special formal series solutions of linear operator equations. Discrete Mathematics 210 (2000), 3-25. Google ScholarDigital Library
- 7.BARKATOU, M. On rational solutions of systems of linear differential equations. J. Symbolic Computation 28, 4 and 5 (October/November 1999), 547-568. Google ScholarDigital Library
- 8.BRONSTEIN, M., AND PETKOVSEK, M. An introduction to pseudo-linear algebra. Theoretical Computer Science 157 (1996), 3-33. Google ScholarDigital Library
- 9.COHN, P. Free Rings and their Relations (2 nd edition). Academic Press, London, 1985.Google Scholar
- 10.MCCLELLAN, M. The exact solution of systems of linear equations with polynomial coefficients. Journal of the ACM 20 (1973), 563-588. Google ScholarDigital Library
- 11.MULDERS, W., AND STORJOHANN, A. Rational solutions of singular linear systems. In Proceedings of ISSAC'2000 (2000), C. Traverso, Ed., ACM Press, pp. 242-249. Google ScholarDigital Library
- 12.SCHWARTZ, J. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27 (1980), 701-717. Google ScholarDigital Library
- 13.VAN HOEIJ, M. Rational solutions of linear difference equations. In Proceedings of lSSAC'98 (1998), O. Gloor, Ed., ACM Press, pp. 120-123. Google ScholarDigital Library
Index Terms
On solutions of linear functional systems
Recommendations
Chebyshev polynomial solutions of systems of linear integral equations
A Chebyshev collocation method has been presented to solve systems of linear integral equations in terms of Chebyshev polynomials. This method transforms the integral system into the matrix equation with the help of Chebyshev collocation points and the ...
Linear partial q-difference equations on q-linear lattices and their bivariate q-orthogonal polynomial solutions
Orthogonal polynomial solutions of an admissible potentially self-adjoint linear second-order partial q-difference equation of the hypergeometric type in two variables on q-linear lattices are analyzed. A q-Pearson's system for the orthogonality weight ...
On the HSS iteration methods for positive definite Toeplitz linear systems
We study the HSS iteration method for large sparse non-Hermitian positive definite Toeplitz linear systems, which first appears in Bai, Golub and Ng's paper published in 2003 [Z.-Z. Bai, G.H. Golub, M.K. Ng, Hermitian and skew-Hermitian splitting ...
Comments