Complexity of factorization and GCD computation for linear ordinary differential operators

Abstract

This paper presents an algorithm of polynomial complexity for finding greatest common (right) divisors of families of linear ordinary differential operators. An algorithm is presented for factorization of operators into the product of irreducible operators with complexity significantly better than that of previously known algorithms. Estimates are given for the coefficients of the expansion of the fundamental solution of the corresponding linear differential equation.