Metraipolis › archive › dc_2cd08e826963
Sparse Approximation via Polynomial Equations — arXiv:2609.11215
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11215
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:10:12.327Z
- SHA-256 of the archived text
c8109afa7d3eea104a8ea08d9b62cb577235a23cc9d76b07b372a283adafd5e6- Stable URL of this page
https://metraipolis.com/documento/dc_2cd08e826963
How to cite
Sparse Approximation via Polynomial Equations — arXiv:2609.11215 — arXiv (en), https://arxiv.org/abs/2609.11215 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2cd08e826963 (Metraipolis archive dc_2cd08e826963, sha256 c8109afa7d3eea104a8ea08d9b62cb577235a23cc9d76b07b372a283adafd5e6)
BibTeX
@misc{dc2cd08e826963,
title = {Sparse Approximation via Polynomial Equations — arXiv:2609.11215},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11215},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2cd08e826963; sha256 c8109afa7d3eea104a8ea08d9b62cb577235a23cc9d76b07b372a283adafd5e6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11215. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider the problem of finding sparse solutions of an underdetermined linear system $Ax=b$. In contrast to conventional approaches based on greedy algorithms or convex relaxation, we reformulate sparse approximation as a structured system of polynomial equations and connect with the literature on tensor methods. We develop an eigenvalue decomposition based method that formally guarantees recovery of all sparse solutions if there is more than one. We also develop two optimization-based methods achieving favorable computational complexity. The new methods allow explicit control of the target sparsity. Numerical experiments illustrate the performance and compare to basis pursuit (denoising) and orthogonal matching pursuit. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.NA). Categorie arXiv: Signal Processing (eess.SP) ; Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.11215 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T05:55:33.345Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).