Sparse Polynomial Interpolation in Nonstandard Bases

DOI10.1137/S0097539792237784zbMath0827.68058OpenAlexW2017373663MaRDI QIDQ4834388

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 basisPochhammer basisinterpolating univariate polynomials

Mathematics Subject Classification ID

Related Items (15)

Early termination in sparse interpolation algorithms ⋮ An improved early termination sparse interpolation algorithm for multivariate polynomials ⋮ Reconstruction of sparse Legendre and Gegenbauer expansions ⋮ Sparse shifts for univariate polynomials ⋮ Learning algebraic decompositions using Prony structures ⋮ Sparse polynomial interpolation with Bernstein polynomials ⋮ ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application ⋮ A local decision test for sparse polynomials ⋮ Multiscale matrix pencils for separable reconstruction problems ⋮ Mini-workshop: Interpolation, approximation, and algebra. Abstracts from the mini-workshop held February 13--19, 2022 ⋮ Sparse polynomial interpolation in Chebyshev bases ⋮ The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case ⋮ On computing the degree of a Chebyshev polynomial from its value ⋮ Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations ⋮ Sparse interpolation in terms of multivariate Chebyshev polynomials

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