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
Preconditioning methods via approximate block factorization for block tridiagonal matrices are studi...
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
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...
AbstractThe explicit structure of the inverse of block tridiagonal matrices is presented in terms of...
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal lin...
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 ...
AbstractIn this paper, we consider a new form of the arithmetic mean method for solving large block ...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
Summary We provide a new representation for the inverse of block tridiagonal and banded matrices. Th...
AbstractNon-symmetric and symmetric twisted block factorizations of block tridiagonal matrices are d...
Based on URV-decomposition in Stewart [An updating algorithm for subspace tracking, IEEE Trans. Sign...
Preconditioning methods via approximate block factorization for block tridiagonal matrices are studi...
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
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...
AbstractThe explicit structure of the inverse of block tridiagonal matrices is presented in terms of...
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal lin...
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 ...
AbstractIn this paper, we consider a new form of the arithmetic mean method for solving large block ...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
Summary We provide a new representation for the inverse of block tridiagonal and banded matrices. Th...
AbstractNon-symmetric and symmetric twisted block factorizations of block tridiagonal matrices are d...
Based on URV-decomposition in Stewart [An updating algorithm for subspace tracking, IEEE Trans. Sign...
Preconditioning methods via approximate block factorization for block tridiagonal matrices are studi...
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
AbstractWe propose new parallelizable block ILU (incomplete LU) factorization preconditioners for a ...