Early termination for sparse interpolation of polynomials in Chebyshev bases

DOI10.1016/J.JSC.2025.102507MaRDI QIDQ6892758zbMATH OpenFDO

Authors Erich L. Kaltofen, Zhi-Hong Yang

Publication date 28 November 2025

Published in Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Chebyshev polynomialsProny algorithmLevinson-Durbin algorithmHeinig algorithmsingular Toeplitz matricessparsity determination

Mathematics Subject Classification ID

Numerical interpolation (65D05)

This page was built for publication: Early termination for sparse interpolation of polynomials in Chebyshev bases

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