From Halley to secant: redefining root finding with memory-based methods including convergence and stability
DOI10.1002/MMA.9876zbMATH Open1547.65051MaRDI QIDQ6559945
Amanullah Soomro, Ioannis K. Argyros, Sania Qureshi, Aydin Secer, Aisha A. Alshaery, Krzysztof Gdawiec, Amir Naseem
Publication date: 21 June 2024
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Numerical computation of solutions to single equations (65H05) Rate of convergence, degree of approximation (41A25) Applications of functional analysis in numerical analysis (46N40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weaker conditions for the convergence of Newton's method
- Derivative free two-point methods with and without memory for solving nonlinear equations
- A comparison between iterative methods by using the basins of attraction
- Numerical comparison of iterative methods for solving nonlinear equations
- Geometric constructions of iterative functions to solve nonlinear equations
- Several iterative methods with memory using self-accelerators
- Fractal patterns from the dynamics of combined polynomial root finding methods
- Developing a new family of Newton-Secant method with memory based on a weight function
- A multidimensional dynamical approach to iterative methods with memory
- Machine-learning error models for approximate solutions to parameterized systems of nonlinear equations
- Some variants of Halley's method with memory and their applications for solving several chemical problems
- Some real-life applications of a newly constructed derivative free iterative scheme
- Computational geometry as a tool for studying root-finding methods
- The Theory and Applications of Iteration Methods
- Developing two efficient adaptive Newton‐type methods with memory
- ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS
- Semilocal convergence analysis of an efficient Steffensen-type fourth order method
Related Items (3)
This page was built for publication: From Halley to secant: redefining root finding with memory-based methods including convergence and stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559945)