An analogue for Szegő polynomials of the Clenshaw algorithm
From MaRDI portal
(Redirected from Publication:1802168)
Recommendations
- Polynomial evaluation and associated polynomials
- On the construction of Szegő polynomials
- Szegö polynomials and Szegö quadrature for the Fejér kernel
- Downdating of Szegö polynomials and data-fitting applications
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
Cites work
- scientific article; zbMATH DE number 3864449 (Why is no real title available?)
- scientific article; zbMATH DE number 3988038 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Discrete Least Squares Approximation by Trigonometric Polynomials
- Downdating of Szegö polynomials and data-fitting applications
- On the distribution of zeros of polynomials orthogonal on the unit circle
- Some remarks on uniform asymptotic expansions for Bessel functions
- Szegö polynomials associated with Wiener-Levinson filters
Cited in
(9)- Backward stability of Clenshaw's algorithm
- scientific article; zbMATH DE number 1547082 (Why is no real title available?)
- Signal flow graph approach to inversion of (H,m)-quasiseparable-Vandermonde matrices and new filter structures
- Continuation methods for the computation of zeros of Szegő polynomials
- Downdating of Szegö polynomials and data-fitting applications
- A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices
- On the construction of Szegő polynomials
- scientific article; zbMATH DE number 1404584 (Why is no real title available?)
- Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines
This page was built for publication: An analogue for Szegő polynomials of the Clenshaw algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802168)