scientific article; zbMATH DE number 1944658

MaRDI QIDQ4407975zbMATH OpenFDO

Authors Gaston H. Gonnet

Publication date 16 November 2003

zbMATH Keywords

comparison of methodsconvergencefar-convergenceHalley's methoditeration formulasLaguerre's methodNewton's methodnumerical examplesOstrowski's methodperformancerandom walkroot finding

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms (68W40)

Recommendations

• A basic family of iteration functions for polynomial root finding and its characterizations
• scientific article; zbMATH DE number 3923973
• The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
• A procedure for obtaining a family of iterative formulas for finding zeros of functions
• scientific article; zbMATH DE number 4007587

Cited in

(1)

• Newton’s Method Without Division

This page was built for publication:

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