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

DOI10.1090/S0025-5718-97-00845-4zbMath0864.65096OpenAlexW2114693380MaRDI QIDQ3127329

Heike Fassbender

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

algorithmsnumerical examplestrigonometric polynomialstrigonometric approximationdiscrete least squares approximationinverse unitary eigenproblemsSchur parameterunitary Hessenberg matrix

Mathematics Subject Classification ID

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

Related Items (7)

Fast scattered data approximation with Neumann and other boundary conditions ⋮ A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing ⋮ Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions ⋮ 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 ⋮ The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method

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