Noga Alon
Abstract
The generalized nested dissection method, developed by Lipton et al. [1979], is a seminal method for solving a linear system Ax=b where A is a symmetric positive definite matrix. The method runs extremely fast whenever A is a well-separable matrix (such as matrices whose underlying support is planar or avoids a fixed minor). In this work, we extend the nested dissection method to apply to any nonsingular well-separable matrix over any field. The running times we obtain essentially match those of the nested dissection method. An important tool is a novel method for matrix sparsification that preserves determinants and minors, and that guarantees that constant powers of the sparsified matrix remain sparse.
- Alon, N., Seymour, P., and Thomas, R. 1990. A separator theorem for nonplanar graphs. J. Amer. Math. Soc. 3, 4, 801--808.Google Scholar
Cross Ref
- Alon, N. and Yuster, R. 2010. Solving linear systems through nested dissection. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 225--234. Google ScholarDigital Library
- Bunch, J. and Hopcroft, J. 1974. Triangular factorization and inversion by fast matrix multiplication. Math. Computat. 28, 125, 231--236.Google Scholar
- Coppersmith, D. and Winograd, S. 1990. Matrix multiplication via arithmetic progressions. J. Symbol. Computat. 9, 3, 251--280. Google ScholarDigital Library
- Eberly, W., Giesbrecht, M., Giorgi, P., Storjohann, A., and Villard, G. 2006. Solving sparse rational linear systems. In Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation (ISSAC). ACM, 63--70. Google ScholarDigital Library
- George, A. 1973. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10, 2, 345--363.Google ScholarDigital Library
- Gilbert, J., Hutchinson, J., and Tarjan, R. 1984. A separator theorem for graphs of bounded genus. J. Algor. 5, 3, 391--407. Google ScholarDigital Library
- Gilbert, J. and Tarjan, R. 1987. The analysis of a nested dissection algorithm. Numer. Math. 50, 4, 377--404. Google ScholarDigital Library
- Håstad, J. 2001. Some optimal inapproximability results. J. ACM 48, 4, 798--859. Google ScholarDigital Library
- Horn, R. and Johnson, C. 1990. Matrix Analysis. Cambridge University Press. Google ScholarDigital Library
- Ibarra, O., Moran, S., and Hui, R. 1982. A generalization of the fast lup matrix decomposition algorithm and applications. J. Algor. 3, 1, 45--56.Google ScholarCross Ref
- Kawarabayashi, K. and Reed, B. 2010. A separator theorem in minor-closed classes. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 153--162. Google ScholarDigital Library
- Lipton, R., Rose, D., and Tarjan, R. 1979. Generalized nested dissection. SIAM J. Numer. Anal. 16, 2, 346--358.Google ScholarDigital Library
- Lipton, R. and Tarjan, R. 1979. A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 2, 177--189.Google ScholarDigital Library
- Mohar, B. 1999. A linear time algorithm for embedding graphs in an arbitrary surface. SIAM J. Disc. Math. 12, 1, 6--26. Google ScholarDigital Library
- Mucha, M. and Sankowski, P. 2006. Maximum matchings in planar graphs via gaussian elimination. Algorithmica 45, 1, 3--20. Google ScholarDigital Library
- Plotkin, S., Rao, S., and Smith, W. 1994. Shallow excluded minors and improved graph decompositions. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 462--470. Google ScholarDigital Library
- Reed, B. and Wood, D. 2009. A linear-time algorithm to find a separator in a graph excluding a minor. ACM Trans. Algorithms 5, 4, #39. Google ScholarDigital Library
- Schwartz, J. 1980. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 4, 701--717. Google ScholarDigital Library
- Shoup, V. 1994. Fast construction of irreducible polynomials over finite fields. J. Symb. Computat. 17, 5, 371--391. Google ScholarDigital Library
- Spielman, D. and Teng, S. 1996. Spectral partitioning works: planar graphs and finite element meshes. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 96--105. Google ScholarDigital Library
- Spielman, D. and Teng, S. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC). ACM, 81--90. Google ScholarDigital Library
- Strassen, V. 1969. Gaussian elimination is not optimal. Numerische Mathematik 13, 4, 354--356.Google ScholarDigital Library
- Wiedemann, D. 1986. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory 32, 1, 54--62. Google ScholarDigital Library
- Wilson, D. 1997. Determinant algorithms for random planar structures. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 258--267. Google ScholarDigital Library
- Yuster, R. 2008. Matrix sparsification for rank and determinant computations via nested dissection. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 137--145. Google ScholarDigital Library
- Yuster, R. and Zwick, U. 2007. Maximum matching in graphs with an excluded minor. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 108--117. Google ScholarDigital Library
- Zippel, R. 1979. Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposiumon on Symbolic and Algebraic Computation. Springer-Verlag, 216--226. Google ScholarDigital Library
Index Terms
- Matrix sparsification and nested dissection over arbitrary fields
Recommendations
Solving Linear Systems through Nested Dissection
FOCS '10: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer ScienceThe generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax=b where A is a symmetric positive definite matrix. The method runs extremely fast whenever A is a well-separable matrix (...
Incomplete nested dissection
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingWe present an asymptotically faster algorithm for solving linear systems in well-structured 3-dimensional truss stiffness matrices. These linear systems arise from linear elasticity problems, and can be viewed as extensions of graph Laplacians into ...
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
FOCS '08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer ScienceThe nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices whose support structure satisfies good separation properties (e.g. planar)...
Comments