Nonlinear CG-like iterative methods (Q1196845): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Anthony Theodore Chronopoulos / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Adrian Swift / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized conjugate gradient, least square method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Krylov Methods for Nonlinear Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of Iterative Linear-Equation Solvers in Codes for Large Systems of Stiff IVP<scp>s</scp> for ODE<scp>s</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conjugate Gradient Method for Linear and Nonlinear Operator Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the conjugate gradient method with computationally convenient modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximate Minimization of Functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Methods, Motivation and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Iterative Methods for Nonsymmetric Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution of Linear Equations in ODE Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a two-stage Richardson process for nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5527119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Vectorizable Variant of some ICCG Methods / rank
 
Normal rank
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
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references