Optimal iterative processes for root-finding

DOI10.1007/BF01402555zbMATH Open0252.65041OpenAlexW2079439338WikidataQ56939425 ScholiaQ56939425MaRDI QIDQ2557541FDOQ2557541

Authors: Richard P. Brent, Shmuel Winograd, Philip Wolfe 

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Differentiating Error Terms

Cited In (11)

• A parallel root-finding algorithm
• On optimum root-finding algorithms
• How many steps still left to \(x\)?
• Multipoint methods for solving nonlinear equations: a survey
• On some interval methods for algebraic, exponential and trigonometric polynomials
• On generalized biparametric multipoint root finding methods with memory
• Optimal solution of nonlinear equations
• A survey on the high convergence orders and computational convergence orders of sequences
• Maximal order for multipoint methods with memory using hermitian information
• Bounds for the R-order of certain iterative numerical processes
• Several new methods for solving equations

Uses Software

• BRENT

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

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