Sparse Polynomial Interpolation in Nonstandard Bases

DOI10.1137/S0097539792237784MaRDI QIDQ4834388zbMATH OpenOpenAlexFDO

Authors Y. N. Lakshman, B. David Saunders

Publication date 13 December 1995

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792237784

zbMATH Keywords

Chebyshev basisinterpolating univariate polynomialsPochhammer basis

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Sparse polynomial interpolation with arbitrary orthogonal polynomial bases
• Error-correcting sparse interpolation in the Chebyshev basis
• Sparse polynomial interpolation with Bernstein polynomials
• Sparse polynomial interpolation with finitely many values for the coefficients
• Interpolation of shifted-lacunary polynomials

Cited in

(23)

• An improved early termination sparse interpolation algorithm for multivariate polynomials
• Sparse polynomial interpolation with finitely many values for the coefficients
• Early termination in sparse interpolation algorithms
• Sparse shifts for univariate polynomials
• Sparse interpolation in terms of multivariate Chebyshev polynomials
• Learning algebraic decompositions using Prony structures
• On computing the degree of a Chebyshev polynomial from its value
• Sparse polynomial interpolation in Chebyshev bases
• ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application
• Mini-workshop: Interpolation, approximation, and algebra. Abstracts from the mini-workshop held February 13--19, 2022
• Sparse polynomial interpolation by variable shift in the presence of noise and outliers in the evaluations
• Error-correcting sparse interpolation in the Chebyshev basis
• The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case
• Reconstruction of sparse Legendre and Gegenbauer expansions
• A local decision test for sparse polynomials
• Sparse polynomial interpolation with Bernstein polynomials
• Sparse polynomial interpolation with arbitrary orthogonal polynomial bases
• Randomized interpolation and approximation of sparse polynomials stPreliminary version
• Multiscale matrix pencils for separable reconstruction problems
• Interpolation of shifted-lacunary polynomials
• -discrepancy sets and their application for interpolation of sparse polynomials
• Early termination for sparse interpolation of polynomials in Chebyshev bases
• Sparse polynomial interpolation with error correction: higher error capacity by randomization

This page was built for publication: Sparse Polynomial Interpolation in Nonstandard Bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834388)