Parallel Matrix Algorithms
Parallel Matrix Algorithms is a subclass of parallel algorithms that specifically encompasses computational methods designed to perform matrix operations by decomposing and distributing data and tasks across multiple processing units to achieve scalability and efficiency in solving linear algebra problems.
967
Publications
44.7K
Citations
1.7K
Authors
569
Institutions
Publications per year
2017–2026
62
967
Parallel and distributed computation
Dimitri P. Bertsekas, John N. Tsitsiklis, Alexander N. Sennikov · 1989 · 1.2K citations
Xiaoye Sherry Li, James Demmel · ACM Transactions on Mathematical Software · 2003 · 622 citations
1–5 of 967
1.7K
22
h-index
21
h-index
18
h-index
16
h-index
15
h-index
1–5 of 1.7K
569
University of California, Berkeley
Berkeley, United States
21 h-index
56 publications
4.4K citations
University of Tennessee at Knoxville
Knoxville, United States
20 h-index
71 publications
4.5K citations
The University of Texas at Austin
Austin, United States
19 h-index
54 publications
3.1K citations

Oak Ridge National Laboratory
Oak Ridge, United States
19 h-index
43 publications
2.9K citations

University of Minnesota
Minneapolis, United States
15 h-index
41 publications
1.8K citations
University of Illinois Urbana-Champaign
Urbana, United States
15 h-index
29 publications
1.7K citations
Stanford University
Stanford, United States
14 h-index
27 publications
2.2K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
46 publications
2.6K citations
1–8 of 569
52 publications · 2.9K citations
31
h-index
62 publications · 3K citations
28
h-index
TOMS · 26 publications · 2.1K citations
19
h-index
25 publications · 1.9K citations
19
h-index
23 publications · 828 citations
17
h-index
1–5