Reconstruction of sparse Legendre and Gegenbauer expansions

DOI10.1007/S10543-015-0598-1MaRDI QIDQ329024zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Legendre polynomialsasymptotic formulaultraspherical polynomialsGegenbauer polynomialsprony-like methodsparse Gegenbauer expansionssparse Gegenbauer interpolationsparse Legendre expansionssparse Legendre interpolationsparse recovering

Mathematics Subject Classification ID

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)

Recommendations

• Sparse Legendre expansions via _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

Cites work

• scientific article; zbMATH DE number 3477793 (Why is no real title available?)
• A continuous approach to discrete ordering on \(\mathbb{S}^2\)
• A fast and simple algorithm for the computation of Legendre coefficients
• A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
• Early termination in sparse interpolation algorithms
• Inequalities for ultraspherical polynomials and the gamma function
• Interpolation via weighted \(\ell_{1}\) minimization
• Nearly optimal sparse Fourier transform
• On the Erdélyi-Magnus-Nevai conjecture for Jacobi polynomials
• Parameter estimation for nonincreasing exponential sums by Prony-like methods
• Random sampling of sparse trigonometric polynomials
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Representation of sparse Legendre expansions
• Some Extensions of W. Gautschi's Inequalities for the Gamma Function
• Sparse Legendre expansions via _1-minimization
• Sparse Polynomial Interpolation in Nonstandard Bases
• Sparse polynomial interpolation in Chebyshev bases
• Symbolic-numeric sparse interpolation of multivariate polynomials
• \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing

Cited in

(6)

• Sparse Legendre expansions via _1-minimization
• Sparse fast DCT for vectors with one-block support
• Nonlinear approximation in bounded orthonormal product bases
• 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)