Randomized Cholesky Preconditioning for Graph Partitioning Applications
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.
- Research Organization:
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE Oak Ridge Institute for Science and Education (ORISE); USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- NA0003525
- OSTI ID:
- 1840649
- Report Number(s):
- SAND2022-0441R; 702550
- Country of Publication:
- United States
- Language:
- English
Similar Records
Randomized Cholesky Preconditioning for Graph Partitioning Applications
Partitioning sparse matrices with eigenvectors of graphs
Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning
Technical Report
·
Sun Feb 06 23:00:00 EST 2022
·
OSTI ID:1843910
Partitioning sparse matrices with eigenvectors of graphs
Journal Article
·
Sun Jul 01 00:00:00 EDT 1990
· SIAM Journal on Matrix Analysis and Applications
·
OSTI ID:6696852
Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning
Technical Report
·
Wed Feb 17 23:00:00 EST 2016
·
OSTI ID:1240975