Traub's accelerating generator of iterative root-finding methods
From MaRDI portal
Recommendations
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
- Introduction to higher-order iterative methods for finding multiple roots of nonlinear equations
- A new fourth-order iterative method for finding multiple roots of nonlinear equations
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- Improving the order of convergence of iteration functions
Cites work
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A family of root finding methods
- A modified Newton method for polynomials
- A new continuation Newton-like method and its deformation
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- Improved methods for the simultaneous inclusion of multiple polynomial zeros
- Numerical methods for roots of polynomials. Part I
- On K nig's root-finding algorithms*
- On some applications of circular complex functions
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- Variants of a classic Traub's result
- Zur iterativen Auflösung algebraischer Gleichungen
Cited in
(3)
This page was built for publication: Traub's accelerating generator of iterative root-finding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540311)
