Nonlinear CG-like iterative methods (Q1196845): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0377-0427(92)90043-w / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2076821713 / rank | |||
Normal rank |
Latest revision as of 11:12, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonlinear CG-like iterative methods |
scientific article |
Statements
Nonlinear CG-like iterative methods (English)
0 references
16 January 1993
0 references
\textit{J. W. Daniel} [Numer. Math. 10, 125-131 (1967; Zbl 0178.183)] has introduced a conjugate gradient method which applies to nonlinear operators with symmetric Jacobians. A method for nonsymmetric, definite linear systems is Orthomin(1) [\textit{S. C. Eisenstat, H. C. Elman, M. H. Schultz}, SIAM J. Numer. Anal. 20, 345-357 (1983; Zbl 0524.65019)]. This paper discusses a generalization of Orthomin(1) to nonlinear operator equations, each iteration of which requires the solution of a scalar nonlinear equation. It is shown that, under certain conditions, the new method converges to a globally unique solution. Asymptotic steplength estimates and error bounds are also given. Two numerical examples, performed on a vector computer, each based on discretization of a nonlinear differential equation, are used to illustrate variants of nonlinear Orthomin.
0 references
conjugate gradient method
0 references
symmetric Jacobians
0 references
Orthomin(1)
0 references
nonlinear operator equations
0 references
iteration
0 references
asymptotic steplength estimates
0 references
error bounds
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references