Fast and well-conditioned spectral methods for D-finite functions
Abstract
D-finite functions are solutions of linear differential equations with polynomial coefficients. They have drawn a lot of attention, both in Computer Algebra--because of their numerous (algorithmic) closure properties--but also in Numerical Analysis, because their defining ODEs can be numerically solved very efficiently. In this talk, I will show how a mix of symbolic and numerical methods yields fast and well-conditioned spectral methods on various domains and using different bases of functions.