Fast algorithms for polynomial solutions of linear differential equations

  • Authors:

  • Alin Bostan;Thomas Cluzeau;Bruno Salvy

  • Affiliations:

  • Algorithms Project, Le Chesnay, France;Université de Limoges, Limoges, France;Algorithms Project, Le Chesnay, France

  • Venue:
  • Proceedings of the 2005 international symposium on Symbolic and algebraic computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate polynomial solutions of homogeneous linear differential equations with coefficients that are polynomials with integer coefficients. The problems we consider are the existence of nonzero polynomial solutions, the determination of the dimension of the vector space of polynomial solutions, the computation of a basis of this space. Previous algorithms have a bit complexity that is at least quadratic in the largest integer valuation N of formal Laurent series solutions at infinity, even for merely detecting the existence of nonzero polynomial solutions. We give a deterministic algorithm that computes a compact representation of a basis of polynomial solutions in O(Nlog3N) bit operations. We also give a probabilistic algorithm that computes the dimension of the space of polynomial solutions in O(√Nlog2N) bit operations. In general, the integer N is not polynomially bounded in the bit size of the input differential equation. We isolate a class of equations for which detecting nonzero polynomial solutions can be performed in polynomial complexity. We discuss implementation issues and possible extensions.