Abstract
A modular–probabilistic approach is suggested to facilitate the computation of the greatest common right divisor of linear parameterized differential or difference operators, which arise when searching for sparse power series solutions of a given linear differential equation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Abramov, S.A., m-Sparse Solutions of Linear Ordinary Differential Equations with Polynomial Coefficients, Discrete Math., 2000, vol. 217, pp. 3–15.
Abramov, S.A., Petkovšek, M., and Ryabenko, A., Special Formal Series Solutions of Linear Operator Equations, Discrete Math., 2000, vol. 210, pp. 3–25.
Ryabenko, A.A., Maple-Package for Symbolic Construction of Solutions of Linear Ordinary Differential Equations in the Form of Power Series, Programmirovanie, 1999, no. 5, pp. 71–80.
Glotov, P.E., Algorithms for Searching for the Greatest Common Divisor of the Ore Polynomials with Parameter-Dependent Polynomial Coefficients, Programmirovanie, 1998, no. 6, pp. 14–21.
Chardin, M., Differential Resultants and Subresultants, Lecture Notes in Computer Science, Berlin: Springer, vol. 529, pp. 180–189.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Abramov, S.A., Ryabenko, A.A. Sparse Power Series and Parameterized Linear Operators. Programming and Computer Software 30, 83–87 (2004). https://doi.org/10.1023/B:PACS.0000021265.08335.6b
Issue Date:
DOI: https://doi.org/10.1023/B:PACS.0000021265.08335.6b