Approximate Complex Polynomial Evaluation in Near Constant Work Per Point

DOI10.1137/S0097539797324291zbMath1015.65008OpenAlexW2058699929MaRDI QIDQ4268856

John H. Reif

Publication date: 28 October 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797324291

zbMATH Keywords

FFTfast Fourier transformdiscrete Fourier transformDFTapproximate algorithmalgebraic computationmultipoint polynomial evaluationcomplex polynomial evaluation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Conformal mapping in linear time

This page was built for publication: Approximate Complex Polynomial Evaluation in Near Constant Work Per Point