Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
(Revised) RALTR2002021 A Chebyshevbased twostage iterative method as an
 

Summary: (Revised) RAL­TR­2002­021
A Chebyshev­based two­stage iterative method as an
alternative to the direct solution of linear systems
Mario Arioli 1 and Daniel Ruiz 2
ABSTRACT
We consider the solution of ill­conditioned symmetric and positive definite large sparse
linear systems of equations. These arise, for instance, when using some symmetrising pre­
conditioning technique for solving a general (possibly unsymmetric) ill­conditioned linear
system, or in domain decomposition of a numerically di#cult elliptic problem. We are
also concerned with the consecutive solution of several linear systems with the same ma­
trix and di#erent right­hand sides. In such cases, the consecutive runs of some iterative
methods like the conjugate gradient or the block conjugate gradient algorithms might be
computationally prohibitive, and it might be preferable to use direct methods which are
very well suited for this type of situation.
The purpose of our study is to analyse a two­phase approach: analogously to direct meth­
ods, it includes a preliminary phase which we call a ``partial spectral factorization phase'',
followed by a ``cheap'' solution phase, both only based on numerical tools that are usu­
ally exploited in iterative methods. Therefore, we need not store the given ill­conditioned
matrix explicitly but we need only use it to compute matrix­vector products. This is
of particular interest in the case of very large sparse systems and permits an e#cient

  

Source: Arioli, Mario - Rutherford Appleton Laboratory

 

Collections: Mathematics