Downdating of Szegö polynomials and data-fitting applications

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

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

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

interpolationSzegő polynomialsdiscrete inner productleast-squaresHessenberg matricesfast Fourier transform algorithmcomplex-valued function\(QR\) algorithmdata-fittingdowndating scheme

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Approximation in the complex plane (30E10) Numerical interpolation (65D05) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

Related Items

A superfast method for solving Toeplitz linear least squares problems., The stability of inversion formulas for Toeplitz matrices, Szegő-Lobatto quadrature rules, Spectral transformations for Hermitian Toeplitz matrices, Matrices of Sinc methods, 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, A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations, A least squares approach to reduce stable discrete linear systems preserving their stability., Orthogonal polynomials on the unit circle: distribution of zeros, On the stability of solution methods for band Toeplitz systems, Eigenvalue computation for unitary rank structured matrices, Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices, Unitary rank structured matrices, A unified least squares approach to identify and to reduce continuous asymptotically stable systems, An analogue for Szegő polynomials of the Clenshaw algorithm, On the construction of Szegő polynomials, 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, Continuation methods for the computation of zeros of Szegő polynomials, Cascadic multilevel methods for ill-posed problems, 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

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