Computation of adaptive Fourier series by sparse approximation of exponential sums
From MaRDI portal
Publication:2003603
Recommendations
Cites work
- scientific article; zbMATH DE number 3836771 (Why is no real title available?)
- scientific article; zbMATH DE number 3991689 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 193258 (Why is no real title available?)
- scientific article; zbMATH DE number 1875877 (Why is no real title available?)
- scientific article; zbMATH DE number 3260990 (Why is no real title available?)
- ANALYTIC PROPERTIES OF SCHMIDT PAIRS FOR A HANKEL OPERATOR AND THE GENERALIZED SCHUR-TAKAGI PROBLEM
- Accurate Singular Value Decompositions of Structured Matrices
- Adaptive Fourier series---a variation of greedy algorithm
- Algebraic and Spectral Properties of General Toeplitz Matrices
- Algorithm of Adaptive Fourier Decomposition
- An Introduction to Operators on the Hardy-Hilbert Space
- Application of AAK theory for sparse approximation
- Asymptotic Behavior of Eigenvalues of Hankel Operators
- Discrete \(H^\infty\)-optimization. With applications in signal processing and control systems.
- Fast and accurate con-eigenvalue algorithm for optimal rational approximations
- Hankel Matrices
- On Completely Continuous Hankel Matrices
- On approximation of functions by exponential sums
- On bounded bilinear forms
- On the singular values of matrices with displacement structure
- 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
- Parameter estimation for nonincreasing exponential sums by Prony-like methods
- Prony methods for recovery of structured functions
- Sharp estimates for singular values of Hankel operators
- 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
- Sparse approximation of functions using sums of exponentials and AAK theory
- The fundamental role of general orthonormal bases in system identification
Cited in
(13)- Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm
- Modifications of Prony's method for the recovery and sparse approximation with generalized exponential sums
- Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes
- Fast algorithm of adaptive Fourier series
- The generalized operator based Prony method
- Adaptive Fourier-Galerkin methods
- Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method
- Adapting rational approximants for Fourier series to data representation problems
- 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
- Pole recovery from noisy data on imaginary axis
- ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application
- Exact reconstruction of sparse non-harmonic signals from their Fourier coefficients
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)
