AbstractWe present the recurrence formulas for computing the approximate inverse factors of tridiagonal and pentadiagonal matrices using bordering technique. Resulting algorithms are used to approximate the inverse of pivot blocks needed for constructing block ILU preconditioners for solving the block tridiagonal linear systems, arising from discretization of partial differential equations. Resulting preconditioners are suitable for parallel implementation. Comparison with other methods are also included
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
ABSTRACTThis paper presents a new approach to precondition linear systems of the saddle point kind. ...
AbstractWe propose new parallelizable block ILU (incomplete LU) factorization preconditioners for a ...
AbstractWe present the recurrence formulas for computing the approximate inverse factors of tridiago...
AbstractWe propose new block incomplete factorization preconditioners for a symmetric block-tridiago...
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal lin...
AbstractThe explicit structure of the inverse of block tridiagonal matrices is presented in terms of...
Preconditioning methods via approximate block factorization for block tridiagonal matrices are studi...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
This thesis contributes to the field of sparse linear algebra, graph applications, and preconditione...
AbstractIn this paper, we consider a new form of the arithmetic mean method for solving large block ...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
This paper is concerned with the solution of block tridiagonal linear systems by the preconditioned ...
We provide a new representation for the inverse of block tridiagonal and banded matrices. The new r...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
ABSTRACTThis paper presents a new approach to precondition linear systems of the saddle point kind. ...
AbstractWe propose new parallelizable block ILU (incomplete LU) factorization preconditioners for a ...
AbstractWe present the recurrence formulas for computing the approximate inverse factors of tridiago...
AbstractWe propose new block incomplete factorization preconditioners for a symmetric block-tridiago...
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal lin...
AbstractThe explicit structure of the inverse of block tridiagonal matrices is presented in terms of...
Preconditioning methods via approximate block factorization for block tridiagonal matrices are studi...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
This thesis contributes to the field of sparse linear algebra, graph applications, and preconditione...
AbstractIn this paper, we consider a new form of the arithmetic mean method for solving large block ...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
This paper is concerned with the solution of block tridiagonal linear systems by the preconditioned ...
We provide a new representation for the inverse of block tridiagonal and banded matrices. The new r...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
ABSTRACTThis paper presents a new approach to precondition linear systems of the saddle point kind. ...
AbstractWe propose new parallelizable block ILU (incomplete LU) factorization preconditioners for a ...