The stable computation of formal orthogonal polynomials

DOI10.1007/BF02142485zbMath0848.65007OpenAlexW2045680067MaRDI QIDQ1911437

Bernhard Beckermann

Publication date: 3 November 1996

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02142485

zbMATH Keywords

error analysiscondition numberformal orthogonal polynomialsstability parametersCabay-Meleshko algorithmHankel matrix of momentspairs of basis polynomials

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Computation of special functions and constants, construction of tables (65D20) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items

Look-ahead in Bi-CGSTAB and other product methods for linear systems, Recursiveness in matrix rational interpolation problems, A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic methods for Toeplitz-like matrices and operators
• Matrix computations.
• The weak and strong stability of algorithms in numerical linear algebra
• The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
• A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Backward Error Estimates for Toeplitz Systems