Reconstruction of sparse Legendre and Gegenbauer expansions
DOI10.1007/S10543-015-0598-1zbMATH Open1398.65028OpenAlexW2211482116MaRDI QIDQ329024FDOQ329024
Authors: Daniel Potts, Manfred Tasche 
Publication date: 21 October 2016
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-015-0598-1
Recommendations
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Representation of sparse Legendre expansions
- A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
- Sparse polynomial interpolation in Chebyshev bases
Legendre polynomialsasymptotic formulaultraspherical polynomialsGegenbauer polynomialsprony-like methodsparse Gegenbauer expansionssparse Gegenbauer interpolationsparse Legendre expansionssparse Legendre interpolationsparse recovering
Computation of special functions and constants, construction of tables (65D20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical interpolation (65D05) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Approximation by arbitrary linear expressions (41A45)
Cites Work
- Title not available (Why is that?)
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Nearly optimal sparse Fourier transform
- Early termination in sparse interpolation algorithms
- \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Parameter estimation for nonincreasing exponential sums by Prony-like methods
- Some Extensions of W. Gautschi's Inequalities for the Gamma Function
- A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
- Sparse polynomial interpolation in Chebyshev bases
- A fast and simple algorithm for the computation of Legendre coefficients
- On the Erdélyi-Magnus-Nevai conjecture for Jacobi polynomials
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Representation of sparse Legendre expansions
- A continuous approach to discrete ordering on \(\mathbb{S}^2\)
- Sparse Polynomial Interpolation in Nonstandard Bases
- Inequalities for ultraspherical polynomials and the gamma function
- Random sampling of sparse trigonometric polynomials
- Interpolation via weighted \(\ell_{1}\) minimization
Cited In (6)
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Nonlinear approximation in bounded orthonormal product bases
- Sparse fast DCT for vectors with one-block support
- Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method
- Representation of sparse Legendre expansions
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
This page was built for publication: Reconstruction of sparse Legendre and Gegenbauer expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329024)
