AbstractIn this paper, we use a complete pivoting strategy for the right-looking version of Robust Incomplete Factorization preconditioner (Benzi and Tůma, 2003) [7]. The new preconditioner has been used as the right preconditioner for several linear systems and its effectiveness has been studied
Incomplete LU-factorizations have been very successful as preconditioners for solving sparse linear ...
AbstractThis paper presents a class of preconditioning techniques which exploit rational function ap...
It is known that pivoting-free Gaussian elimination is numerically unsafe but can run signifi-cantly...
AbstractIn this paper, we use a complete pivoting strategy for the right-looking version of Robust I...
Abstract. In this paper, we use a complete pivoting strategy for the left-looking version of RIF pre...
We describe a novel technique for computing a sparse incomplete factorization of a general symmetric...
. In this chapter, we give a brief overview of a particular class of preconditioners known as incomp...
AbstractA considerable interest has been devoted to block matrix incomplete factorization preconditi...
We present, implement and test several incomplete QR factorization methods based on Givens rotations...
AbstractAn incomplete LU decomposition with pivoting is presented that progressively monitors the gr...
AbstractWe design, analyse and test a class of incomplete orthogonal factorization preconditioners c...
Abstract. In this paper, we use a complete pivoting strategy for the left-looking version of AINV pr...
In this chapter, we give a brief overview of a particular class of preconditioners known as incomple...
In this article, we present several new permutations for I-matrices making these more suitable for i...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
Incomplete LU-factorizations have been very successful as preconditioners for solving sparse linear ...
AbstractThis paper presents a class of preconditioning techniques which exploit rational function ap...
It is known that pivoting-free Gaussian elimination is numerically unsafe but can run signifi-cantly...
AbstractIn this paper, we use a complete pivoting strategy for the right-looking version of Robust I...
Abstract. In this paper, we use a complete pivoting strategy for the left-looking version of RIF pre...
We describe a novel technique for computing a sparse incomplete factorization of a general symmetric...
. In this chapter, we give a brief overview of a particular class of preconditioners known as incomp...
AbstractA considerable interest has been devoted to block matrix incomplete factorization preconditi...
We present, implement and test several incomplete QR factorization methods based on Givens rotations...
AbstractAn incomplete LU decomposition with pivoting is presented that progressively monitors the gr...
AbstractWe design, analyse and test a class of incomplete orthogonal factorization preconditioners c...
Abstract. In this paper, we use a complete pivoting strategy for the left-looking version of AINV pr...
In this chapter, we give a brief overview of a particular class of preconditioners known as incomple...
In this article, we present several new permutations for I-matrices making these more suitable for i...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
Incomplete LU-factorizations have been very successful as preconditioners for solving sparse linear ...
AbstractThis paper presents a class of preconditioning techniques which exploit rational function ap...
It is known that pivoting-free Gaussian elimination is numerically unsafe but can run signifi-cantly...
DOI
Add to ORKG