GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
SIAM Journal on Scientific and Statistical Computing
An extension of the theory of secant preconditioners
Proceedings of the international meeting on Linear/nonlinear iterative methods and verification of solution
Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
SIAM Journal on Matrix Analysis and Applications
Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations
SIAM Journal on Scientific Computing
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
SIAM Journal on Scientific Computing
A comparative study of sparse approximate inverse preconditioners
IMACS'97 Proceedings on the on Iterative methods and preconditioners
Automatic Preconditioning by Limited Memory Quasi-Newton Updating
SIAM Journal on Optimization
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited
ACM Transactions on Mathematical Software (TOMS)
Preconditioning Indefinite Systems in Interior Point Methods for Optimization
Computational Optimization and Applications
Convergence Analysis of Iterative Solvers in Inexact Rayleigh Quotient Iteration
SIAM Journal on Matrix Analysis and Applications
Advances in Engineering Software
Hi-index | 0.98 |
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.