Abstract

In this work, we describe a multilevel-multigraph algorithm. Our goal is to develop and iterative solver with the simplicity of use and robustness of general sparse Gaussian elimination, and at the same time to capture the computational efficiency of classical multigrid algorithms.