Abstract

Last decades, one of the most important problems of symbolic computations (see l7r) is the development of algorithms for solving algebraic and differential equations, in particular, those for factoring linear ordinary differential operators (LODO) l1–4r. In this paper, the problems of LODO factorization and decomposition of ordinary polynomials l5, 6r 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).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call