Abstract
This paper is devoted to a class of iterative methods for solving nonsymmetric or indefinite problems that are dominated by some SPD (symmetric positive definite) problems. The algorithm is based on a direct solver for the original equation restricted on a small subspace and a given iterative method for the SPD equation. It is shown that any convergent iterative method for the SPD problem will give rise to an algorithm that converges with a comparable rate if the small subspace is properly chosen. Furthermore a number of preconditioners that can be used with GMRES type methods are also obtained.
| Original language | English (US) |
|---|---|
| Title of host publication | Domain Decomposition Methods for Partial Differential Equations |
| Publisher | Publ by Soc for Industrial & Applied Mathematics PublPhiladelphia, PA, United States |
| Pages | 106-118 |
| Number of pages | 13 |
| ISBN (Print) | 0898712882 |
| State | Published - Dec 1 1992 |
| Externally published | Yes |