A Simple and Efficient Parallel Laplacian Solver-Reference-Cited by-同舟云学术

A Simple and Efficient Parallel Laplacian Solver

Published:2023-06-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Sachdeva Sushant¹^ORCID,Zhao Yibin¹^ORCID

Affiliation:

1. University of Toronto, Toronto, ON, Canada

Funder

Natural Sciences and Engineering Research Council of Canada (NSERC)

Ontario Ministry of Research Innovation and Science

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3558481.3591101

Reference44 articles.

1. The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

2. Owe Axelsson . 1996. Iterative solution methods . Cambridge university press . Owe Axelsson. 1996. Iterative solution methods. Cambridge university press.

3. Tikhonov regularization and semi-supervised learning on large graphs

4. Guy E. Blelloch and Bruce M . Maggs . 2010 . Parallel Algorithms (2 ed.). Chapman & Hall/CRC , 25. Guy E. Blelloch and Bruce M. Maggs. 2010. Parallel Algorithms (2 ed.). Chapman & Hall/CRC, 25.

5. Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Framework for Parallelizing Approximate Gaussian Elimination;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. GPU-LSolve: An Efficient GPU-Based Laplacian Solver for Million-Scale Graphs;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27