Nonstationary vs. stationary iterative processes

DOI10.1007/S11075-020-00899-5MaRDI QIDQ2220738zbMATH OpenOpenAlexFDO

Authors Luba Sapir, Tamara Kogan, Ariel Sapir, Amir Sapir

Publication date 25 January 2021

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.01404

zbMATH Keywords

index of informational efficiencyiterative methodsKung-Traub conjectureorder of convergence

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Abstract: In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such as, for example, Newton's, Halley's, Chebyshev's methods, there exists an s-nonstationary process of the same order, but of higher efficiency. We supply constructions of these methods, obtain their properties and, for some of them, also their geometric interpretation. The algorithms we present can be transformed into computer programs in straight-forward manner. The methods are demonstrated by numerical examples.

Recommendations

• A nonstationary iterative second-order method for solving nonlinear equations
• The strength of nonstationary iteration
• Some notions of nonstationary multistep iteration processes
• A note on the ``constructing of nonstationary methods for solving nonlinear equations with raised speed of convergence
• The Fibonacci family of iterative processes for solving nonlinear equations

Cites work

• A class of Steffensen type methods with optimal order of convergence
• A new type of recurrence relations for the secant method^∗
• A nonstationary iterative second-order method for solving nonlinear equations
• Aitken type methods with high efficiency
• An acceleration of Newton's method: Super-Halley method
• An improvement to Ostrowski root-finding method
• Dynamics of a family of third-order iterative methods that do not require using second derivatives
• EFFICIENT NUMERICAL METHODS OF AITKEN TYPE AND THEIR DYNAMICS
• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• scientific article; zbMATH DE number 3116991 (Why is no real title available?)
• scientific article; zbMATH DE number 3176372 (Why is no real title available?)
• scientific article; zbMATH DE number 3476451 (Why is no real title available?)
• scientific article; zbMATH DE number 3639065 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• scientific article; zbMATH DE number 3187178 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• scientific article; zbMATH DE number 3048044 (Why is no real title available?)
• scientific article; zbMATH DE number 3052543 (Why is no real title available?)
• Local convergence analysis for Chebyshev's method
• Numerical methods for roots of polynomials. II
• Optimal Order of One-Point and Multipoint Iteration
• The Fibonacci family of iterative processes for solving nonlinear equations
• Third-order iterative methods under Kantorovich conditions
• To the question of efficiency of iterative methods

Cited in

(1)

• Some notions of nonstationary multistep iteration processes

This page was built for publication: Nonstationary vs. stationary iterative processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220738)