AbstractAn approach to preconditioning linear systems is presented, which is well suitable for parallel implementation. Such approach leads to efficient parallel linear systems solvers, as well as to new schemes for matrix inversion, in some special cases
This paper describes and tests a parallel implementation of a factorized approximate inverse precond...
We survey general techniques and open problems in numerical linear algebra on parallel architectures...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
We review some of the most important results in the area of fast parallel algorithms for the solutio...
AbstractAn approach to preconditioning linear systems is presented, which is well suitable for paral...
The Sherman--Morrison formula is one scheme for computing the approximate inverse preconditioner of ...
In this review paper, we consider some important developments and trends in algorithm design for t...
We present three polynomial preconditioning techniques and analyze some of their theoretical and com...
We review current methods for preconditioning systems of equations for their solution using iterativ...
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal lin...
We introduce a novel strategy for parallel preconditioning of large-scale linear systems by means of...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
The class of preconditioning that approximates the inverse of the matrix A is studied in the thesis....
AbstractWe review some of the most important resulsts in the area of fast parallel algorithms for th...
This book is primarily intended as a research monograph that could also be used in graduate courses ...
This paper describes and tests a parallel implementation of a factorized approximate inverse precond...
We survey general techniques and open problems in numerical linear algebra on parallel architectures...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
We review some of the most important results in the area of fast parallel algorithms for the solutio...
AbstractAn approach to preconditioning linear systems is presented, which is well suitable for paral...
The Sherman--Morrison formula is one scheme for computing the approximate inverse preconditioner of ...
In this review paper, we consider some important developments and trends in algorithm design for t...
We present three polynomial preconditioning techniques and analyze some of their theoretical and com...
We review current methods for preconditioning systems of equations for their solution using iterativ...
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal lin...
We introduce a novel strategy for parallel preconditioning of large-scale linear systems by means of...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
The class of preconditioning that approximates the inverse of the matrix A is studied in the thesis....
AbstractWe review some of the most important resulsts in the area of fast parallel algorithms for th...
This book is primarily intended as a research monograph that could also be used in graduate courses ...
This paper describes and tests a parallel implementation of a factorized approximate inverse precond...
We survey general techniques and open problems in numerical linear algebra on parallel architectures...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
DOI
Add to ORKG