Downdating of Szegö polynomials and data-fitting applications

DOI10.1016/0024-3795(92)90032-6zbMath0755.65027MaRDI QIDQ1194528

Lothar Reichel, William B. Gragg, Gregory S. Ammar

Publication date: 27 September 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90032-6

zbMATH Keywords

interpolation; Szegő polynomials; discrete inner product; least-squares; Hessenberg matrices; fast Fourier transform algorithm; complex-valued function; \(QR\) algorithm; data-fitting; downdating scheme

Mathematics Subject Classification ID

65D10: Numerical smoothing, curve fitting

30E10: Approximation in the complex plane

65D05: Numerical interpolation

65E05: General theory of numerical methods in complex analysis (potential theory, etc.)

Related Items

Szegő-Lobatto quadrature rules, Spectral transformations for Hermitian Toeplitz matrices, A unified least squares approach to identify and to reduce continuous asymptotically stable systems, A stabilized superfast solver for indefinite Hankel systems, Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines, Orthogonal polynomials on the unit circle: distribution of zeros, On the stability of solution methods for band Toeplitz systems, Perturbation and interlace theorems for the unitary eigenvalue problem, Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems, Symmetric schemes for computing the minimum eigenvalue of a symmetric Toeplitz matrix, Spectral functions for real symmetric Toeplitz matrices, A projection method for computing the minimum eigenvalue of a symmetric positive definite Toeplitz matrix, Matrices of Sinc methods, A least squares approach to reduce stable discrete linear systems preserving their stability., An analogue for Szegő polynomials of the Clenshaw algorithm, On the construction of Szegő polynomials, A superfast method for solving Toeplitz linear least squares problems., The stability of inversion formulas for Toeplitz matrices, Eigenvalue computation for unitary rank structured matrices, Continuation methods for the computation of zeros of Szegő polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• The numerically stable reconstruction of Jacobi matrices from spectral data
• The QR algorithm for unitary Hessenberg matrices
• Updating and Downdating of Orthogonal Polynomials with Data Fitting Applications
• Discrete Least Squares Approximation by Trigonometric Polynomials
• Efficient Methods for Data Smoothing
• Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
• Calculation of Gauss Quadrature Rules
• Solution of Vandermonde systems of equations