In this communication preconditioners for solving the linear systems of the Newton method in each nonlinear iteration are presented. In particular, we define a sequence of preconditioners built by means of Broyden-type rank-one updates. Optimality 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. Sequential and parallel numerical results on two model problems illustrate the effectiveness of the proposed approach in the preconditioning of BiCGstab iterative method.
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
