Optimal iterative processes for root-finding

DOI10.1007/BF01402555zbMath0252.65041OpenAlexW2079439338WikidataQ56939425 ScholiaQ56939425MaRDI QIDQ2557541

Richard P. Brent, Philip Wolfe, Shmuel Winograd

Publication date: 1973

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132196

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (11)

Bounds for the R-order of certain iterative numerical processes ⋮ Optimal solution of nonlinear equations ⋮ A parallel root-finding algorithm ⋮ Several new methods for solving equations ⋮ Multipoint methods for solving nonlinear equations: a survey ⋮ On generalized biparametric multipoint root finding methods with memory ⋮ A survey on the high convergence orders and computational convergence orders of sequences ⋮ On optimum root-finding algorithms ⋮ Maximal order for multipoint methods with memory using hermitian information ⋮ How Many Steps Still Left to $x$*? ⋮ On some interval methods for algebraic, exponential and trigonometric polynomials

Uses Software

• BRENT

Cites Work

• On Differentiating Error Terms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal iterative processes for root-finding