Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain (Q2202787)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain |
scientific article |
Statements
Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain (English)
0 references
30 September 2020
0 references
In this paper, atomic decompositions of complex vectors \(v = (v_m)_{m=-M}^M\) are studied. An atom is a vector \(a(z) = \big(\exp(- {\mathrm i}\,m\,{\mathrm{arg}}\,z)\big)_{m=-M}^M\) with \(z \in {\mathbb T} = \{z \in \mathbb C : \,|z|=1\}\). If the vector \(v\) has the atomic decomposition \[ v = \sum_{k=1}^K c_k \,a(z_k) \] with distinct \(z_k \in \mathbb T\) and \(c_k \in {\mathbb R} \setminus \{0\}\), then the discrete measure \[ \mu = \sum_{k=1}^K c_k \,\delta(z_k) \] explains \(v\), where \(\delta(z_k)\) is the Dirac measure. The author reviews properties of atomic decompositions, the close relationship with positive semidefinite Toeplitz matrices, and the Prony method to extract the parameters from a linear combination of atoms. He presents a characterization of the existence and uniqueness of a measure explaining \(v\) with minimal total variation norm. This minimal measure is numerically determined by a convex semidefinite program and Prony's method. Further, the author explores the optimal transport between two measures, of which only a finite sequence of Fourier coefficients is known.
0 references
atomic decomposition of vectors
0 references
atoms
0 references
discrete measure
0 references
minimal total variation norm
0 references
Prony method
0 references
positive semidefinite Toeplitz matrix
0 references
convex semidefinite program
0 references
optimal transport between two measures
0 references
trigonometric moments
0 references
0 references
0 references
0 references
0 references
0 references
0 references