Traub's accelerating generator of iterative root-finding methods
From MaRDI portal
Publication:540311
DOI10.1016/J.AML.2011.03.027zbMATH Open1291.65152OpenAlexW2073654278MaRDI QIDQ540311FDOQ540311
Authors: J. Džunić, M. R. Milošević, M. S. Petković 
Publication date: 1 June 2011
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.03.027
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
- A modified Newton method for polynomials
- Title not available (Why is that?)
- Numerical methods for roots of polynomials. Part I
- A family of root finding methods
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- Improved methods for the simultaneous inclusion of multiple polynomial zeros
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- On some applications of circular complex functions
- A new continuation Newton-like method and its deformation
- Variants of a classic Traub's result
- Zur iterativen Auflösung algebraischer Gleichungen
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
- On K nig's root-finding algorithms*
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)
