A parallel implementation of the block preconditioned GCR method
The parallel implementation of GCR is addressed, with particular focus on communication costs associated with orthogonalization processes. This consideration brings up questions concerning the use of Householder reflections with GCR. To precondition the GCR method a block Gauss-Jacobi method is used. Approximate solvers are used to obtain a solution of the diagonal blocks. Experiments on a cluster of HP workstations and on a Cray T3E are given.
Keywordsapproximate subdomain solution parallel Krylov subspace methods orthogonalization methods
Unable to display preview. Download preview PDF.
- 5.Erik Brakkee. Domain Decomposition for the Incompressible Navier-Stokes Equations. PhD thesis, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands, April 1996.Google Scholar
- 9.J. Frank and C. Vuik. Parallel implementation of a multiblock method with approximate subdomain solution. App. Num. Math., 1998. to appear.Google Scholar