23 citations · 24 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Efficient -Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences
Ming Ding, Peng Zhang
We present efficient algorithms for approximately solving systems of linear equations in -Laplacians of well-shaped simplicial complexes up to high precision. -Laplacians, or…
cs.DS2018
Incomplete Nested Dissection
Rasmus Kyng, Richard Peng, Robert Schwieterman +1
We present an asymptotically faster algorithm for solving linear systems in well-structured 3-dimensional truss stiffness matrices. These linear systems arise from linear elasticit…
cs.DS2012★ 23 cited
Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming
Richard Peng, Kanat Tangwongsan, Peng Zhang
This paper studies the problem of finding an -approximate solution to positive semidefinite programs. These are semidefinite programs in which all matrices in the constraint…