Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1137/S1064827500381045 | SIAM Journal on Scientific Computing |
Keywords | Field | DocType |
algebraic multilevel multigraph algorithm,near-optimal complexity,general sparse gaussian elimination,classical multigrid method,multilevel component,sparse direct method,minimum degree,direct method,incomplete lu factorization,algebraic multigrid | Mathematical optimization,Multigraph,Algebraic number,Generalization,Algorithm,Robustness (computer science),Incomplete LU factorization,Gaussian elimination,LU decomposition,Multigrid method,Mathematics | Journal |
Volume | Issue | ISSN |
23 | 5 | 1064-8275 |
Citations | PageRank | References |
16 | 1.35 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Randolph E. Bank | 1 | 238 | 27.87 |
| R. Kent Smith | 2 | 58 | 6.39 |