An Accelerated Block-Parallel Newton Method via Overlapped Partitioning
This paper presents an overlapped block-parallel Newton method for solving large nonlinear systems. The graph partitioning algorithms are first used to partition the Jacobian into weakly coupled overlapping blocks. Then the simplified Newton iteration is directly performed, with the diagonal blocks and the overlapping solutions assembled in a weighted average way at each iteration. In the algorithmic implementation, an accelerated technique has been proposed to reduce the number of iterations. The conditions under which the algorithm is locally and semi-locally convergent are studied. Numerical results from solving power flow equations are presented to support our study.
KeywordsNewton Method Krylov Subspace Sandia National Laboratory Inexact Newton Method Good Initial Guess
Unable to display preview. Download preview PDF.
- B. Hendrickson and R. Leland. The Chaco user's guide, version 2.0. Technical report, Sandia National Laboratories, Albuquerque, NM, July 1995. Tech. Rep. SAND 95-2344.Google Scholar
- D. A. Knoll and D. E. Keyes. Jacobian-free Newton-Krylov methods: A survey of approaches and applications. Int. J. High Performance Computing Applications, 2003. to appear.Google Scholar
- J. M. Ortega and W. C. Rheinboldt. Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, 1970.Google Scholar