A Levinson--Galerkin Algorithm for Regularized Trigonometric Approximation

DOI10.1137/S1064827597329254zbMath0979.65125arXivmath/9901123OpenAlexW2061390363MaRDI QIDQ2706432

Thomas Strohmer

Publication date: 19 March 2001

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9901123

zbMATH Keywords

performancealgorithmregularizationLevinson algorithmToeplitz matrixfittingmultilevel methodGalerkin algorithmtrigonometric least squares approximation

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Trigonometric approximation (42A10) Iterative numerical methods for linear systems (65F10) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (3)

Fast scattered data approximation with Neumann and other boundary conditions ⋮ Density theorems for nonuniform sampling of bandlimited functions using derivatives or bunched measurements ⋮ Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma

This page was built for publication: A Levinson--Galerkin Algorithm for Regularized Trigonometric Approximation