Signal recovery by discrete approximation and a Prony-like method

DOI10.1016/j.cam.2017.05.029zbMath1369.41028MaRDI QIDQ2012599

Michael-Ralf Skrzipek

Publication date: 1 August 2017

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2017.05.029

zbMATH Keywords

linear programming; exponential sum; discrete approximation; overdetermined systems; Prony's method; recovery of structured functions

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

41A50: Best approximation, Chebyshev systems

94A12: Signal theory (characterization, reconstruction, filtering, etc.)

41A30: Approximation by other special function classes

49M25: Discrete approximations in optimal control

Related Items

Computing the minimum construction cost of a building's external wall taking into account its energy efficiency, Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method, Modifications of Prony's method for the recovery and sparse approximation with generalized exponential sums, Parameter estimation and signal reconstruction

Uses Software

• Algorithm 478

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameter estimation for nonincreasing exponential sums by Prony-like methods
• Applications of Szegö polynomials to digital signal processing
• Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
• Szegő polynomials applied to frequency analysis
• Parameter estimation for multivariate exponential sums
• Continuation methods for the computation of zeros of Szegő polynomials
• Szegö polynomials associated with Wiener-Levinson filters
• Nonlinear approximation by sums of nonincreasing exponentials
• A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
• Prony methods for recovery of structured functions
• Numerical Linear Approximation in C
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation
• Norms for Smoothing and Estimation
• Polynomial zerofinders based on Szegő polynomials