Sensitivity analysis for Szegő polynomials
From MaRDI portal
Publication:841113
DOI10.1007/s00211-009-0230-xzbMath1175.65154OpenAlexW1993991333MaRDI QIDQ841113
Publication date: 14 September 2009
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-009-0230-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Szegő-Lobatto quadrature rules
- A divide and conquer method for unitary and orthogonal eigenproblems
- The QR algorithm for unitary Hessenberg matrices
- How to choose modified moments?
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
- Szegő polynomials applied to frequency analysis
- On the construction of Szegő polynomials
- On the sensitivity of orthogonal polynomials to perturbations in the moments
- Orthogonal systems and convolution operators
- Computing orthogonal polynomials in Sobolev spaces
- On the condition of orthogonal polynomials via modified moments
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Szegö polynomials associated with Wiener-Levinson filters
- Stability Issues in the Factorization of Structured Matrices
- Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
- Discrete Least Squares Approximation by Trigonometric Polynomials
- Moment Theory, Orthogonal Polynomials, Quadrature, and Continued Fractions Associated with the unit Circle
- On Generating Orthogonal Polynomials
- Perturbation Bounds for the $QR$ Factorization of a Matrix
- A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem
- Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift
- On the Construction of Gaussian Quadrature Rules from Modified Moments
This page was built for publication: Sensitivity analysis for Szegő polynomials
