A Subgraph Preconditioning Algorithm for Large Linear Systems

In this paper, a preconditioning algorithm for sparse, symmetric, diagonally dominant (SDD) linear systems is proposed by using combinatorial techniques. Firstly, we construct preconditioners by finding a subgraph based on the relationship between SDD matrices and undirected graphs. The subgraph is built by augmenting a low-stretch spanning tree with some extra high stretch edges. Then we implement the algorithm for building a low stretch tree and give a parallel implementation of the subgraph preconditioning algorithm based on PETSc software. Finally, numerical experiments arising from both elliptic PDEs and Laplacian systems of network graphs are tested to evaluate the performance of our algorithm. Numerical experiments show that preconditioners constructed by our algorithm are more efficient than incomplete Choleskey factorization preconditioners and Vaidya's preconditioners. Besides, based on the tree structure, our preconditioners perform respectable parallel scalability.

[1]  Zeyuan Allen Zhu,et al.  A simple, combinatorial algorithm for solving SDD systems in nearly-linear time , 2013, STOC '13.

[2]  Sivan Toledo,et al.  Support-Graph Preconditioners , 2005, SIAM J. Matrix Anal. Appl..

[3]  D. Spielman.  Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices , 2011 .

[4]  Noga Alon,et al.  A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..

[5]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[6]  Shang-Hua Teng,et al.  Lower-stretch spanning trees , 2004, STOC '05.

[7]  Daniel A. Spielman,et al.  A Note on Preconditioning by Low-Stretch Spanning Trees , 2009, ArXiv.

[8]  Bruce Hendrickson,et al.  Support Theory for Preconditioning , 2003, SIAM J. Matrix Anal. Appl..

[9]  David M. Young,et al.  Applied Iterative Methods , 2004 .

[10]  Sophia Blau,et al.  Analysis Of The Finite Element Method , 2016 .

[11]  Gary L. Miller,et al.  Approaching Optimality for Solving SDD Linear Systems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[12]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[13]  Gary L. Miller,et al.  A Nearly-m log n Time Solver for SDD Linear Systems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[14]  Gil Shklarski,et al.  Combinatorial Preconditioners for Scalar Elliptic Finite-Element Problems , 2009, SIAM J. Matrix Anal. Appl..

[15]  Ittai Abraham,et al.  Using petal-decompositions to build a low stretch spanning tree , 2012, STOC '12.

[16]  Uwe Naumann,et al.  Combinatorial Scientific Computing , 2012 .

[17]  J. Gilbert,et al.  Obtaining bounds on the two norm of a matrix from the splitting lemma. , 2005 .

[18]  Gary L. Miller,et al.  Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing , 2011, Comput. Vis. Image Underst..

[19]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[20]  O. Axelsson,et al.  On the rate of convergence of the preconditioned conjugate gradient method , 1986 .

[21]  Achi Brandt,et al.  Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver , 2011, SIAM J. Sci. Comput..

[22]  Ittai Abraham,et al.  Nearly Tight Low Stretch Spanning Trees , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[23]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[24]  Gene H. Golub,et al.  A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations , 2007, Milestones in Matrix Computation.

[25]  Sivan Toledo,et al.  Maximum‐weight‐basis preconditioners , 2004, Numer. Linear Algebra Appl..

[26]  D. Chen,et al.  VAIDYA'S PRECONDITIONERS: IMPLEMENTATION AND EXPERIMENTAL STUDY , 2003 .

[27]  Ojas D. Parekh,et al.  On Factor Width and Symmetric H-matrices , 2005 .

[28]  Richard Peng,et al.  Sparsified Cholesky and multigrid solvers for connection laplacians , 2015, STOC.

[29]  Jakub W. Pachocki,et al.  Stretching Stretch , 2014, ArXiv.

[30]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[31]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.