<span class="var-sub_title">MGRIT Preconditioned Krylov Subspace Method</span> SC18 Proceedings

The International Conference for High Performance Computing, Networking, Storage, and Analysis

MGRIT Preconditioned Krylov Subspace Method

Authors: Ryo Yoda (Kogakuin University), Akihiro Fujii (Kogakuin University), Teruo Tanaka (Kogakuin University)

Abstract: MGRIT re-discretize the problem with larger time-step width at the coarse-levels, which often cause unstable convergence. We propose a Krylov subspace method with MGRIT preconditioning as a more stable solver. For unstable problems, MGRIT preconditioned Krylov subspace method performed better than MGRIT in terms of the number of iterations. The contributions of the paper are organized as follows. We showed the matrix form of MGRIT operations, and the improvement of eigenvalue or singular-value distribution. We exemplified MGRIT with Krylov subspace method reaching convergence faster than MGRIT.

Best Poster Finalist (BP): no

Poster: pdf
Poster summary: PDF

Back to Poster Archive Listing