Methods of Search for Solving Polynomial Equations

DOI10.1145/321574.321581MaRDI QIDQ5627581zbMATH OpenOpenAlexFDO

Authors Peter Henrici

Publication date 1970

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321574.321581

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cited in

(6)

• Improving a method of search for solving polynomial equations
• An adaptive subdivision method for root finding of univariate polynomials
• The complexity of subdivision for diameter-distance tests
• Circular arithmetic and the determination of polynomial zeros
• Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
• SqFreeEVAL: An (almost) optimal real-root isolation algorithm

This page was built for publication: Methods of Search for Solving Polynomial Equations

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