Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method

DOI10.4208/JCM.2104-M2020-0250MaRDI QIDQ5881246zbMATH OpenOpenAlexFDO

Authors Renzhong Feng, Aitong Huang, Ming-Jun Lai, Zhaiming Shen

Publication date 9 March 2023

Published in Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/jcm.2104-m2020-0250

zbMATH Keywords

compressive sensingmutual coherencequasi-orthogonal matching pursuit algorithmreconstruction of sparse polynomial

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15)

Recommendations

• The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
• Sparse Legendre expansions via _1-minimization
• Reconstruction of sparse Legendre and Gegenbauer expansions
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Sparse Recovery via ℓ_q-Minimization for Polynomial Chaos Expansions

Cites work

• A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
• Compressed sensing
• Compressed sensing and best \(k\)-term approximation
• Compressed sensing: a survey
• Foundations of Modern Probability
• Generalized Orthogonal Matching Pursuit
• Greed is Good: Algorithmic Results for Sparse Approximation
• scientific article; zbMATH DE number 3139051 (Why is no real title available?)
• scientific article; zbMATH DE number 3469437 (Why is no real title available?)
• Infinite-dimensional compressed sensing and function interpolation
• Interpolation via weighted \(\ell_{1}\) minimization
• On sparse interpolation and the design of deterministic interpolation points
• On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
• Orthogonal matching pursuit under the restricted isometry property
• Orthogonal polynomials of several variables
• Random sampling of sparse trigonometric polynomials
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse Legendre expansions via _1-minimization
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Theoretical foundations and numerical methods for sparse recovery. Papers based on the presentations of the summer school ``Theoretical foundations and numerical methods for sparse recovery, Vienna, Austria, August 31 -- September 4, 2009.

Cited in

(4)

• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Sparse Recovery via ℓ_q-Minimization for Polynomial Chaos Expansions
• Orthogonal polynomial projection quantization: a new Hill determinant method
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials

This page was built for publication: Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881246)