Back to Search
Start Over
A LEVINSON-GALERKIN ALGORITHM FOR REGULARIZED TRIGONOMETRIC APPROXIMATION.
- Source :
- SIAM Journal on Scientific Computing; 2000, Vol. 22 Issue 4, p1160-1183, 24p
- Publication Year :
- 2000
-
Abstract
- Trigonometric polynomials are widely used for the approximation of a smooth function from a set of nonuniformly spaced samples. If the samples are perturbed by noise, a good choice for the polynomial degree of the trigonometric approximation becomes an essential issue to avoid overfitting and underfitting of the data. Standard methods for trigonometric least squares approximation assume that the degree for the approximating polynomial is known a priori, which is usually not the case in practice. We derive a multilevel algorithm that recursively adapts to the least squares solution of suitable degree. We analyze under which conditions this multilevel approach yields the optimal solution. The proposed algorithm computes the solution in at most O(rM + M<superscript>2</superscript>) operations (M being the polynomial degree of the approximation and r being the number of samples) 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 of the heart. Key words: trigonometric approximation; Toeplitz matrix; Levinson algorithm; multilevel method [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10648275
- Volume :
- 22
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- SIAM Journal on Scientific Computing
- Publication Type :
- Academic Journal
- Accession number :
- 13205224
- Full Text :
- https://doi.org/10.1137/S1064827597329254