The Newton-arithmetic mean method for the solution of systems of nonlinear equations.
Newton-iterative methods for large systems of nonlinear equations with a block-structured Jacobian are considered. For solving the linear system at each stage of Newton's method the arithmetic mean method is considered, which is based on two particular block-diagonal splitting matrices for the Jacobian, and, therefore, is well suited for implementation on parallel computers. The convergence of the method is analyzed for systems whose Jacobian satisfies an affine invariant Lipschitz condition. The case of weakly nonlinear systems, which arise, for example, from the discretization of semi-linear elliptic systems, is considered in more details, and numerical experiments are reported for such a problem.
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A parallel algorithm for solving block tridiagonal linear systems
- Affine invariant convergence results for Newton's method
- Affine Invariant Convergence Theorems for Newton’s Method and Extensions to Related Methods
- An iterative method for large sparse linear systems on a vector computer
- Asymptotic Mesh Independence of Newton–Galerkin Methods via a Refined Mysovskii Theorem
- Choosing the Forcing Terms in an Inexact Newton Method
- Convergence behaviour of inexact Newton methods
- Globally Convergent Inexact Newton Methods
- scientific article; zbMATH DE number 3848585 (Why is no real title available?)
- scientific article; zbMATH DE number 3911612 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- scientific article; zbMATH DE number 3229565 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- scientific article; zbMATH DE number 3417388 (Why is no real title available?)
- Inexact Newton Methods
- Local Convergence of Inexact Newton Methods
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Numerical analysis. A 1st course in scientific computation. Transl. from the German by F. A. Potra and F. Schulz
- Numerical Optimization
- On Best Conditioned Matrices
- On Newton-Iterative Methods for the Solution of Systems of Nonlinear Equations
- On Steplength Algorithms for a Class of Continuation Methods
- The two-stage arithmetic mean method
- Inexact block Newton methods for solving nonlinear equations
- SSOR and ASSOR preconditioners for block-Broyden method
- A class of iteration methods based on the generalized preconditioned Hermitian and skew-Hermitian splitting for weakly nonlinear systems
- Convergence behaviour of inexact Newton methods under weak Lipschitz condition.
- Inner solvers for interior point methods for large scale nonlinear programming
- On solving a special class of weakly nonlinear finite-difference systems
- Lagged diffusivity fixed point iteration for solving steady-state reaction diffusion problems
- A class of iteration methods based on the HSS for Toeplitz systems of weakly nonlinear equations
- Performance analysis of arithmetic mean method for solving composite 6-point closed Newton-Cotes quadrature algebraic equation
- On CSCS-based iteration methods for Toeplitz system of weakly nonlinear equations
- On LPMHSS-based iteration methods for a class of weakly nonlinear systems
- The arithmetic mean method for solving systems of nonlinear equations in finite differences
This page was built for publication: The Newton-arithmetic mean method for the solution of systems of nonlinear equations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855914)
