Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations
From MaRDI portal
Publication:4389264
DOI10.1137/S1064827595296148zbMath0916.65050OpenAlexW2010775269MaRDI QIDQ4389264
Gerard L. G. Sleijpen, Henk A. van der Vorst, Diederik R. Fokkema
Publication date: 12 May 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827595296148
inexact Newton methodsconvergence accelerationnumerical experimentsGMRESJacobi iterationKrylov subspace methodsJacobi-Davidson methodArnoldi methodlinear eigenproblems
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to systems of equations (65H10)
Related Items
Inexact Newton methods for inverse eigenvalue problems ⋮ A choice of forcing terms in inexact Newton method ⋮ Accelerated block preconditioned gradient method for large scale wave functions calculations in density functional theory ⋮ BiCGStab, VPAStab and an adaptation to mildly nonlinear systems ⋮ A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations ⋮ Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems ⋮ Heavy Ball Flexible GMRES Method for Nonsymmetric Linear Systems ⋮ Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems ⋮ Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian ⋮ Comparison of nonlinear field-split preconditioners for two-phase flow in heterogeneous porous media ⋮ Alternative correction equations in the Jacobi-Davidson method ⋮ An inexact Newton-type method for inverse singular value problems ⋮ An inexact Newton method for solving complementarity problems in hydrodynamic lubrication ⋮ Accelerating an inexact Newton/GMRES scheme by subspace decomposition ⋮ The Jacobi-Davidson method ⋮ Preconditioned inexact Newton-like method for large nonsymmetric eigenvalue problems ⋮ Nonlinear Krylov and moving nodes in the method of lines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- On nonlinear generalized conjugate gradient methods
- Generalized conjugate gradient squared
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value Problems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Inexact Newton Methods
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A class of first order factorization methods
- The Davidson Method
- On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- GMRESR: a family of nested GMRES methods
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
