Parameter estimation for nonincreasing exponential sums by Prony-like methods

DOI10.1016/J.LAA.2012.10.036zbMath1281.65021OpenAlexW2030098194MaRDI QIDQ389569

Manfred Tasche, Daniel Potts

Publication date: 21 January 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.10.036

zbMATH Keywords

algorithmparameter estimationeigenvalue problemcompanion matrixQR decompositionnonlinear approximationnonlinear inverse problemESPRITexponential fitting problemmatrix pencil factorizationnonincreasing exponential sumProny polynomialProny-like methodrectangular Hankel matrixsparse Fourier approximationsparse trigonometric polynomial

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Trigonometric and exponential sums (general theory) (11L03) Factorization (11Y05) Matrix pencils (15A22)

Related Items (41)

Approximation by amplitude and frequency operators ⋮ Parameter estimation of monomial-exponential sums in one and two variables ⋮ On convergence of the inverse iteration algorithm for modified Prony method ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Reconstruction of sparse Legendre and Gegenbauer expansions ⋮ Prony's method on the sphere ⋮ On rational functions without Froissart doublets ⋮ Learning algebraic decompositions using Prony structures ⋮ Pole recovery from noisy data on imaginary axis ⋮ Analytic continuation from limited noisy Matsubara data ⋮ ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application ⋮ Fully numerical Laplace transform methods ⋮ An iterated quasi-interpolation approach for derivative approximation ⋮ Reconstruction of polygonal shapes from sparse Fourier samples ⋮ Phase retrieval and system identification in dynamical sampling via Prony's method ⋮ Recovery of periodicities hidden in heavy‐tailed noise ⋮ Spherical Bessel transform via exponential sum approximation of spherical Bessel function ⋮ Sparse polynomial interpolation in Chebyshev bases ⋮ Fast ESPRIT algorithms based on partial singular value decompositions ⋮ Sparse sums with bases of Chebyshev polynomials of the third and fourth kind ⋮ Parameter estimation and signal reconstruction ⋮ Interpolation by generalized exponential sums with equal weights ⋮ Vector versions of Prony's algorithm and vector-valued rational approximations ⋮ Prony's method in several variables ⋮ Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method ⋮ Computation of adaptive Fourier series by sparse approximation of exponential sums ⋮ Fast Hankel tensor–vector product and its application to exponential data fitting ⋮ Signal recovery by discrete approximation and a Prony-like method ⋮ Eigenmatrix for unstructured sparse recovery ⋮ ESPRIT for Multidimensional General Grids ⋮ On matrix exponential approximations of ruin probabilities for the classic and Brownian perturbed Cramér-Lundberg processes ⋮ Multi-kernel unmixing and super-resolution using the modified matrix pencil method ⋮ Modifications of Prony's method for the recovery and sparse approximation with generalized exponential sums ⋮ How to get high resolution results from sparse and coarsely sampled data ⋮ Exact reconstruction of sparse non-harmonic signals from their Fourier coefficients ⋮ Prony methods for recovery of structured functions ⋮ Parallel Prony's Method with Multivariate Matrix Pencil Approach and Its Numerical Aspects ⋮ A randomized multivariate matrix pencil method for superresolution microscopy ⋮ New representations of Padé, Padé-type, and partial Padé approximants ⋮ \textsc{mxpfit}: a library for finding optimal multi-exponential approximations ⋮ Data-Driven Algorithms for Signal Processing with Trigonometric Rational Functions

Cites Work

• Unnamed Item
• Unnamed Item
• On the problem of parameter estimation in exponential sums
• Random sampling of sparse trigonometric polynomials
• On the numerical condition of a generalized Hankel eigenvalue problem
• A Prony-like method for non-uniform sampling
• Combinatorial sublinear-time Fourier algorithms
• Parameter estimation for exponential sums by approximate prony method
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Approximation by exponential sums revisited
• Parameter estimation for multivariate exponential sums
• On approximation of functions by exponential sums
• Nonlinear approximation by sums of nonincreasing exponentials
• Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Singular Values of Companion Matrices and Bounds on Zeros of Polynomials
• A Stable Numerical Method for Inverting Shape from Moments
• Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix
• CramÉr–Rao Bounds for Multiple Poles and Coefficients of Quasi-Polynomials in Colored Noise
• A new perturbation analysis for signal enumeration in rotational invariance techniques
• Conditioning of Rectangular Vandermonde Matrices with Nodes in the Unit Disk
• Exponential Data Fitting and its Applications
• Sampling signals with finite rate of innovation
• The Generalized Eigenvalue Problem for Nonsquare Pencils Using a Minimal Perturbation Approach

This page was built for publication: Parameter estimation for nonincreasing exponential sums by Prony-like methods