A modular algorithm for computing the exponential solutions of a linear differential operator

We present a new algorithm for computing exponential solutions of differential operators with rational function coefficients. We use a combination of local and modular computations, which allows us to reduce the number of possibilities in the combinatorial part of the algorithm. We also show how unn...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of symbolic computation Jg. 38; H. 3; S. 1043 - 1076
Hauptverfasser: Cluzeau, Thomas, van Hoeij, Mark
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.09.2004
Elsevier
Schlagworte:
ISSN:0747-7171, 1095-855X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a new algorithm for computing exponential solutions of differential operators with rational function coefficients. We use a combination of local and modular computations, which allows us to reduce the number of possibilities in the combinatorial part of the algorithm. We also show how unnecessarily large algebraic extensions of the constants can be avoided in the algorithm.
ISSN:0747-7171
1095-855X
DOI:10.1016/j.jsc.2003.11.004