Skip to main content
SpringerLink
Log in

Basis Selection in Solving Linear Functional Equations

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

Search for polynomial and series solutions of linear functional (differential, difference, and q-difference) equations can be based on solving induced recurrences for coefficients of formal series in certain bases. It is shown in the paper that, for every operator type, different bases can be selected, with some of them being more preferable from the practical standpoint.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Abramov, S.A., Bronstein, M., and Petkovšek, M., On Polynomial Solutions of Linear Operator Equations, Proc. of ISSAC'95, ACM, 1995, pp. 290–296.

  2. 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.

    Google Scholar 

  3. Abramov, S.A., EG-Eliminations, J. Difference Equations Appl., 1999, vol. 5, pp. 393–433.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 117967, Russia

    D. E. Khmelnov

Authors
  1. D. E. Khmelnov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khmelnov, D.E. Basis Selection in Solving Linear Functional Equations. Programming and Computer Software 28, 102–105 (2002). https://doi.org/10.1023/A:1014833002850

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014833002850

Keywords

Search

Navigation