An Optimization Framework for Polynomial Zerofinders

DOI10.2307/27642061zbMATH Open1157.65370OpenAlexW4236550981MaRDI QIDQ3545884FDOQ3545884

Authors: Bill Gragg, Aaron Melman 

Publication date: 11 December 2008

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/27642061

Recommendations

• A significant improvement on Newton's iterative method
• Algorithm for forming derivative-free optimal methods
• An iterative method for solving nonlinear equations
• Newton's method and some complexity aspects of the zero-finding problem
• A method for solving nonlinear equations

zbMATH Keywords

constrained optimizationnonlinear equationsNewton's methodreal zerospolynomial zerofinders

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Cited In (5)

• Zero-clusters of polynomials: best approach in supercomputing era
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• The double-step Newton method for polynomials with all real zeros
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• The output zeroing problem for general polynomial matrix descriptions

This page was built for publication: An Optimization Framework for Polynomial Zerofinders

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