2017
DOI: 10.1137/15m1050872
|View full text |Cite
|
Sign up to set email alerts
|

Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…Thus, Linear multigrid methods have also been applied to linear systems that do not arise from partial differential equations, and often do not even have an underlying geometry [7]. This has been most successful for graph Laplacian matrices, which are in many ways an algebraic analogue to the geometric Poisson problem [16,33,34,10]. Algebraic multigrid, with its ever expanding area of application and intent for extreme scale parallel scalability, is still an active area of research [14,6,46,17,4].…”
mentioning
confidence: 99%
“…Thus, Linear multigrid methods have also been applied to linear systems that do not arise from partial differential equations, and often do not even have an underlying geometry [7]. This has been most successful for graph Laplacian matrices, which are in many ways an algebraic analogue to the geometric Poisson problem [16,33,34,10]. Algebraic multigrid, with its ever expanding area of application and intent for extreme scale parallel scalability, is still an active area of research [14,6,46,17,4].…”
mentioning
confidence: 99%