arXiv · 1205.0879
Fast Computation of Common Left Multiples of Linear Ordinary Differential Operators
Also available from
Abstract
We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We propose a new algorithm that recasts the LCLM computation in a linear algebra problem on a polynomial matrix. This algorithm yields sharp bounds on the coefficient degrees of the LCLM, improving by one order of magnitude the best bounds obtained using previous algorithms. The complexity of the new algorithm is almost optimal, in the sense that it nearly matches the arithmetic size of the output.
Explore related subjects
Keep this discovery
Alin Bostan, Frédéric Chyzak, Ziming Li, Bruno Salvy. 2012-05-04. Fast Computation of Common Left Multiples of Linear Ordinary Differential Operators. https://doi.org/10.1145/2442829.2442847
Cite the original work for its findings. Save a collection to share your selection of sources.