In this note preconditioners for the Conjugate Gradient method are studied to solve the Newton system with a symmetric positive definite Jacobian. In particular, we define a sequence of preconditioners built by means of BFGS rank-two updates. Reasonable conditions are derived which guarantee that the preconditioned matrices are not far from the identity in a matrix norm. Some notes on the implementation of the corresponding inexact Newton method are given and some numerical results on a number of model problems illustrate the efficiency of the proposed preconditioners.
Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian / Bergamaschi, L.; Rafael, Bru; Martinez, A.. - In: MATHEMATICAL AND COMPUTER MODELLING. - ISSN 0895-7177. - ELETTRONICO. - 54:(2011), pp. 1863-1873. [10.1016/j.mcm.2010.11.064]
Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian
A. MARTINEZ
2011-01-01
Abstract
In this note preconditioners for the Conjugate Gradient method are studied to solve the Newton system with a symmetric positive definite Jacobian. In particular, we define a sequence of preconditioners built by means of BFGS rank-two updates. Reasonable conditions are derived which guarantee that the preconditioned matrices are not far from the identity in a matrix norm. Some notes on the implementation of the corresponding inexact Newton method are given and some numerical results on a number of model problems illustrate the efficiency of the proposed preconditioners.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


