Developing a new family of Newton-Secant method with memory based on a weight function
From MaRDI portal
Publication:1689265
Recommendations
- A new family of Newton-type iterative methods with and without memory for solving nonlinear equations
- A family of two-point methods with memory for solving nonlinear equations
- High-order Newton-type iterative methods with memory for solving nonlinear equations
- Some Newton-type iterative methods with and without memory for solving nonlinear equations
- A family of Newton-type iterative methods using some special self-accelerating parameters
Cites work
- A family of fourth-order Steffensen-type methods with the applications on solving nonlinear ODEs
- A new class of optimal four-point methods with convergence order 16 for solving nonlinear equations
- A new class of three-point methods with optimal convergence order eight and its dynamics
- A study of optimization for Steffensen-type methods with frozen divided differences
- A two-step Steffensen's method under modified convergence conditions
- A variant of Newton's method with accelerated third-order convergence
- A variant of Steffensen's method of fourth-order convergence and its applications
- An optimal Steffensen-type family for solving nonlinear equations
- Computing multiple zeros by using a parameter in Newton-secant method
- Dynamics of a family of third-order iterative methods that do not require using second derivatives
- Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
- Graphic and numerical comparison between iterative methods
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Multipoint methods for solving nonlinear equations
- New modification of Maheshwari's method with optimal eighth order convergence for solving nonlinear equations
- On a Steffensen's type method and its behavior for semismooth equations
- Optimal Newton-secant like methods without memory for solving nonlinear equations with its dynamics
- Optimal Order of One-Point and Multipoint Iteration
- Review of some iterative root-finding methods from a dynamical point of view
- Solving nonlinear equations by a derivative-free form of the King's family with memory
- Some efficient derivative free methods with memory for solving nonlinear equations
- Variants of Newton's method using fifth-order quadrature formulas
Cited in
(7)- On developing a higher-order family of double-Newton methods with a bivariate weighting function
- A multi-point iterative method for solving nonlinear equations with optimal order of convergence
- Review of some iterative methods for solving nonlinear equations with multiple zeros
- High-order Newton-type iterative methods with memory for solving nonlinear equations
- Developing two efficient adaptive Newton-type methods with memory
- Modified Newton's method with memory
- From Halley to secant: redefining root finding with memory-based methods including convergence and stability
This page was built for publication: Developing a new family of Newton-Secant method with memory based on a weight function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689265)