An introduction to pseudo-linear algebra
Selected papers of the conference on Algorithmic complexity of algebraic and geometric models
Modern computer algebra
FFT-like multiplication of linear differential operators
Journal of Symbolic Computation
Numerical Methods for Special Functions
Numerical Methods for Special Functions
Products of ordinary differential operators by evaluation and interpolation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Chebyshev interpolation polynomial-based tools for rigorous computing
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
The dynamic dictionary of mathematical functions (DDMF)
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
| Hi-index | 0.00 |
A Chebyshev expansion is a series in the basis of Chebyshev polynomials of the first kind. When such a series solves a linear differential equation, its coefficients satisfy a linear recurrence equation. We interpret this equation as the numerator of a fraction of linear recurrence operators. This interpretation lets us give a simple view of previous algorithms, analyze their complexity, and design a faster one for large orders.