No label defined (Q4464979)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2068406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2068406 |
Statements
27 May 2004
0 references
nonlinear operator equation
0 references
discretization
0 references
Newton method
0 references
Lipschitz condition
0 references
Banach space
0 references
mesh independence principal
0 references
0.9007471799850464
0 references
0.8729953765869141
0 references
The Newton method is considered for approximating locally unique solutions of the nonlinear operator equation \(F(x)=0\) and its discretization \(P_h(y)=0\). Here \(F\) is a Fréchet-differentiable operator from the Banach space \(X\) into \(Y\), and \(P_h\) is a discretization of \(F\). The mesh independence principal states that the Newton method for the continuous and discrete problems differs at most by one in the number of steps required to converge to within a given tolerance. Using a combination of Lipschitz and center-Lipschitz conditions: \[ \| F'(x_0)^{-1}[F'(x)-F'(x_0)]\| \leq b\| x-x_0\| \quad\text{and}\quad \| F'(x_0)^{-1}[F''(x)-F''(y)]\| \leq a\| x-y\| , \] the author improves the error estimate, radius of convergence and number of iterations in the previous study of the mesh independence principal.
0 references