Inexact overlapped block Broyden methods for solving nonlinear equations (Q1856027): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: KELLEY / rank | |||
Normal rank |
Revision as of 04:14, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Inexact overlapped block Broyden methods for solving nonlinear equations |
scientific article |
Statements
Inexact overlapped block Broyden methods for solving nonlinear equations (English)
0 references
28 January 2003
0 references
The paper is concerned with the problem of solving a large system of nonlinear equations. Many methods are suitable for this: Newton methods, inexact Newton methods, nonlinear block-iterative methods, inexact Newton-Krylov methods, etc. The authors discuss the inexact Broyden method with partially overlap which is a generalization of the parallelizable Jacobi-type block Broyden method. By directly performing the block Broyden iteration for the overlapped blocks and by assembling the overlapping parts of the results into an average weighted manner at each iteration, the block Broyden method is accelerated. A new algorithm which is a generalization of the block Broyden method with partially overlapped blocks is presented and the local convergence of this algorithm is proved. The implementation of the algorithm by several strategies for partitioning the Jacobian into weakly coupled partially ovelapped blocks is discussed and one numerical example (a system of \(N\) nonlinear equations) is performed by ten variants of the iterations.
0 references
nonlinear equations
0 references
block-iterative solution
0 references
Broyden methods
0 references
graph partitioning
0 references
parallel computation
0 references
large system
0 references
algorithm
0 references
convergence
0 references
numerical examples
0 references