Eigenvalue and condition number estimates for preconditioned iteration matrices provide the information required to estimate the rate of convergence of iterative methods, such as preconditioned conjugate gradient methods. In recent years various estimates have been derived for (perturbed) modified (block) incomplete factorizations. We survey and extend some of these and derive new estimates. In particular we derive upper and lower estimates of individual eigenvalues and of condition number. This includes a discussion that the condition number of preconditioned second order elliptic difference matrices is O(h-1). Some of the methods are applied to compute certain parameters involved in the computation of the preconditioner
<p>The programs estimate 1-norm or 2-norm condition numbers of preconditioned matrices. As samples, ...
In order to compute the smallest eigenvalue together with an eigenfunction of a self-adjoint ellipti...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...
AbstractEigenvalue and condition number estimates for preconditioned iteration matrices provide the ...
The paper deals with eigenvalue estimates for block incomplete fac- torization methods for symmetric...
The present paper introduces a condition number estimation method for preconditioned ma-trices. The ...
AbstractThis paper deals with the convergence analysis of various preconditioned iterations to compu...
Contains fulltext : 27706.pdf (preprint version ) (Open Access
In this paper, the convergence analysis of the conventional conjugate Gradient method was reviewed. ...
. We extend graph embedding techniques for bounding the spectral condition number of preconditioned...
It is well known that the convergence of the conjugate gradient method for solving symmetric positiv...
We propose a class of preconditioners for symmetric linear systems arising from numerical analysis a...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
The convergence features of a preconditioned algorithm for the convection-diffusion equation based o...
In this paper, some theoretical results on the eigenvalue analysis of the SIMPLER preconditioning fo...
<p>The programs estimate 1-norm or 2-norm condition numbers of preconditioned matrices. As samples, ...
In order to compute the smallest eigenvalue together with an eigenfunction of a self-adjoint ellipti...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...
AbstractEigenvalue and condition number estimates for preconditioned iteration matrices provide the ...
The paper deals with eigenvalue estimates for block incomplete fac- torization methods for symmetric...
The present paper introduces a condition number estimation method for preconditioned ma-trices. The ...
AbstractThis paper deals with the convergence analysis of various preconditioned iterations to compu...
Contains fulltext : 27706.pdf (preprint version ) (Open Access
In this paper, the convergence analysis of the conventional conjugate Gradient method was reviewed. ...
. We extend graph embedding techniques for bounding the spectral condition number of preconditioned...
It is well known that the convergence of the conjugate gradient method for solving symmetric positiv...
We propose a class of preconditioners for symmetric linear systems arising from numerical analysis a...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
The convergence features of a preconditioned algorithm for the convection-diffusion equation based o...
In this paper, some theoretical results on the eigenvalue analysis of the SIMPLER preconditioning fo...
<p>The programs estimate 1-norm or 2-norm condition numbers of preconditioned matrices. As samples, ...
In order to compute the smallest eigenvalue together with an eigenfunction of a self-adjoint ellipti...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...