mlsanityData to 14 Oct 2026

Eigenmatrix for unstructured sparse recovery

arXiv 2311.16609 ↗First posted 28 Nov 2023math.NA cs.IT cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

This note considers the unstructured sparse recovery problems in a general form. Examples include rational approximation, spectral function estimation, Fourier inversion, Laplace inversion, and sparse deconvolution. The main challenges are the noise in the sample values and the unstructured nature of the sample locations. This note proposes the eigenmatrix, a data-driven construction with desired approximate eigenvalues and eigenvectors. The eigenmatrix offers a new way for these sparse recovery problems. Numerical results are provided to demonstrate the efficiency of the proposed method.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 0 of its 42 references that are in the map. First posted on arXiv 28 Nov 2023.

Builds on

0 of 42 references.

No references here yet.

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.