Computation of adaptive Fourier series by sparse approximation of exponential sums
DOI10.1007/S00041-018-9635-1zbMATH Open1420.42002OpenAlexW2888639905WikidataQ115609275 ScholiaQ115609275MaRDI QIDQ2003603FDOQ2003603
Authors: Vlada Pototskaia, Gerlind Plonka 
Publication date: 9 July 2019
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00041-018-9635-1
Recommendations
convergence rateTakenaka-Malmquist basisinfinite Hankel matricesAAK theoryadaptive Fourier seriesadaptive Fourier sumprony method
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Approximation by other special function classes (41A30) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On approximation of functions by exponential sums
- On two problems concerning linear transformations in Hilbert space
- Operators, functions, and systems: an easy reading. Volume I: Hardy, Hankel, and Toeplitz. Transl. from the French by Andreas Hartmann
- Asymptotic Behavior of Eigenvalues of Hankel Operators
- Fast and accurate con-eigenvalue algorithm for optimal rational approximations
- Sharp estimates for singular values of Hankel operators
- ANALYTIC PROPERTIES OF SCHMIDT PAIRS FOR A HANKEL OPERATOR AND THE GENERALIZED SCHUR-TAKAGI PROBLEM
- An Introduction to Operators on the Hardy-Hilbert Space
- Parameter estimation for nonincreasing exponential sums by Prony-like methods
- Accurate Singular Value Decompositions of Structured Matrices
- Prony methods for recovery of structured functions
- Adaptive Fourier series---a variation of greedy algorithm
- On Completely Continuous Hankel Matrices
- On bounded bilinear forms
- Hankel Matrices
- The fundamental role of general orthonormal bases in system identification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete \(H^\infty\)-optimization. With applications in signal processing and control systems.
- Sparse approximation of functions using sums of exponentials and AAK theory
- Algebraic and Spectral Properties of General Toeplitz Matrices
- Title not available (Why is that?)
- Signal processing. Part II: Control theory and applications. Based on lectures held at the IMA, Minneapolis, MN (USA) from June 27 to August 5, 1988
- Title not available (Why is that?)
- Algorithm of Adaptive Fourier Decomposition
- On the singular values of matrices with displacement structure
- Application of AAK theory for sparse approximation
Cited In (13)
- Adapting rational approximants for Fourier series to data representation problems
- Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm
- Multi-kernel unmixing and super-resolution using the modified matrix pencil method
- Exact reconstruction of extended exponential sums using rational approximation of their Fourier coefficients
- Fast algorithm of adaptive Fourier series
- Adaptive Fourier-Galerkin methods
- Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes
- Exact reconstruction of sparse non-harmonic signals from their Fourier coefficients
- Modifications of Prony's method for the recovery and sparse approximation with generalized exponential sums
- The generalized operator based Prony method
- Pole recovery from noisy data on imaginary axis
- ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application
- Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method
This page was built for publication: Computation of adaptive Fourier series by sparse approximation of exponential sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003603)
