HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

Hardness Results for Structured Linear Systems

Rasmus Kyng
Rasmus Kyng
Peng Zhang
Peng Zhang

2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 684.0-695, 2017.

Cited by: 9|Bibtex|Views4|DOI:https://doi.org/10.1109/FOCS.2017.69
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org
Keywords:
Numerical Linear AlgebraLinear System SolversLaplacian SolversMulti-commodity Flow ProblemsTruss Stiffness MatricesMore(3+)

Abstract:

We show that if the nearly-linear time solvers for Laplacian matrices and their generalizations can be extended to solve just slightly larger families of linear systems, then they can be used to quickly solve all systems of linear equations over the reals. This result can be viewed either positively or negatively: either we will develop n...More

Code:

Data:

Your rating :
0

 

Tags
Comments