Rate of convergence of higher-order methods (Q1946151)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Rate of convergence of higher-order methods |
scientific article; zbMATH DE number 6155401
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rate of convergence of higher-order methods |
scientific article; zbMATH DE number 6155401 |
Statements
Rate of convergence of higher-order methods (English)
0 references
18 April 2013
0 references
Considering a quadratic expansion of \(F(x_k + s)\) around the \(k\)-th iterate \(x_k\), the authors derive a unified framework for the Halley class of methods and Schröder's method for solving systems of nonlinear equations \(F(x) = 0\). These methods are single point iterative methods using the first and second derivatives, but with third and second order of convergence rate, respectively. The methods in the Halley class require solutions of two linear systems of equations for each iteration. To improve their efficiency, the authors use the unified framework to derive inexact methods that solve the first system exactly and the second approximately through a few linear fixed point iterations. The authors prove the rates of convergence for these exact and inexact methods with results illustrated through some numerical experiments.
0 references
system of nonlinear equations
0 references
Newton's methods
0 references
Schröder's method
0 references
Chebyshev's method
0 references
Halley's method
0 references
single point iterative method
0 references
convergence
0 references
numerical experiments
0 references
0.8998238
0 references
0.8983177
0 references
0.8941506
0 references
0.8931901
0 references
0.8923197
0 references
0.8880901
0 references
0.8859373
0 references