The conditioning analysis of sparse approximate block factorizations of Stieltjes matrices developed by Beauwens and Ben Bouzid in [10] is generalized here on the basis of recent improvements of the point factorization analysis. In particular, the scope of the O(h-1) bound previously obtained for a specific class of applications to discrete multidimensional elliptic partial differential equations is substantially extended. © 1991.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
The paper deals with eigenvalue estimates for block incomplete fac- torization methods for symmetric...
AbstractFor a unique factorization of a matrix B, the effect of sparsity or other structure on measu...
We consider the problem of choosing low-rank factorizations in data sparse matrix approximations for...
AbstractThe paper is devoted to the conditioning analysis of modified block incomplete factorization...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
AbstractWe improve the conditioning analysis of modified block incomplete factorizations of Stieltje...
AbstractThe conditioning analysis of positive definite matrices by approximate LU factorizations is ...
AbstractEfficient numerical solution of large elliptic systems is often facilitated with an approxim...
The factorization method presented in this paper takes advantage of the special structures and prope...
AbstractA new approximate sparse factorization (CSF) of discretized elliptic systems has been used t...
In this chapter, we give a brief overview of a particular class of preconditioners known as incomple...
. In this chapter, we give a brief overview of a particular class of preconditioners known as incomp...
The analysis of preconditioners based on incomplete Cholesky factorization in which the neglected (d...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
Submitted for publication to SIAMMatrices coming from elliptic Partial Differential Equations (PDEs)...
The paper deals with eigenvalue estimates for block incomplete fac- torization methods for symmetric...
AbstractFor a unique factorization of a matrix B, the effect of sparsity or other structure on measu...
We consider the problem of choosing low-rank factorizations in data sparse matrix approximations for...
AbstractThe paper is devoted to the conditioning analysis of modified block incomplete factorization...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
AbstractWe improve the conditioning analysis of modified block incomplete factorizations of Stieltje...
AbstractThe conditioning analysis of positive definite matrices by approximate LU factorizations is ...
AbstractEfficient numerical solution of large elliptic systems is often facilitated with an approxim...
The factorization method presented in this paper takes advantage of the special structures and prope...
AbstractA new approximate sparse factorization (CSF) of discretized elliptic systems has been used t...
In this chapter, we give a brief overview of a particular class of preconditioners known as incomple...
. In this chapter, we give a brief overview of a particular class of preconditioners known as incomp...
The analysis of preconditioners based on incomplete Cholesky factorization in which the neglected (d...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
Submitted for publication to SIAMMatrices coming from elliptic Partial Differential Equations (PDEs)...
The paper deals with eigenvalue estimates for block incomplete fac- torization methods for symmetric...
AbstractFor a unique factorization of a matrix B, the effect of sparsity or other structure on measu...
We consider the problem of choosing low-rank factorizations in data sparse matrix approximations for...
DOI
Add to ORKG