|
Organizers |
Inexact Newton methods and mixed non linear complementary problems
by
Luca Bergamaschi
University of Padua
Coauthors: Giovanni Zilli (University of Padua)
In this communication we present the results obtained in the solution of sparse and large systems of nonlinear equations by Inexact Newton-like methods [] combined with a block iterative row-projection linear solver [], []. A simple p-block partitioning of the Jacobian matrix A was used for solving in parallel a set of nonlinear test problems with sizes ranging from 1024 to 131072 on the CRAY T3E under the MPI environment. The matrix H = [ A1+, ... , Ai+, ... , Ap+], where Ai+ = AiT(Ai AiT)-1 is the Moore-Penrose pseudo inverse of the mi ×n block Ai, was employed as a preconditioner. We also adopt a suitable block row partitionings of the matrix A in such a way that Ai AiT = I, i=1, ... p, and consequently, Ai+ = AiT. This allows to simplify the solution of the least squares subproblems at each step of the inner iteration.
Our methods may be used to solve more general problems as the non linear mixed complementary problems [] (including linear and non linear programming problems, variational inequalities etc.). In fact, the interior point solution [] of a mixed complementary problem, due to the presence of a logarithmic penalty, can be viewed as a variant of an Inexact Newton method applied to a particular system of non linear equations.
We have applied this inexact interior point algorithm for the solution of some non linear complementary probles as the obstacle Bratu problem and the Lubrication problem []. We provide numerical results in both sequential and parallel implementations.
Date received: January 25, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caeb-12.