On numerical methods for discrete least-squares approximation by trigonometric polynomials

DOI10.1090/S0025-5718-97-00845-4MaRDI QIDQ3127329zbMATH OpenOpenAlexFDO

Authors Heike Faßbender

Publication date 8 April 1997

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0025-5718-97-00845-4

zbMATH Keywords

algorithmsdiscrete least squares approximationinverse unitary eigenproblemsnumerical examplesSchur parametertrigonometric approximationtrigonometric polynomialsunitary Hessenberg matrix

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• scientific article; zbMATH DE number 741186
• Discrete Least Squares Approximation by Trigonometric Polynomials
• A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials

Cited in

(15)

• On polynomial approximation in the uniform norm by the discrete least squares method
• The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
• Fast scattered data approximation with Neumann and other boundary conditions
• A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials
• A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations
• Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices
• Fast QR iterations for unitary plus low rank matrices
• A Levinson-Galerkin algorithm for regularized trigonometric approximation
• Discrete Least Squares Approximation by Trigonometric Polynomials
• Stability Results for Scattered Data Interpolation by Trigonometric Polynomials
• Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
• scientific article; zbMATH DE number 741186 (Why is no real title available?)
• Lasso trigonometric polynomial approximation for periodic function recovery in equidistant points
• A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing
• Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

This page was built for publication: On numerical methods for discrete least-squares approximation by trigonometric polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3127329)