Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning
- Cornell Univ., Ithaca, NY (United States)
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
We present a parallelizable direct method for computing the solution to graph Laplacian-based linear systems derived from graphs that can be hierarchically bipartitioned with small edge cuts. For a graph of size n with constant-size edge cuts, our method decomposes a graph Laplacian in time O(n log n), and then uses that decomposition to perform a linear solve in time O(n log n). We then use the developed technique to design a preconditioner for graph Laplacians that do not have this property. Finally, we augment this preconditioner with a two-grid method that accounts for much of the preconditioner's weaknesses. We present an analysis of this method, as well as a general theorem for the condition number of a general class of two-grid support graph-based preconditioners. Numerical experiments illustrate the performance of the studied methods.
- Research Organization:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC52-07NA27344
- OSTI ID:
- 1240975
- Report Number(s):
- LLNL-TR-683260
- Country of Publication:
- United States
- Language:
- English
Similar Records
How good is recursive bisection?
A Parallel Solver for Graph Laplacians