Computing Hypergeometric Solutions of Second Order Linear Differential Equations using Quotients of Formal Solutions and Integral Bases
Abstract
We present two algorithms for computing hypergeometric solutions of second order linear differential operators with rational function coefficients. Our first algorithm searches for solutions of the form \[ (∫ r \, dx)·2F1(a1,a2;b1;f) \] where r,f ∈ Q(x), and a1,a2,b1 ∈ Q. It uses modular reduction and Hensel lifting. Our second algorithm tries to find solutions in the form \[ (∫ r \, dx)· ( r0 ·2F1(a1,a2;b1;f) + r1 ·2F1'(a1,a2;b1;f) ) \] where r0, r1 ∈ Q(x), as follows: It tries to transform the input equation to another equation with solutions of the first type, and then uses the first algorithm.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.