An algorithm to compute Liouvillian solutions of prime order linear difference-differential equations (Q846352): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:33, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to compute Liouvillian solutions of prime order linear difference-differential equations |
scientific article |
Statements
An algorithm to compute Liouvillian solutions of prime order linear difference-differential equations (English)
0 references
9 February 2010
0 references
In the previous paper [J. Symb. Comput. 45, No. 3, 287--305 (2010; Zbl 1233.12004)], the authors developed a Galois theory for difference-differential equations, defined the notion of Liouvillian solutions for such equations and gave a Galois theoretic criterion for the existence of such solutions. In the present paper, they study algorithms for deciding the existence of such solutions.
0 references
linear difference-differential equations
0 references
normal form
0 references
algorithm
0 references
Liouvillian solutions
0 references
