We describe an algebraic multilevel multigraph algorithm. Many of the
multilevel components are generalizations of algorithms originally
applied to general sparse Gaussian elimination. Indeed, general sparse
Gaussian elimination with minimum degree ordering is a limiting case
of our algorithm. Our goal is to develop a procedure which has the
robustness and simplicity of use of sparse direct methods, yet offers
the opportunity to obtain the optimal or near-optimal complexity
typical of classical multigrid methods.
Converted from bank.abs (plain text).