Predetermining the number of periodic steps in multi-step Newton-like methods for solving equations and systems of equations

DOI10.1016/j.amc.2018.02.024zbMath1427.65088OpenAlexW2792582403MaRDI QIDQ2318238

Ioannis K. Argyros, Ștefan Mărușter

Publication date: 14 August 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.02.024

zbMATH Keywords

Banach spaceeuclidean spacesemi-local convergencesystems of differential equationscenter-Lipschitz and Lipschitz conditionsmulti-step Newton-type method

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Cites Work

• Unnamed Item
• Unnamed Item
• On an efficient \(k\)-step iterative method for nonlinear equations
• On an improved convergence analysis of Newton's method
• Weaker conditions for the convergence of Newton's method
• How to improve the domain of parameters for Newton's method
• Estimating the radius of an attraction ball
• On the Mann iteration process in a Hilbert space
• Thresholds of the inner steps in multi-step Newton method
• Estimating the local radius of convergence for Picard iteration
• On the local convergence of a third order family of iterative processes
• Iterative Methods and Their Dynamics with Applications
• The Solution by Iteration of Nonlinear Equations in Hilbert Spaces

This page was built for publication: Predetermining the number of periodic steps in multi-step Newton-like methods for solving equations and systems of equations