A new algorithm for computing orthogonal polynomials

DOI10.1016/S0377-0427(96)00064-7zbMath0872.65012WikidataQ127676208 ScholiaQ127676208MaRDI QIDQ2564266

O. Renault

Publication date: 16 September 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmstabilitynumerical resultsorthogonal polynomialsdiscrete Fourier transformHankel linear systems

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Computation of special functions and constants, construction of tables (65D20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Combinatorial and hypergeometric identities via the Legendre polynomials -- a computational approach

Cites Work

• Algebraic methods for Toeplitz-like matrices and operators
• Parallel and superfast algorithms for Hankel systems of equations
• How bad are Hankel matrices?
• A look-ahead algorithm for the solution of general Hankel systems
• Polynômes orthogonaux formels - applications
• Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
• Minimal Solutions of Three-Term Recurrence Relations and Orthogonal Polynomials
• On Generating Orthogonal Polynomials
• The Reverse Bordering Method
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An Algorithm for the Inversion of Finite Hankel Matrices
• Computational Aspects of Three-Term Recurrence Relations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new algorithm for computing orthogonal polynomials