An algorithm to compute Liouvillian solutions of prime order linear difference-differential equations (Q846352)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to compute Liouvillian solutions of prime order linear difference-differential equations |
scientific article; zbMATH DE number 5667919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm to compute Liouvillian solutions of prime order linear difference-differential equations |
scientific article; zbMATH DE number 5667919 |
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
0 references
0 references
0 references
0 references
0.8872472643852234
0 references
0.8845950961112976
0 references
0.8546538352966309
0 references
0.8455056548118591
0 references
