Introduction to higher-order iterative methods for finding multiple roots of nonlinear equations
From MaRDI portal
Publication:355694
DOI10.1155/2013/404635zbMath1268.65076WikidataQ59015385 ScholiaQ59015385MaRDI QIDQ355694
Publication date: 25 July 2013
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/404635
65H10: Numerical computation of solutions to systems of equations
Related Items
Iterative methods for multiple roots with memory using self-accelerating technique, Introduction to higher-order iterative methods for finding multiple roots of nonlinear equations, A stable class of modified Newton-like methods for multiple roots and their dynamics, Optimal iterative methods for finding multiple roots of nonlinear equations using free parameters, An optimal scheme for multiple roots of nonlinear equations with eighth-order convergence, A family of optimal eighth order iteration functions for multiple roots and its dynamics, Iteration methods with an auxiliary function for nonlinear equations, Optimal eighth-order iterative methods for approximating multiple zeros of nonlinear functions, Local convergence balls for nonlinear problems with multiplicity and their extension to eighth-order convergence
Cites Work
- Introduction to higher-order iterative methods for finding multiple roots of nonlinear equations
- On some modified families of multipoint iterative methods for multiple roots of nonlinear equations
- Moments in quadrature problems
- Modified Jarratt method for computing multiple roots
- A new fourth-order iterative method for finding multiple roots of nonlinear equations
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- Selection of good algorithms from a family of algorithms for polynomial derivative evaluation
- Optimal Order of One-Point and Multipoint Iteration