Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball

We present an efficient algorithm for solving a linear system arising from the 1-Laplacian corresponding to a collapsible simplicial complex with a known collapsing sequence. When combined with a result of Chillingworth, our algorithm is applicable to convex simplicial complexes embedded in R3. The running time of our algorithm is nearly-linear in the size of the complex and is logarithmic on its numerical properties. Our algorithm is based on projection operators and combinatorial steps for transferring between them. The former relies on decomposing flows into circulations and potential flows using fast solvers for graph Laplacians, and the latter relates Gaussian elimination to topological properties of simplicial complexes.

[1]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[2]  Guy E. Blelloch,et al.  Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs , 2011, SPAA '11.

[3]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[4]  Herbert Edelsbrunner,et al.  On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank , 2014, SODA.

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

[6]  Yuan Yao,et al.  Statistical ranking and combinatorial Hodge theory , 2008, Math. Program..

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

[8]  Yin Tat Lee,et al.  Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[9]  Daniel A. Spielman,et al.  Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.

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

[11]  Tamal K. Dey,et al.  Computing homology groups of simplicial complexes in R3 , 1998, JACM.

[12]  Daniel A. Spielman,et al.  Support-Graph Preconditioners for 2-Dimensional Trusses , 2007, ArXiv.

[13]  J. Whitehead.  Simplicial Spaces, Nuclei and m‐Groups , 1939 .

[14]  Herbert Edelsbrunner,et al.  An incremental algorithm for Betti numbers of simplicial complexes , 1993, SCG '93.

[15]  Collapsing three-dimensional convex polyhedra: correction , 1980 .

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

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

[18]  J. Friedman,et al.  Computing Betti Numbers via Combinatorial Laplacians , 1996, STOC '96.

[19]  Shang-Hua Teng,et al.  Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.

[20]  Richard Peng,et al.  Algorithm Design Using Spectral Graph Theory , 2013 .

[21]  O. Axelsson.  Iterative solution methods , 1995 .

[22]  W. V. Hodge,et al.  The Theory and Applications of Harmonic Integrals , 1941 .

[23]  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.

[24]  Martin Tancer.  Recognition of Collapsible Complexes is NP-Complete , 2016, Discret. Comput. Geom..

[25]  P. D. Val.  The Theory and Applications of Harmonic Integrals , 1941, Nature.

[26]  R. Ho.  Algebraic Topology , 2022 .

[27]  D. R. J. Chillingworth,et al.  Collapsing three-dimensional convex polyhedra , 1967, Mathematical Proceedings of the Cambridge Philosophical Society.

[28]  G. Strang.  Introduction to Linear Algebra , 1993 .

[29]  Aleksander Madry,et al.  Faster Generation of Random Spanning Trees , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[30]  Marshall M. Cohen.  A Course in Simple-Homotopy Theory , 1973 .

[31]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[32]  Yiying Tong,et al.  Discrete differential forms for computational modeling , 2005, SIGGRAPH Courses.

[33]  Chao Chen,et al.  An output-sensitive algorithm for persistent homology , 2013, Comput. Geom..

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

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

[36]  Bruce Hendrickson,et al.  Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners , 2004, SIAM J. Numer. Anal..

[37]  David Eppstein,et al.  Dynamic generators of topologically embedded graphs , 2002, SODA '03.