@Article{JCM-41-1,
author = {Renzhong, Feng and Huang, Aitong and Ming-Jun, Lai and Zhaiming, Shen},
title = {Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method},
journal = {Journal of Computational Mathematics},
year = {2023},
volume = {41},
number = {1},
pages = {18--38},
abstract = {<p style="text-align: justify;">In this paper, we propose a Quasi-Orthogonal Matching Pursuit (QOMP) algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials. For the two kinds of sampled data, data with noises and without noises, we apply the mutual coherence of measurement matrix to establish the convergence of&nbsp; the QOMP algorithm which can reconstruct $s$-sparse Legendre polynomials, Chebyshev polynomials and&nbsp; trigonometric polynomials in $s$ step iterations. The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials. Finally, numerical experiments will be presented to verify the effectiveness of the QOMP method.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.2104-m2020-0250},
url = {https://global-sci.com/article/84103/reconstruction-of-sparse-polynomials-via-quasi-orthogonal-matching-pursuit-method}
}