Incomplete nested dissection

Robert Schwieterman
Robert Schwieterman
Peng Zhang
Peng Zhang

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 2018, pp. 404-417, 2018.

Cited by: 3|Bibtex|Views5|DOI:https://doi.org/10.1145/3188745.3188960
EI
Other Links: dblp.uni-trier.de|dl.acm.org|arxiv.org

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments