Application of the variable metric methods for solving the sparse linear algebraic systems

The problem of solving sparse positive definite systems of linear algebraic equations with slowly varying coefficients is considered. The inverse iteration algorithm based on the Symmetric Rank-one formula of system matrix updating is used. Both conditions of local and global convergence of algorithm are reduced. Basic properties of algorithm are considered. Comparative efficiency of the method is shown by test examples.