From Halley to secant: redefining root finding with memory-based methods including convergence and stability
From MaRDI portal
Publication:6559945
Cites work
- A comparison between iterative methods by using the basins of attraction
- A comparison of some fixed point iteration procedures by using the basins of attraction
- A multidimensional dynamical approach to iterative methods with memory
- Computational geometry as a tool for studying root-finding methods
- Derivative free two-point methods with and without memory for solving nonlinear equations
- Developing a new family of Newton-Secant method with memory based on a weight function
- Developing two efficient adaptive Newton-type methods with memory
- Fractal patterns from the dynamics of combined polynomial root finding methods
- Geometric constructions of iterative functions to solve nonlinear equations
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Machine-learning error models for approximate solutions to parameterized systems of nonlinear equations
- Modified Newton's method with memory
- Numerical comparison of iterative methods for solving nonlinear equations
- ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS
- Polynomial root-finding and polynomiography
- Semilocal convergence analysis of an efficient Steffensen-type fourth order method
- Several iterative methods with memory using self-accelerators
- Some real-life applications of a newly constructed derivative free iterative scheme
- Some variants of Halley's method with memory and their applications for solving several chemical problems
- The theory and applications of iteration methods
- Weaker conditions for the convergence of Newton's method
Cited in
(8)- Qualitative properties and optimal control strategy on a novel fractional three-species food chain model
- On mathematical model of infectious disease by using fractals fractional analysis
- Memory based approaches to one-dimensional nonlinear models
- A high-efficiency fourth-order iterative method for nonlinear equations: convergence and computational gains
- Comment on: ``From Halley to secant: redefining root finding with memory-based methods including convergence and stability
- A convergent and stable fourth-order iterative procedure based on Kung-Traub conjecture for nonlinear systems
- A modified two-step optimal iterative method for solving nonlinear models in one and higher dimensions
- Extending the applicability of improved Chebyshev-Secant-type methods
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)