AbstractIn this paper, we propose a new implementation of the Newton scheme of an approximate preconditioner for the reduced linear system. In the original Newton scheme, the trouble is that the computation cost of the matrix–matrix product is always so expensive. On the other hand, the proposed implementation computes the preconditioner implicitly and reduces the cost of constructing the preconditioner by using the matrix–vector product form. We also show that the proposed implementation is less expensive than computing the preconditioner in explicit form
Abstract. Motivated by the paper [16], where the authors proposed a method to solve a symmet-ric pos...
Abstract. We investigate the use of sparse approximate-inverse preconditioners for the iterative sol...
Abstract. Issues of indefinite preconditioning of reduced Newton systems arising in optimization wit...
The Newton scheme is used to construct an approximate inverse preconditioner for the Schur complemen...
The class of preconditioning that approximates the inverse of the matrix A is studied in the thesis....
. This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A...
This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A p...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
A new strategy for updating preconditioners by polynomial interpolation of factors of approximate in...
Issues of indefinite preconditioning of reduced Newton systems arising in optimization with interior...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
AbstractThis paper presents a class of preconditioning techniques which exploit rational function ap...
The recursive construction of Schur-complements is used to construct a multi-level preconditioner fo...
The Sherman--Morrison formula is one scheme for computing the approximate inverse preconditioner of ...
onditioners, or incomplete LU-decompositions of A [2]. But these preconditioners either lead to unsa...
Abstract. Motivated by the paper [16], where the authors proposed a method to solve a symmet-ric pos...
Abstract. We investigate the use of sparse approximate-inverse preconditioners for the iterative sol...
Abstract. Issues of indefinite preconditioning of reduced Newton systems arising in optimization wit...
The Newton scheme is used to construct an approximate inverse preconditioner for the Schur complemen...
The class of preconditioning that approximates the inverse of the matrix A is studied in the thesis....
. This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A...
This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A p...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
A new strategy for updating preconditioners by polynomial interpolation of factors of approximate in...
Issues of indefinite preconditioning of reduced Newton systems arising in optimization with interior...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
AbstractThis paper presents a class of preconditioning techniques which exploit rational function ap...
The recursive construction of Schur-complements is used to construct a multi-level preconditioner fo...
The Sherman--Morrison formula is one scheme for computing the approximate inverse preconditioner of ...
onditioners, or incomplete LU-decompositions of A [2]. But these preconditioners either lead to unsa...
Abstract. Motivated by the paper [16], where the authors proposed a method to solve a symmet-ric pos...
Abstract. We investigate the use of sparse approximate-inverse preconditioners for the iterative sol...
Abstract. Issues of indefinite preconditioning of reduced Newton systems arising in optimization wit...