We present unique and existing micro-block and induced macro-block Crout-based factorizations for matrices from regularized saddle-point problems with semi-positive de¿nite regularization block. For the classical case of saddle-point problems we show that the induced macro-block factorizations mostly reduces to the factorization presented in [24]. The presented factorization can be used as a direct solution algorithm for regularized saddle-point problems as well as it can be used a basis for the construction of preconditioners
Mixed finite element formulations give rise to large, sparse, block linear systems of equations, the...
The null-space method is a technique that has been used for many years to reduce a saddle point syst...
We investigate the cost of preconditioning when solving large sparse saddlepoint linear systems wit...
We present unique and existing micro-block and induced macro-block Crout-based factorizations for ma...
The factorization method presented in this paper takes advantage of the special structures and prope...
We consider conjugate-gradient like methods for solving block symmetric indefinite linear systems th...
We consider conjugate-gradient like methods for solving block symmetric indefinite linear systems th...
This paper presents a drop-threshold incomplete LD\u3csup\u3e-1\u3c/sup\u3eL\u3csup\u3eT\u3c/sup\u3e...
Abstract. We consider conjugate-gradient like methods for solving block symmetric indefinite linear ...
Abstract. The null-space method is a technique that has been used for many years to reduce a saddle ...
Mastronardi and Van Dooren [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 173--196] recently introduced...
AbstractRegularization techniques, i.e., modifications on the diagonal elements of the scaling matri...
We consider symmetric saddle point matrices. We analyze block preconditioners based on the knowledge...
Recently Dollar and Wathen [14] proposed a class of incomplete factorizations for saddle-point probl...
Mixed finite element formulations give rise to large, sparse, block linear systems of equations, the...
The null-space method is a technique that has been used for many years to reduce a saddle point syst...
We investigate the cost of preconditioning when solving large sparse saddlepoint linear systems wit...
We present unique and existing micro-block and induced macro-block Crout-based factorizations for ma...
The factorization method presented in this paper takes advantage of the special structures and prope...
We consider conjugate-gradient like methods for solving block symmetric indefinite linear systems th...
We consider conjugate-gradient like methods for solving block symmetric indefinite linear systems th...
This paper presents a drop-threshold incomplete LD\u3csup\u3e-1\u3c/sup\u3eL\u3csup\u3eT\u3c/sup\u3e...
Abstract. We consider conjugate-gradient like methods for solving block symmetric indefinite linear ...
Abstract. The null-space method is a technique that has been used for many years to reduce a saddle ...
Mastronardi and Van Dooren [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 173--196] recently introduced...
AbstractRegularization techniques, i.e., modifications on the diagonal elements of the scaling matri...
We consider symmetric saddle point matrices. We analyze block preconditioners based on the knowledge...
Recently Dollar and Wathen [14] proposed a class of incomplete factorizations for saddle-point probl...
Mixed finite element formulations give rise to large, sparse, block linear systems of equations, the...
The null-space method is a technique that has been used for many years to reduce a saddle point syst...
We investigate the cost of preconditioning when solving large sparse saddlepoint linear systems wit...