Open access
Date
1994-06Type
- Report
ETH Bibliography
yes
Altmetrics
Abstract
Iterative methods for solving linear systems of equations can be very efficient in a sequential or parallel computing environment if the structure of the coefficient matrix can be exploited to accelerate the convergence of the iterative process. However, for classes of problems for which suitable preconditioners cannot be found or for which the iteration scheme does not converge, iterative techniques are inappropriate. This paper proposes a technique for deflating the eigenvalues, and associated eigenvectors, of the iteration matrix which either slow down convergence or cause divergence. This process is completely general and works by approximating the eigenspace $P$ corresponding to the unstable or slowly converging modes and then applying a coupled iteration scheme on $P$ and its orthogonal complement $Q.$ Show more
Permanent link
https://doi.org/10.3929/ethz-a-004284048Publication status
publishedExternal links
Journal / series
SAM Research ReportVolume
Publisher
Seminar for Applied Mathematics, ETH ZurichOrganisational unit
02501 - Seminar für Angewandte Mathematik / Seminar for Applied Mathematics
More
Show all metadata
ETH Bibliography
yes
Altmetrics