On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces

DOI10.1137/0916015zbMath0826.65048OpenAlexW2160555573MaRDI QIDQ4325712

Owe Axelsson, Igor E. Kaporin

Publication date: 26 November 1995

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0916015

zbMATH Keywords

subspacenumerical experimentslarge scale systemsdriven cavity probleminexact Newton methodpreconditioningssparse Jacobiandiscrete Bratu equationresidual norm reduction

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations ⋮ A choice of forcing terms in inexact Newton method ⋮ Inexact Newton solvers in plasticity: theory and experiments ⋮ A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations ⋮ A Derivative-Free Nonlinear Least Squares Solver ⋮ Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions ⋮ Newton-type method for solving systems of linear equations and inequalities ⋮ PDE-Constrained Optimization: Optimal control with L 1-Regularization, State and Control Box Constraints ⋮ Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations ⋮ Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations^∗ ⋮ Continuation Newton methods ⋮ Accelerating an inexact Newton/GMRES scheme by subspace decomposition ⋮ An accelerated algebraic multigrid algorithm for total-variation denoising ⋮ Practical quasi-Newton methods for solving nonlinear systems