Software Open Access
Michael L. Parks; Kirk M. Soodhalter; Daniel B. Szyld
We propose a block Krylov subspace version of the GCRO-DR method proposed in [Parks et al. SISC 2005], which is an iterative method allowing for the efficient minimization of the the residual over an augmented block Krylov subspace. We offer a clean derivation of the method and discuss methods of selecting recycling subspaces at restart as well as implementation decisions in the context of high-performance computing.
Name | Size | |
---|---|---|
block_gcrodr.m
md5:c9ff622cbf8afeabf8211507b25b6bbf |
37.1 kB | Download |
block_gcrodr_examples.m
md5:2e9cf64cf428eb197cc6f516549742e4 |
7.3 kB | Download |
sherman5.mat
md5:5168678721415a3f58a6c5a42780659f |
159.9 kB | Download |