.png){kind=icon}
返回
A Levinson-Galerkin algorithm for regularized trigonometric approximation
.png){kind=icon}
OA
AI
DOI：10.1137/S1064827597329254.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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-2) operations (M being the polynomial degree of the approximation and r being the umber 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.
Keyword:
trigonometric approximation
Toeplitz matrix
Levinson algorithm
multilevel method
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
分享收藏分享收藏ASML NXE pellicle update.png)
Photomask Japan 2019: XXVI Symposium on Photomask and Next-Generation Lithography Mask Technology
Photomask Japan 2019: XXVI Symposium on Photomask and Next-Generation Lithography Mask TechnologyIF0
PREAI
分享收藏Advances in Nanoparticle-based Delivery of Next Generation Peptide Nucleic Acids基于纳米颗粒的下一代肽核酸递送研究进展
PREAI
分享收藏
查看更多内容