Manuel Bronstein
ABSTRACT
We describe an efficient algorithm for computing the associated equations appearing in the Beke-Schlesinger factorisation method for linear ordinary differential operators. This algorithm, which is based on elementary operations with sets of integers, can be easily implemented for operators of any order, produces several possible associated equations, of which only the simplest can be selected for solving, and often avoids the degenerate case, where the order of the associated equation is less than in the generic case. We conclude with some fast heuristics that can produce some factorisations while using only linear computations.
- 1.S. A. Abramov & K. Yu. Kvashenko (1991): Fast Algorithms to Search for the Rational Solutions of Linear Differential Equations with Polynomial Coefficients, in: (S. Watt, Ed.) Proceedings of ISSAC'91, ACM Press, 267-27O. Google Scholar
Digital Library
- 2.M. A. Barkatou (1993): An Algorithm for Computing a Companion Block Diagonal Form for a System of Linear Differential Equations, Apphcable Algebra, n Engineering, Communication and Computing 4~ 185-195.Google Scholar
- 3.E. Beke (1894): Die irreduzibilit~t der homogenen linearen Differentialgleichungen, Math. Ann. 45~ 278-294.Google ScholarCross Ref
- 4.M. Bronstein (1992): On Solutions of Linear Ordinary Differential Equations in their Coefficient Field, Journal of Symbolic Computation 13, 413-439. Google ScholarDigital Library
- 5.M. Bronstein (1992): Linear Ordinary Differential Equations: breaking through the order 2 barrier, in: (P. Wang, Ed.) Proceedings of 1SSAC'92, ACM Press, 42-48. Google ScholarDigital Library
- 6.M. Bronstein & M. Petkov~ek (1994): On Ore rings, linear operators and factorisation, Programmirovanie 1~ 27-45. Also Research Report 200, Informatik, ETH Ziirich.Google Scholar
- 7.L. Schlesinger (1895): Handbuch der Theorie der linearen Differentialgleichungen, Teubner, Leipzig.Google Scholar
- 8.F. Schwarz (1989): A Factorization Algorithm for Linear Ordinary Differentia} Equations, in: (G. Gonnet, Ed.) Proceedings of ISSA C'89, ACM Press, 17-25. Google ScholarDigital Library
- 9.M. Singer (1991): Liouvillian Solutions of Linear Differential Equations with Liouvillian Coefficients, Journal of Symbolic Computation 11~ 251-273. Google ScholarDigital Library
- 10.M. Singer & F. Ulmer (1993): Liouvillian and Algebraic Solutions of Second and Third Order Linear Differential Equations, Journal of Symbohc Computation 16~ 37-73. Google ScholarDigital Library
- 11.M. Singer & F. Vlmer (1993): Galois Groups of Second and Third Order Linear Differential Equations, Journal of Symbolic Computation 16~ 9-36. Google ScholarDigital Library
- 12.K. Wolf (1992): Zff~ziente Algorithmen zur Lb'sung linearer Differentialgleichungsysteme und zur Faktorisierung linearer Differentialoperatoren iiber liouvillischen Kb'rpern, Doctoral dissertation, Mathematics, RFW Universit~t, Bonn.Google Scholar
- 13.B. Ziircher (1994): Rationale Normalform yon pseudolinearen Abbildungen, Diplomarbeit, Mathematics, ETH Zfirich.Google Scholar
Index Terms
An improved algorithm for factoring linear ordinary differential operators
Recommendations
Approximate solution of linear ordinary differential equations with variable coefficients
In this paper, a novel, simple yet efficient method is proposed to approximately solve linear ordinary differential equations (ODEs). Emphasis is put on second-order linear ODEs with variable coefficients. First, the ODE to be solved is transformed to ...
Solving and factoring boundary problems for linear ordinary differential equations in differential algebras
We present a new approach for expressing and solving boundary problems for linear ordinary differential equations in the language of differential algebras. Starting from an algebra with a derivation and integration operator, we construct an algebra of ...
Comments