Globally Convergent Algorithm for Solving Large Nonlinear Systems of Equations

DOI10.1081/NFA-120039609zbMath1071.65071OpenAlexW1579164926MaRDI QIDQ3157825

Mohammedi R. Abdel-Aziz

Publication date: 19 January 2005

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1081/nfa-120039609

zbMATH Keywords

algorithmglobal convergenceKrylov subspace methodinexact Newton methodimplicitly restarted Arnoldi methodline search strategylarge systems of nonlinear equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items

Newton-Krylov type algorithm for solving nonlinear least squares problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid Krylov Methods for Nonlinear Systems of Equations
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
• Preconditioning of Truncated-Newton Methods
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Inexact Newton Methods
• The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
• Newton’s Method with a Model Trust Region Modification
• Preconditioners for Indefinite Systems Arising in Optimization
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Safeguarded use of the implicit restarted lanczos technique for solving non‐linear structural eigensystems
• Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
• Implicitly restarted projection algorithm for solving optimization problems
• Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
• Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
• A Local Convergence Theory for Combined Inexact-Newton/Finite-Difference Projection Methods