A Levinson-Galerkin algorithm for regularized trigonometric approximation
Thomas Strohmer
Abstract
Trigonometric polynomials are widely used for the approximation of a smooth function f from a set of nonuniformly spaced samples \f(xj)\j=0N-1. If the samples are perturbed by noise, controlling the smoothness of the trigonometric approximation becomes an essential issue to avoid overfitting and underfitting of the data. Using the polynomial degree as regularization parameter we derive a multi-level algorithm that iteratively adapts to the least squares solution of optimal smoothness. The proposed algorithm computes the solution in at most O(NM + M2) operations (M being the polynomial degree of the approximation) by solving a family of nested Toeplitz systems. It is shown how the presented method can be extended to multivariate trigonometric approximation. We demonstrate the performance of the algorithm by applying it in echocardiography to the recovery of the boundary of the Left Ventricle.
Create a lesson
Related papers
Neural Network Preconditioning: A Case Study for the Solution of the Parametric Helmholtz Equation
Luc Giraud, Carola Kruse, Paul Mycek et al.
On the cyclic limiting behavior of the restarted Arnoldi algorithm for real symmetric matrices with restart length s=2
Vance Faber, Jarek Liesen, Jörg Liesen et al.
An algebraic multiscale framework for two-level overlapping Schwarz preconditioners
Filipe Cumaru, Hadi Hajibeygi, Cornelis Vuik et al.
Stable Matrix-Free Q-less QR via Preconditioning and Randomization
Oleg Balabanov, Maksim Melnichenko, Michael W. Mahoney
High-order uniformly accurate fully discrete schemes with long time near-conservations for two nonlinear coupled dispersive models in the nonrelativistic regime
Lina Wang, Jiyong Li, Bin Wang
CLNO: Conservative Local Neural Operator for Compressible Flow Prediction
Buxuan Wang, Rongzu Li, Qingsong Zou