Inexact Quasi-Newton methods for sparse systems of nonlinear equations

Citation
L. Bergamaschi et al., Inexact Quasi-Newton methods for sparse systems of nonlinear equations, FUT GENER C, 18(1), 2001, pp. 41-53
Citations number
15
Categorie Soggetti
Computer Science & Engineering
Journal title
FUTURE GENERATION COMPUTER SYSTEMS
ISSN journal
0167739X → ACNP
Volume
18
Issue
1
Year of publication
2001
Pages
41 - 53
Database
ISI
SICI code
0167-739X(200109)18:1<41:IQMFSS>2.0.ZU;2-P
Abstract
In this paper, we present the results obtained by solving consistent sparse systems of n nonlinear equations F(x) = 0, by a Quasi-Newton method combin ed with a p block iterative row-projection linear solver of Cimmino type, 1 less than or equal to p << n. Under weak regularity conditions for F, it i s proved that this Inexact Quasi-Newton method has a local, linear converge nce in the energy norm induced by the preconditioned matrix HA, where A is an initial guess of the Jacobian matrix, and it may converge too superlinea rly. The matrix H = [A(1)(+),...,A(i)(+),...,A(p)(+)], where A(i)(+) = A(i) (T)(A(i)A(i)(T))(-1) is the Moore-Penrose pseudo-inverse of the mi x n bloc k A(i), the preconditioner. A simple partitioning of the Jacobian matrix wa s used for solving a set of nonlinear test problems with sizes ranging from 1024 to 131 072 on the CRAY T3E under the MPI environment. (C) 2001 Elsevi er Science B.V. All rights reserved.