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...
Uložené v:
| Vydané v: | Journal of symbolic computation Ročník 38; číslo 3; s. 1043 - 1076 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.09.2004
Elsevier |
| Predmet: | |
| ISSN: | 0747-7171, 1095-855X |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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 |