No label defined (Q3746802)
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 3982415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3982415 |
Statements
1986
0 references
complexity
0 references
iteration methods
0 references
rate of convergence
0 references
nonstationary approximate methods
0 references
Hilbert space
0 references
Steffensen's method
0 references
chord method
0 references
minimal discrepancies
0 references
fastest descent methods
0 references
0.8164729475975037
0 references
0.8129271268844604
0 references
Numerous practical problems which reduce to a solution of the nonlinear operator equations (1) \(P(x)=0\), the complexity of solving them using many well-known iteration methods, or the slow rate of convergence of some of the methods explain the urgency of the problem of constructing methods for the approximate solution of equation (1), possessing a simple calculational scheme which is convenient for practical application, and having, at the same time, a rapid rate of convergence. We propose some nonstationary approximate methods - whose iteration parameters have a simple structure - to solve nonlinear equations (1) with an operator P which operates in a real Hilbert space \(H_ D\) with the scalar product \((x,y)_ D=(Dx,y)\) and the norm \(\| x\|_ D=\sqrt{(Dx,x)}\), where D is a self-adjoint operator that is positive definite in H. As shown by practical calculations, these methods have a fairly rapid rate of convergence. Methods such as Steffensen's method, the chord method and versions of the minimal discrepancies and fastest descent methods occur in the iteration schemes considered as special cases. The methods described in this paper can also be used to solve linear operator equations.
0 references