Discrete Least Squares Approximation by Trigonometric Polynomials
From MaRDI portal
Publication:3359714
DOI10.2307/2938673zbMath0733.65102MaRDI QIDQ3359714
Lothar Reichel, William B. Gragg, Gregory S. Ammar
Publication date: 1991
Full work available at URL: https://doi.org/10.2307/2938673
trigonometric polynomials; QR decomposition; algebraic polynomials; unitary Hessenberg matrices; inverse eigenproblem; discrete least squares approximation
65D10: Numerical smoothing, curve fitting
42A10: Trigonometric approximation
65T40: Numerical methods for trigonometric approximation and interpolation
Related Items
Complexity reduction of least squares problems involving special Vandermonde matrices, Spectral transformations for Hermitian Toeplitz matrices, Downdating of Szegö polynomials and data-fitting applications, A parallel algorithm for discrete least squares rational approximation, Perturbation and interlace theorems for the unitary eigenvalue problem, Algorithms for robust identification in \({\mathcal H}_\infty\) with nonuniformly spaced frequency response data, A discrete theory of irregular sampling, Discrete linearized least-squares rational approximation on the unit circle, Numerical analysis of non-uniform sampling problem, Orthonormal rational function vectors, An analogue for Szegő polynomials of the Clenshaw algorithm, On the construction of Szegő polynomials, On an inverse eigenvalue problem for unitary Hessenberg matrices, Fast scattered data approximation with Neumann and other boundary conditions, Construction of polynomials that are orthogonal with respect to a discrete bilinear form, Eigenvalue computation for unitary rank structured matrices, Irregular sampling, Toeplitz matrices, and the approximation of entire functions of exponential type
