In this paper we consider the solution of linear systems of saddle point type by preconditioned Krylov subspace methods. A preconditioning strategy based on the symmetric/ skew-symmetric splitting of the coefficient matrix is proposed, and some useful properties of the preconditioned matrix are established. The potential of this approach is illustrated by numerical experiments with matrices from various application areas
In this paper we consider the parameter dependent class of preconditioners M#ℎ(a, delta,D) defined i...
We consider the iterative solution of regularized saddle-point systems. When the leading block is sy...
We consider the iterative solution of regularized saddle-point systems. When the leading block is sy...
Saddle point problems arise frequently in many applications in science and engineering, including co...
In the present paper, we propose a preconditioned global approach as a new strategy to solve linear ...
In the present paper, we propose a preconditioned global approach as a new strategy to solve linear ...
We investigate the cost of preconditioning when solving large sparse saddlepoint linear systems wit...
AbstractBased on matrix splittings, a new alternating preconditioner with two parameters is proposed...
By considering Krylov subspace methods in nonstandard inner products, we develop in this thesis new ...
Abstract. We introduce a new preconditioning technique for the iterative solution of saddle point li...
By considering Krylov subspace methods in nonstandard inner products, we develop in this thesis new ...
In this contribution we attempt to review recent advances in the field of iterative methods for solv...
AbstractWe study constraint preconditioners for solving singular saddle point problems. We analyze p...
In this paper we consider the parameter dependent class of preconditioners M(a,d,D) defined in the c...
We investigate a preconditioning technique applied to the problem of solving linear systems arising ...
In this paper we consider the parameter dependent class of preconditioners M#ℎ(a, delta,D) defined i...
We consider the iterative solution of regularized saddle-point systems. When the leading block is sy...
We consider the iterative solution of regularized saddle-point systems. When the leading block is sy...
Saddle point problems arise frequently in many applications in science and engineering, including co...
In the present paper, we propose a preconditioned global approach as a new strategy to solve linear ...
In the present paper, we propose a preconditioned global approach as a new strategy to solve linear ...
We investigate the cost of preconditioning when solving large sparse saddlepoint linear systems wit...
AbstractBased on matrix splittings, a new alternating preconditioner with two parameters is proposed...
By considering Krylov subspace methods in nonstandard inner products, we develop in this thesis new ...
Abstract. We introduce a new preconditioning technique for the iterative solution of saddle point li...
By considering Krylov subspace methods in nonstandard inner products, we develop in this thesis new ...
In this contribution we attempt to review recent advances in the field of iterative methods for solv...
AbstractWe study constraint preconditioners for solving singular saddle point problems. We analyze p...
In this paper we consider the parameter dependent class of preconditioners M(a,d,D) defined in the c...
We investigate a preconditioning technique applied to the problem of solving linear systems arising ...
In this paper we consider the parameter dependent class of preconditioners M#ℎ(a, delta,D) defined i...
We consider the iterative solution of regularized saddle-point systems. When the leading block is sy...
We consider the iterative solution of regularized saddle-point systems. When the leading block is sy...