Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations

DOI10.1007/978-3-662-43799-5_16zbMath1336.65011OpenAlexW12006576MaRDI QIDQ2799561

Matthew T. Comer, Brice Boyer, Erich L. Kaltofen

Publication date: 12 April 2016

Published in: Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43799-5_16

zbMATH Keywords

algorithmnumerical examplenumerical instabilityill-conditioningoutlier detectionsparse representationscomplex argumentapproximate function recoverynumeric and exact polynomial interpolationReed-Solomon error correcting coding algorithmroot finding of derivatives

Mathematics Subject Classification ID

Numerical interpolation (65D05) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Moment problems and interpolation problems in the complex plane (30E05) Polynomials and rational functions of one complex variable (30C10)

Cites Work

• Interpolating polynomials from their values
• Algorithms for computing sparse shifts for multivariate polynomials
• Computational aspects of linear control
• Sparse shifts for univariate polynomials
• Sparse Polynomial Interpolation in Nonstandard Bases
• Symbolic-numeric sparse interpolation of multivariate polynomials

This page was built for publication: Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations