An analogue for Szegő polynomials of the Clenshaw algorithm
From MaRDI portal
Publication:1802168
DOI10.1016/0377-0427(93)90296-NzbMath0819.65011MaRDI QIDQ1802168
William B. Gragg, Gregory S. Ammar, Lothar Reichel
Publication date: 11 August 1993
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
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)
Related Items
Signal flow graph approach to inversion of \((H,m)\)-quasiseparable-Vandermonde matrices and new filter structures ⋮ A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices ⋮ Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines ⋮ Continuation methods for the computation of zeros of Szegő polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Downdating of Szegö polynomials and data-fitting applications
- Some remarks on uniform asymptotic expansions for Bessel functions
- Szegö polynomials associated with Wiener-Levinson filters
- On the distribution of zeros of polynomials orthogonal on the unit circle
- Discrete Least Squares Approximation by Trigonometric Polynomials
