Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 898.0-909, 2018.

Cited by: 14|Bibtex|Views53|DOI:https://doi.org/10.1109/FOCS.2018.00089
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

In this paper, we show how to solve directed Laplacian systems in nearly-linear time. Given a linear system in an nxn Eulerian directed Laplacian with m nonzero entries, we show how to compute an epsilon-approximate solution in time O(m log(O(1))(n) log(1/epsilon)). Through reductions from [Cohen et al. FOCS'16], this gives the first near...More

Code:

Data:

Your rating :
0

 

Tags
Comments