Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations
Main Authors: | Cohen, Michael B., Kelner, Jonathan, Kyng, Rasmus, Peebles, John, Peng, Richard, Rao, Anup B., Sidford, Aaron |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
IEEE
2021
|
Online Access: | https://hdl.handle.net/1721.1/138046 |
Similar Items
-
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
by: Peng, Richard, et al.
Published: (2018) -
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
by: Orecchia, Lorenzo, et al.
Published: (2013) -
Smaller steps for faster algorithms : a new approach to solving linear systems
by: Sidford, Aaron Daniel
Published: (2014) -
On the Power of Preconditioning in Sparse Linear Regression
by: Kelner, Jonathan A, et al.
Published: (2022) -
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
by: Peng, Richard, et al.
Published: (2018)