Prony's method under an almost sharp multivariate Ingham inequality

From MaRDI portal



Abstract: The parameter reconstruction problem in a sum of Dirac measures from its low frequency trigonometric moments is well understood in the univariate case and has a sharp transition of identifiability with respect to the ratio of the separation distance of the parameters and the order of moments. Towards a similar statement in the multivariate case, we present an Ingham inequality which improves the previously best known dimension-dependent constant from square-root growth to a logarithmic one. Secondly, we refine an argument that an Ingham inequality implies identifiability in multivariate Prony methods to the case of commonly used max-degree by a short linear algebra argument, closely related to a flat extension principle and the stagnation of a generalized Hilbert function.


Let \(t_j \in [0,\,1)^d\), \(j=1,\ldots,M\), be distinct parameters with the separation distance \[ q:= \min_{r\in {\mathbb Z}^d,\, j\not= \ell} \|t_j - t_{\ell} + r\|_{\infty}\,. \] In this nice paper, the authors reconstruct a stream of Dirac's \(\sum_{j=1}^M a_j \, \delta(\cdot \,- t_j)\) with nonzero coefficients \(a_j\in \mathbb C\) from its first trigonometric moments \(\sum_{j=1}^M a_j \,z_j^k\), \(\|k \|_{\infty} \leq n\), with \(z_j := \exp (-2\pi {\mathrm i}\,t_j)\). Then the \(d\)-variate Prony method identifies the parameters of the stream of Dirac's provided the associated Vandermonde matrix \[ A:= \big( z_j^k \big)_{j=1,\ldots,M;\,\|k\|_{\infty}\leq n} \in {\mathbb C}^{M \times (n+1)^d} \] has full rank. Using a new \(d\)-variate discrete Ingham inequality, the authors prove that \(A\) has full rank under the weak condition \(n\,q > 3 + 2\, \log d\).



Cites work









This page was built for publication: Prony's method under an almost sharp multivariate Ingham inequality

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