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...
Saved in:
| Published in: | Journal of symbolic computation Vol. 38; no. 3; pp. 1043 - 1076 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.09.2004
Elsevier |
| Subjects: | |
| ISSN: | 0747-7171, 1095-855X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 |