A globally convergent ball Stirling method (Q1886274)
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: A globally convergent ball Stirling method |
scientific article; zbMATH DE number 2116198
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A globally convergent ball Stirling method |
scientific article; zbMATH DE number 2116198 |
Statements
A globally convergent ball Stirling method (English)
0 references
18 November 2004
0 references
A Stirling iterative method for solving an operator equation \(P(x)=0\), or equivalently, a fixed point equation \(F(x)=x\) can be viewed as a combination of fixed point iteration and Newton iteration. The iterative scheme \(x_{n+1}=x_n-[I-F'(y_n)]^{-1}[x_n-F(x_n)]\) gives a general class of schemes. For \(y_n=x_n\), one has the standard Newton method, and for \(y_n=F(x_n)\), one has the (point) Stirling method. Analogously, ball methods generate a sequence of balls of shrinking radius, which contain a solution. A local convergence result is obtained for a ball-Stirling method. A numerical example is given in which a nonlinear Poisson problem is treated.
0 references
Newton's method
0 references
nonlinear operator equation
0 references
ball Stirling algorithm
0 references
Stirling iterative method
0 references
fixed point iteration
0 references
convergence
0 references
numerical example
0 references
nonlinear Poisson problem
0 references
0 references
0.8601816296577454
0 references
0.8476051688194275
0 references
0.846081018447876
0 references