The theory and the practice of optimal preconditioning in solving a linear system by iterative processes is founded on some theoretical facts understandable in terms of a class V of spaces of matrices including diagonal algebras and group matrix algebras. The V-structure lets us extend some known crucial results of preconditioning theory and obtain some useful information on the computability and on the efficiency of new preconditioners. Three preconditioners not yet considered in literature, belonging to three corresponding algebras of V, are analyzed in detail. Some experimental results are included
The problem of finding good preconditioners for the numerical solution of indefinite linear systems ...
In earlier papers Tyrtyshnikov [42] and the first author [14] considered the analysis of clustering ...
(eng) The main idea of the ``black box'' approach in exact linear algebra is to reduce matrix proble...
AbstractThe theory and the practice of optimal preconditioning in solving a linear system by iterati...
AbstractThe theory and the practice of optimal preconditioning in solving a linear system by iterati...
When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the co...
When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the co...
When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the co...
When a linear system Ax = y is solved by means of iterative meth-ods (mainly CG and GMRES) and the c...
A comprehensive introduction to preconditioning techniques, now an essential part of successful and ...
This thesis deals with the construction of preconditioners for systems of linear equations as they o...
This thesis deals with the construction of preconditioners for systems of linear equations as they o...
AbstractMany researchers have considered preconditioners, applied to linear systems, whose matrix co...
The problem of finding good preconditioners for the numerical solution of indefinite linear systems ...
The problem of finding good preconditioners for the numerical solution of indefinite linear systems ...
The problem of finding good preconditioners for the numerical solution of indefinite linear systems ...
In earlier papers Tyrtyshnikov [42] and the first author [14] considered the analysis of clustering ...
(eng) The main idea of the ``black box'' approach in exact linear algebra is to reduce matrix proble...
AbstractThe theory and the practice of optimal preconditioning in solving a linear system by iterati...
AbstractThe theory and the practice of optimal preconditioning in solving a linear system by iterati...
When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the co...
When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the co...
When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the co...
When a linear system Ax = y is solved by means of iterative meth-ods (mainly CG and GMRES) and the c...
A comprehensive introduction to preconditioning techniques, now an essential part of successful and ...
This thesis deals with the construction of preconditioners for systems of linear equations as they o...
This thesis deals with the construction of preconditioners for systems of linear equations as they o...
AbstractMany researchers have considered preconditioners, applied to linear systems, whose matrix co...
The problem of finding good preconditioners for the numerical solution of indefinite linear systems ...
The problem of finding good preconditioners for the numerical solution of indefinite linear systems ...
The problem of finding good preconditioners for the numerical solution of indefinite linear systems ...
In earlier papers Tyrtyshnikov [42] and the first author [14] considered the analysis of clustering ...
(eng) The main idea of the ``black box'' approach in exact linear algebra is to reduce matrix proble...