Incomplete nested dissection
STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 2018, pp. 404-417, 2018.
We 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 higher dimensions. Faster solvers for the 2-D variants of such systems have been studied us...More
Full Text (Upload PDF)
PPT (Upload PPT)