On solutions of linear functional systems

Authors:
Sergei A. Abramov;Manuel Bronstein
Affiliations:
Computer Center of the Russian Academy of Science, Moscow, Russia;INRIA-Project Café, SophiaAntipolis Cedex, France
Venue:
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Year:
2001

Citing 11
Cited 15

On polynomial solutions of linear operator equations

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
An introduction to pseudo-linear algebra

Selected papers of the conference on Algorithmic complexity of algebraic and geometric models
Rational solutions of linear difference equations

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Rational solutions of first order linear difference systems

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Fast deterministic computation of determinants of dense matrices

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
The Exact Solution of Systems of Linear Equations with Polynomial Coefficients

Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
On rational solutions of systems of linear differential equations

Journal of Symbolic Computation - Special issue on differential algebra and differential equations
Special formal series solutions of linear operator equations

Discrete Mathematics
Hypergeometric dispersion and the orbit problem

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Rational solutions of singular linear systems

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation

Fraction-free row reduction of matrices of skew polynomials

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Search for Polynomial Solutions of Linear Functional Systems by Means of Induced Recurrences

Programming and Computing Software
A recursive method for determining the one-dimensional submodules of Laurent-Ore modules

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Improved universal denominators

Programming and Computing Software
Output-sensitive modular algorithms for polynomial matrix normal forms

Journal of Symbolic Computation
Algorithms for regular solutions of higher-order linear differential systems

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Liouvillian solutions of irreducible linear difference equations

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
On Computing the Hermite Form of a Matrix of Differential Polynomials

CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Fraction-free row reduction of matrices of Ore polynomials

Journal of Symbolic Computation
Simple forms of higher-order linear differential systems and their applications in computing regular solutions

Journal of Symbolic Computation
On regular and logarithmic solutions of ordinary linear differential systems

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Denominators of rational solutions of linear difference systems of an arbitrary order

Programming and Computing Software
On valuations of meromorphic solutions of arbitrary-order linear difference systems with polynomial coefficients

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Linear differential and difference systems: EGδ- and EGσ- eliminations

Programming and Computing Software
Regular solutions of linear differential systems with power series coefficients

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

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.