Publisher
Springer International Publishing
Reference72 articles.
1. Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du, J. Croz, Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users’ Guide. SIAM, Philadelphia, PA (1999)
2. Ballard, G., Demmel, J., Dumitriu, I.: Communication-optimal parallel and sequential eigenvalue and singular value algorithms. Tech. Report EECS-2011-14, UC Berkeley, Feb 2011
3. Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Graph expansion and communication costs of fast matrix multiplication. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’11, pp. 1–12. ACM, New York (2011)
4. Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Minimizing communication in numerical linear algebra. SIAM J. Matrix Anal. Appl. 32(3), 866–901 (2011). http://epubs.siam.org/doi/10.1137/090769156
5. Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., Schwartz, O.: Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. In: Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA ’12, pp. 77–79. ACM, New York (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Higher-Order QR with Tournament Pivoting for Tensor Compression;SIAM Journal on Matrix Analysis and Applications;2023-02-27