In this report we give new insights into the properties of invertible and singular deflated and preconditioned linear systems where the coefficient matrices are also symmetric and positive (semi-) definite. First we prove that the invertible de ated matrix has always a more favorable effeective condition number compared to the original matrix. So, in theory, the solution of the deflated linear system converges faster in iterative methods than the original one. Thereafter, some results are presented considering the singular systems originally from the Poisson equation with Neumann boundary conditions. In practice these linear systems are forced to be invertible leading to a worse (eective) condition number. We show that applying the deflatio...
We consider the problem of solving a symmetric, positive def-inite system of linear equations. The m...
The stability of positive linear continuous-time and discrete-time systems is analyzed by the use of...
Conjugate gradient method is one of the basic iterative methods for solving systems of linear algebr...
In this report we give new insights into the properties of invertible and singular deflated and prec...
In this report we give new insights into the properties of invertible and singular deflated and prec...
AbstractFor various applications, it is well-known that the deflated ICCG is an efficient method for...
textabstractIn this article we introduce new bounds for the condition numbers of deflated symmetric ...
In this paper, first, by using the diagonally compensated reduction and incomplete Cholesky factoriz...
This work studies limited memory preconditioners for linear symmetric positive definite systems of e...
International audienceA new domain decomposition preconditioner is introduced for efficiently solvin...
This paper discusses some conditions for positive and non-negative definiteness in terms of pseudoin...
AbstractIn this paper the preconditioned conjugate gradient method is used to solve the system of li...
We describe a novel technique for computing a sparse incomplete factorization of a general symmetric...
In this paper we compare various preconditioners for the numerical solution of partial differential ...
Abstract: In the paper we consider the iterative solution of linear systemby the conjugate...
We consider the problem of solving a symmetric, positive def-inite system of linear equations. The m...
The stability of positive linear continuous-time and discrete-time systems is analyzed by the use of...
Conjugate gradient method is one of the basic iterative methods for solving systems of linear algebr...
In this report we give new insights into the properties of invertible and singular deflated and prec...
In this report we give new insights into the properties of invertible and singular deflated and prec...
AbstractFor various applications, it is well-known that the deflated ICCG is an efficient method for...
textabstractIn this article we introduce new bounds for the condition numbers of deflated symmetric ...
In this paper, first, by using the diagonally compensated reduction and incomplete Cholesky factoriz...
This work studies limited memory preconditioners for linear symmetric positive definite systems of e...
International audienceA new domain decomposition preconditioner is introduced for efficiently solvin...
This paper discusses some conditions for positive and non-negative definiteness in terms of pseudoin...
AbstractIn this paper the preconditioned conjugate gradient method is used to solve the system of li...
We describe a novel technique for computing a sparse incomplete factorization of a general symmetric...
In this paper we compare various preconditioners for the numerical solution of partial differential ...
Abstract: In the paper we consider the iterative solution of linear systemby the conjugate...
We consider the problem of solving a symmetric, positive def-inite system of linear equations. The m...
The stability of positive linear continuous-time and discrete-time systems is analyzed by the use of...
Conjugate gradient method is one of the basic iterative methods for solving systems of linear algebr...