Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
From MaRDI portal
Publication:988247
DOI10.1016/j.camwa.2010.01.048zbMath1193.65071OpenAlexW2024083522MaRDI QIDQ988247
Miodrag S. Petković, Jovana Džunić, Ljiljana D. Petković
Publication date: 26 August 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.01.048
iterative methodsmultiple rootsacceleration of convergencesimultaneous methodssolving nonlinear equations
Related Items (13)
A two-parameter family of fourth-order iterative methods with optimal convergence for multiple zeros ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence ⋮ High-order iterative bracketing methods ⋮ Iterative methods for solving nonlinear equations with finitely many roots in an interval ⋮ On constructing two-point optimal fourth-order multiple-root finders with a generic error corrector and illustrating their dynamics ⋮ Traub's accelerating generator of iterative root-finding methods ⋮ On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros ⋮ On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity ⋮ On developing a novel sixth order transformation method for multiple roots and its basins of attraction ⋮ Effective high-order iterative methods via the asymptotic form of the Taylor-Lagrange remainder ⋮ A new biparametric family of two-point optimal fourth-order multiple-root finders ⋮ Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of zero-finding methods by Weierstrass functions
- Numerical methods for roots of polynomials. Part I
- New third order nonlinear solvers for multiple roots
- New families of nonlinear third-order solvers for finding multiple roots
- Enclosing all zeros of an analytic function - a rigorous approach
- A third-order modification of Newton's method for multiple roots
- Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
- On rediscovered iteration methods for solving equations
- An optimal multiple root-finding method of order three
- Modified Newton's method with third-order convergence and multiple roots
- Iterative methods for simultaneous inclusion of polynomial zeros
- On Schröder's families of root-finding methods
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- An algorithm for the total, or partial, factorization of a polynomial
- On K nig's root-finding algorithms*
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A modified Newton method for polynomials
This page was built for publication: Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
