Approximate Complex Polynomial Evaluation in Near Constant Work Per Point

DOI10.1137/S0097539797324291MaRDI QIDQ4268856zbMATH OpenOpenAlexFDO

Authors J. 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

algebraic computationapproximate algorithmcomplex polynomial evaluationDFTdiscrete Fourier transformfast Fourier transformFFTmultipoint polynomial evaluation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1559519
• An algebraic approach to approximate evaluation of a polynomial on a set of real points
• scientific article; zbMATH DE number 1405666

Cited in

(6)

• Lower bounds for polynomial evaluation and interpolation problems
• An algebraic approach to approximate evaluation of a polynomial on a set of real points
• scientific article; zbMATH DE number 1559519 (Why is no real title available?)
• Simple proofs of lower bounds for polynomial evaluation
• Conformal mapping in linear time
• Fast evaluation of real and complex polynomials

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

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