AbstractWe improve the conditioning analysis of modified block incomplete factorizations of Stieltjes matrices. Letting N denote the number of diagonal blocks, our results show that the spectral condition number is bounded by N for a large class of two dimensional PDEs
AbstractWe propose new block incomplete factorization preconditioners for a symmetric block-tridiago...
AbstractTwo types of (modified) incomplete block factorization methods are considered, and the exist...
AbstractThe paper provides a description of optimally conditioned Hermitian positive-definite block ...
AbstractThe paper is devoted to the conditioning analysis of modified block incomplete factorization...
AbstractWe improve the conditioning analysis of modified block incomplete factorizations of Stieltje...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
The paper deals with eigenvalue estimates for block incomplete fac- torization methods for symmetric...
The conditioning analysis of sparse approximate block factorizations of Stieltjes matrices developed...
AbstractThe conditioning analysis of positive definite matrices by approximate LU factorizations is ...
. We extend graph embedding techniques for bounding the spectral condition number of preconditioned...
Recently, modified block incomplete factorizations with dynamic diagonal perturbations have been int...
We extend graph embedding techniques for bounding the spectral condition number of preconditioned sy...
AbstractA general method for incomplete factorization of M-matrices in block-matrix form is presente...
We transform and partition the symmetric indefinite (saddle point) matrices into a block structure w...
AbstractA considerable interest has been devoted to block matrix incomplete factorization preconditi...
AbstractWe propose new block incomplete factorization preconditioners for a symmetric block-tridiago...
AbstractTwo types of (modified) incomplete block factorization methods are considered, and the exist...
AbstractThe paper provides a description of optimally conditioned Hermitian positive-definite block ...
AbstractThe paper is devoted to the conditioning analysis of modified block incomplete factorization...
AbstractWe improve the conditioning analysis of modified block incomplete factorizations of Stieltje...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
The paper deals with eigenvalue estimates for block incomplete fac- torization methods for symmetric...
The conditioning analysis of sparse approximate block factorizations of Stieltjes matrices developed...
AbstractThe conditioning analysis of positive definite matrices by approximate LU factorizations is ...
. We extend graph embedding techniques for bounding the spectral condition number of preconditioned...
Recently, modified block incomplete factorizations with dynamic diagonal perturbations have been int...
We extend graph embedding techniques for bounding the spectral condition number of preconditioned sy...
AbstractA general method for incomplete factorization of M-matrices in block-matrix form is presente...
We transform and partition the symmetric indefinite (saddle point) matrices into a block structure w...
AbstractA considerable interest has been devoted to block matrix incomplete factorization preconditi...
AbstractWe propose new block incomplete factorization preconditioners for a symmetric block-tridiago...
AbstractTwo types of (modified) incomplete block factorization methods are considered, and the exist...
AbstractThe paper provides a description of optimally conditioned Hermitian positive-definite block ...
DOI
Add to ORKG