A fast method for interpolation using preconditioning

DOI10.1016/0020-0190(72)90050-6zbMath0297.65005OpenAlexW2049026388MaRDI QIDQ1214237

Ellis Horowitz

Publication date: 1972

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(72)90050-6

Mathematics Subject Classification ID

Numerical interpolation (65D05) Interpolation in approximation theory (41A05)

Related Items (9)

The complexity of evaluating interpolation polynomials ⋮ Polynomial evaluation and interpolation on special sets of points ⋮ Proofs of Work from worst-case assumptions ⋮ Improved Merlin-Arthur protocols for central problems in fine-grained complexity ⋮ A parallel method for fast and practical high-order Newton interpolation ⋮ Fast modular transforms ⋮ A survey of techniques in applied computational complexity ⋮ Fast computation of divided differences and parallel Hermite interpolation ⋮ Fast approximate computations with Cauchy matrices and polynomials

Cites Work

• Unnamed Item
• Evaluating polynomials at many points
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• The Calculation of Multivariate Polynomial Resultants

This page was built for publication: A fast method for interpolation using preconditioning