AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

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

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

被引用20|浏览86
EI
24小时获取PDF
引用

摘要

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...更多

代码

数据

您的评分 :
0

 

标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn
小科