AbstractWe consider the general sparse block factorization iterative methods as Beauwens and Ben Bouzid did. We develop some existence and convergence theorems for general nonsingular H-matrices
AbstractWe study the convergence of nested stationary iterative methods according to Lanzkron, Rose,...
AbstractTwo types of (modified) incomplete block factorization methods are considered, and the exist...
AbstractAhac and Olesky have shown that by using the most diagonal-dominat column as a pivot element...
AbstractThe use of incomplete blockwise factorizations as preconditioners in conjugate gradient like...
AbstractVarious forms of preconditioning matrices for iterative acceleration methods are discussed. ...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
AbstractWe develop in this paper a multilevel block ILU preconditioner for solving sparse nonsymmetr...
[EN] In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear sys...
AbstractRecently, special attention has been given, in the mathematical literature, to the problems ...
AbstractIn this paper, we consider a preconditioned iterative method for solving the linear system A...
AbstractLinear systems with M-matrices often appear in a wide variety of areas. In this paper, we gi...
AbstractA general method for incomplete factorization of M-matrices in block-matrix form is presente...
AbstractThe paper is devoted to the conditioning analysis of modified block incomplete factorization...
AbstractA new sparse approximate triangular factorization technique for solving large sparse linear ...
AbstractLet A be a nonsingular M-matrix, and let π be a block partitioning of A such that the diagon...
AbstractWe study the convergence of nested stationary iterative methods according to Lanzkron, Rose,...
AbstractTwo types of (modified) incomplete block factorization methods are considered, and the exist...
AbstractAhac and Olesky have shown that by using the most diagonal-dominat column as a pivot element...
AbstractThe use of incomplete blockwise factorizations as preconditioners in conjugate gradient like...
AbstractVarious forms of preconditioning matrices for iterative acceleration methods are discussed. ...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
AbstractWe develop in this paper a multilevel block ILU preconditioner for solving sparse nonsymmetr...
[EN] In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear sys...
AbstractRecently, special attention has been given, in the mathematical literature, to the problems ...
AbstractIn this paper, we consider a preconditioned iterative method for solving the linear system A...
AbstractLinear systems with M-matrices often appear in a wide variety of areas. In this paper, we gi...
AbstractA general method for incomplete factorization of M-matrices in block-matrix form is presente...
AbstractThe paper is devoted to the conditioning analysis of modified block incomplete factorization...
AbstractA new sparse approximate triangular factorization technique for solving large sparse linear ...
AbstractLet A be a nonsingular M-matrix, and let π be a block partitioning of A such that the diagon...
AbstractWe study the convergence of nested stationary iterative methods according to Lanzkron, Rose,...
AbstractTwo types of (modified) incomplete block factorization methods are considered, and the exist...
AbstractAhac and Olesky have shown that by using the most diagonal-dominat column as a pivot element...
DOI
Add to ORKG