Exploiting Data Sparsity in Parallel Matrix Powers Computations-Reference-Cited by-同舟云学术

Exploiting Data Sparsity in Parallel Matrix Powers Computations

Published:2014 Issue: Volume: Page:15-25
ISSN:0302-9743
Container-title:Parallel Processing and Applied Mathematics
language:
Short-container-title:

Author:

Knight Nicholas,Carson Erin,Demmel James

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-55224-3_2

Reference13 articles.

1. LNCS;M Bebendorf,2008

2. Chan, E., Heimlich, M., Purkayastha, A., Van De Geijn, R.: Collective communication: theory, practice, and experience. Concurrency Comput.: Pract. Exper. 19, 1749–1783 (2007)

3. Chandrasekaran, S., Dewilde, P., Gu, M., Lyons, W., Pals, T.: A fast solver for HSS representations via sparse matrices. SIAM J. Matrix Anal. Appl. 29, 67–81 (2006)

4. Demmel, J., Hoemmen, M., Mohiyuddin, M., Yelick, K.: Avoiding communication in computing Krylov subspaces. Technical report UCB/EECS-2007-123, University of California-Berkeley (2007)

5. Hoemmen, M.: Communication-avoiding Krylov subspace methods. Ph.D. thesis, University of California-Berkeley (2010)

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

1. Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance;SIAM Review;2023-02

2. TileSpGEMM;Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2022-03-28

3. Randomized algorithms to update partial singular value decomposition on a hybrid CPU/GPU cluster;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2015-11-15