Learning algebraic decompositions using Prony structures

From MaRDI portal



Abstract: We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums, polynomials (with respect to the monomial and Chebyshev bases), Gau{ss}ian sums, spherical harmonic sums, taking also into account whether they have their support on an algebraic set.


The recovery of a structured function from sampled data is a fundamental problem in signal processing. The classical Prony method recovers all parameters of a univariate exponential sum from sampled data. Up to now, several variants and multivariate generalizations of the classical Prony method are known. In this paper, the authors analyze the purely algebraic nature of Prony's reconstruction method. Therefore they introduce a general algebraic framework called Prony structures for reconstruction methods. This new approach allows a simultaneous treatment of decomposition problems for multivariate exponential sums, for multivariate polynomials, multivariate Gaussian sums, spherical harmonic sums, and eigenfunction sums.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: Learning algebraic decompositions using Prony structures

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