Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations
From MaRDI portal
Publication:2855735
DOI10.1080/00207160.2012.744000zbMath1278.65062OpenAlexW2156108917MaRDI QIDQ2855735
Publication date: 22 October 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.744000
numerical examplesiterative methodnonlinear equationsorder of convergenceroot-finding methodssimultaneous methodsmultiple zeroderivative free
Numerical computation of solutions to single equations (65H05) Numerical computation of roots of polynomial equations (65H04)
Related Items (7)
ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS ⋮ Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros ⋮ On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously ⋮ On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation ⋮ ON EFFICIENT FRACTIONAL CAPUTO-TYPE SIMULTANEOUS SCHEME FOR FINDING ALL ROOTS OF POLYNOMIAL EQUATIONS WITH BIOMEDICAL ENGINEERING APPLICATIONS ⋮ Study of dynamical behavior and stability of iterative methods for nonlinear equation with applications in engineering ⋮ On dynamics of iterative techniques for nonlinear equation with applications in engineering
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Basin attractors for various methods for multiple roots
- A derivative-free iterative method for simultaneously computing an arbitrary number of zeros of nonlinear equations
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- Zero-finder methods derived using Runge-Kutta techniques
- Sixth order derivative free family of iterative methods
- The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic
- Root-finding by expansion with independent constraints
- A high order iteration formula for the simultaneous inclusion of polynomial zeros
- A note on some recent methods for solving nonlinear equations
- New iterative schemes for nonlinear equations
- 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
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
- A third-order modification of Newton's method for multiple roots
- On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial
- On the R-order of convergence of a family of methods for simultaneous extraction of part of all roots of algebraic polynomials
- Dynamics of a higher-order family of iterative methods
- On some families of multi-point iterative methods for solving nonlinear equations
- High-order nonlinear solver for multiple roots
- An efficient higher order family of root finders
- Some methods for simultaneous extraction of a part of all multiple roots of algebraic polynomials
- An acceleration of iterative processes for solving nonlinear equations
- On Schröder's families of root-finding methods
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Constructing third-order derivative-free iterative methods
- Extension of Murakami's high-order non-linear solver to multiple roots
- A higher order method for multiple zeros of nonlinear functions
This page was built for publication: Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations
