On an iterative algorithm of order 1.839… for solving nonlinear operator equations∗)

DOI10.1080/01630568508816182zbMath0556.65049OpenAlexW2015325974WikidataQ126243010 ScholiaQ126243010MaRDI QIDQ3219701

Florian A. Potra

Publication date: 1984

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630568508816182

zbMATH Keywords

Banach spacessecant-type methodgeneralized divided differencessemi- local, and monotone convergence

Mathematics Subject Classification ID

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

Related Items (38)

An Iterative Method for Solving Nonlinear Operator Equations Using Generalized Divided Differences ⋮ A unifying local-semilocal convergence analysis and applications for two-point Newton-like methods in Banach space ⋮ A unified approach for constructing fast two-step Newton-like methods ⋮ A weak condition for secant method to solve systems of nonlinear equations ⋮ On an iterative algorithm with superquadratic convergence for solving nonlinear operator equations ⋮ Unnamed Item ⋮ Semilocal Convergence of Steffensen-Type Algorithms for Solving Nonlinear Equations ⋮ The super-Halley method using divided differences ⋮ A unified approach for the convergence of certain numerical algorithms, using recurrent functions ⋮ A mesh independence principle for inexact Newton-like methods and their discretizations under generalized Lipschitz conditions ⋮ A Kantorovich-type analysis for a fast iterative method for solving nonlinear equations ⋮ Unified majorizing sequences for Traub-type multipoint iterative procedures ⋮ Local convergence of a secant type method for solving least squares problems ⋮ Expanding the applicability of four iterative methods for solving least squares problems ⋮ On the higher-order method for the solution of a nonlinear scalar equation ⋮ Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions ⋮ Extended sufficient semilocal convergence for the secant method ⋮ A derivative free iterative method for solving least squares problems ⋮ On a quadratically convergent method using divided differences of order one under the gamma condition ⋮ Homocentric convergence ball of the secant method ⋮ A new iterative method of asymptotic order 1+√2 for the computation of fixed points ⋮ On a two-point Newton-like method of convergent order two ⋮ Newton-Kantorovich approximations under weak continuity conditions ⋮ On the secant method ⋮ On a mesh-independence principle for operator equations and the secant method ⋮ On an iterative algorithm of order 1.839\(\dots\) for solving the nonlinear least squares problems ⋮ On the solution of systems of equations with constant rank derivatives ⋮ On the convergence of two-step methods generated by point-to-point operators ⋮ Results on Newton methods. I: A unified approach for constructing perturbed Newton-like methods in Banach space and their applications ⋮ On the convergence of two-step methods generated by point-to-point operators ⋮ Results on Newton methods. I: A unified approach for constructing perturbed Newton-like methods in Banach space and their applications ⋮ Modifications of the interval-Newton-method with improved asymptotic efficiency ⋮ On a convex acceleration of Newton's method ⋮ Homotopy method for a mean curvature-based denoising model ⋮ Sufficient conditions for constructing methods faster than Newton's ⋮ Extended local and semilocal convergence for interpolatory iterative methods for nonlinear equations ⋮ The convergence of a Halley-Chebysheff-type method under Newton- Kantorovich hypotheses ⋮ Extended convergence analysis of the Newton–Potra method under weak conditions

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nichtlineare Majoranten beim Verfahren der schrittweisen Näherung
• Affine invariant convergence results for Newton's method
• Methods without secant steps for finding a bracketed root
• The method of successive approximations for functional equations
• Newton’s Method for Convex Operators in Partially Ordered Spaces
• A new high order method of regula falsi type for computing a root of an equation
• An improved pegasus method for root finding

This page was built for publication: On an iterative algorithm of order 1.839… for solving nonlinear operator equations^∗)