A new algorithm for computing orthogonal polynomials
From MaRDI portal
numerical resultsstabilityalgorithmcomplexitydiscrete Fourier transformorthogonal polynomialsHankel linear systems
Computation of special functions and constants, construction of tables (65D20) Direct numerical methods for linear systems and matrix inversion (65F05) 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)
Recommendations
Cites work
- scientific article; zbMATH DE number 3864449 (Why is no real title available?)
- scientific article; zbMATH DE number 3814929 (Why is no real title available?)
- scientific article; zbMATH DE number 4109935 (Why is no real title available?)
- scientific article; zbMATH DE number 41029 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- A look-ahead algorithm for the solution of general Hankel systems
- Algebraic methods for Toeplitz-like matrices and operators
- An Algorithm for the Inversion of Finite Hankel Matrices
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Computational Aspects of Three-Term Recurrence Relations
- Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
- How bad are Hankel matrices?
- Minimal Solutions of Three-Term Recurrence Relations and Orthogonal Polynomials
- On Generating Orthogonal Polynomials
- Parallel and superfast algorithms for Hankel systems of equations
- Polynômes orthogonaux formels - applications
- The Reverse Bordering Method
Cited in
(8)- Fast algorithms using orthogonal polynomials
- Construction of polynomials that are orthogonal with respect to a discrete bilinear form
- Combinatorial and hypergeometric identities via the Legendre polynomials -- a computational approach
- A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version).
- scientific article; zbMATH DE number 5015711 (Why is no real title available?)
- Remark on algorithm 726
- Computation of matrix-valued formally orthogonal polynomials and applications
- Fast conversion algorithms for orthogonal polynomials
This page was built for publication: A new algorithm for computing orthogonal polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564266)
