A factorization algorithm for linear ordinary differential equations
暂无分享,去创建一个
The reducibility and factorization of linear homogeneous differential equations are of great theoretical and practical importance in mathematics. Although it has been known for a long time that factorization is in principle a decision procedure, its use in an automatic differential equation solver requires a more detailed analysis of the various steps involved. Especially important are certain auxiliary equations, the so-called associated equations. An upper bound for the degree of its coefficients is derived. Another important ingredient is the computation of optimal estimates for the size of polynomial and rational solutions of certain differential equations with rational coefficients. Applying these results, the design of the factorization algorithm LODEF and its implementation in the Scratchpad II Computer Algebra System is described.
[1] Stephen M. Watt,et al. Scratchpad II: An Abstract Datatype System for Mathematical Computation , 1988, Trends in Computer Algebra.
[2] K. Hensel. Journal für die reine und angewandte Mathematik , 1892 .
[3] Ludwig Schlesinger,et al. Handbuch der Theorie der linearen Differentialgleichungen , 1898 .
[4] O. Perron. Über lineare Differenzen- und Differentialgleichungen , 1909 .