Skip to main content
SpringerLink
Log in

An Algorithm for Nonparametric Decomposition of Differential Polynomials

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

Abstract

Last decades, one of the most important problems of symbolic computations (see [7]) is the development of algorithms for solving algebraic and differential equations, in particular, those for factoring linear ordinary differential operators (LODO) [1–4]. In this paper, the problems of LODO factorization and decomposition of ordinary polynomials [5, 6] are generalized: an algorithm is proposed for decomposition of differential polynomials that allows one to find a particular solution to a complex algebraic differential equation (an example is provided in the end of the paper).

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.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Tsarev, S.P., Symbolic Manipulation of Integrodifferential Expressions and Factorization of Linear Ordinary Differential Operation over Transcendental Extensions of a Differential Field, Proc. ISAAC 1997, Küchlin, W.W., Ed., New York: ACM, 1997, pp. 310–315.

  2. Abramov, S.A. and Zima, E.V., D'Alambertian Solution of Inhomogeneous Linear Equations (Differential, Difference, and Some Other), Proc. ISAAC'96, Lakshman, Y.N., Ed., New York: ACM, 1996, pp. 232–240.

    Google Scholar 

  3. Tsarev, S.P., An Algorithm for Complete Enumeration of All Factorization of a Linear Ordinary Differential Operator, Proc. ISAAC'96, Lakshman, Y.N., Ed., New York: ACM, 1997, pp. 226–231.

    Google Scholar 

  4. Bronstein, M., An Improved Algorithm for Factoring Linear Ordinary Differential Operators, Proc. ISAAC'94, ACM, 1994, pp. 336–340.

  5. Kozen, D. and Landau, S., Polynomial Decomposition Algorithms, J. Symb. Comp., 1989, vol. 7, pp. 445–456.

    Google Scholar 

  6. Barton, D.R. and Zippel, R.E., Polynomial Decomposition Algorithms, J. Symb. Comput., 1985, vol. 1, pp. 159–168.

    Google Scholar 

  7. Akritas, A., Elements of Computer Algebra with Applications, New York: Wiley, 1989. Translated under the title Osnovy komp'yuternoi algebry s prilozheniyami, Moscow: Mir, 1994.

    Google Scholar 

  8. Ritt, J.F., Differential Algebra, Dover, 1966.

  9. Tsarev, S.P., On Factorization of Nonlinear Ordinary Differential Equations, Proc. ISAAC'99, ACM, 1999, pp. 159–164.

  10. Abramov, S.A., EG-eliminations, J. Difference Equations and Appl., 1999, vol. 5, pp. 393–433.

    Google Scholar 

  11. Barkatou, M.A., On Rational Solution of Systems of Linear Differential Equation, J. Symb. Comput., 1999, vol. 28, pp. 547–567.

    Google Scholar 

  12. Olver, P.J., Applications of Lie Groups to Differential Equations, New York: Springer, 1986. Translated under the title Prilozhenie grupp Li k differentsial'nym uravneniyam, Moscow: Mir, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krasnoyarsk State Pedagogical University, ul. Lebedevoi 89, Krasnoyarsk, 660049, Russia

    M. V. Sosnin

Authors
  1. M. V. Sosnin
    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

Sosnin, M.V. An Algorithm for Nonparametric Decomposition of Differential Polynomials. Programming and Computer Software 27, 43–49 (2001). https://doi.org/10.1023/A:1007138820193

Download citation

  • Issue Date:

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

Keywords

Search

Navigation