A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation
From MaRDI portal
Publication:4117311
DOI10.1137/0205047zbMath0347.65025OpenAlexW2070864561MaRDI QIDQ4117311
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205047
Analysis of algorithms and problem complexity (68Q25) Numerical interpolation (65D05) Numerical computation of solutions to single equations (65H05) Algorithms for approximation of functions (65D15) Algorithms in computer science (68W99)
Related Items (5)
The equivalence of decimation in time and decimation in frequency in FFT computations ⋮ Fast systematic encoding of multiplicity codes ⋮ Fast computation of divided differences and parallel Hermite interpolation ⋮ Fast Hermite interpolation and evaluation over finite fields of characteristic two ⋮ Lifted Multiplicity Codes and the Disjoint Repair Group Property
This page was built for publication: A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation
