A new algorithm for computing orthogonal polynomials

The aim of this paper is to present an algorithm for computing orthogonal polynomials. The fast Fourier transform completes the connection given by Draux between the three-term recurrence relationship and the Euclidian algorithm. Applications to Hankel systems and numerical examples illustrate our purpose.