Parallel Matrix Decomposition
Parallel Matrix Decomposition is a computational method in numerical linear algebra that factorizes a matrix into constituent components using parallel algorithms to distribute and synchronize operations across multiple processing units for improved efficiency and scalability.
207
Publications
8.7K
Citations
447
Authors
234
Institutions
Publications per year
2017–2026
21
207
George Karypis, Vipin Kumar · University of Minnesota Digital Conservancy (University of Minnesota) · 1997 · 1.2K citations · Full text
1–5 of 207
447
8
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 447
234

Oak Ridge National Laboratory
Oak Ridge, United States
10 h-index
20 publications
653 citations
University of Tennessee at Knoxville
Knoxville, United States
9 h-index
16 publications
505 citations
University of Illinois Urbana-Champaign
Urbana, United States
6 h-index
9 publications
267 citations
The University of Tokyo
Tokyo, Japan
5 h-index
7 publications
459 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
10 publications
420 citations

Sapienza University of Rome
Rome, Italy
5 h-index
9 publications
195 citations
Argonne National Laboratory
Lemont, United States
5 h-index
6 publications
475 citations

University of Toronto
Toronto, Canada
4 h-index
4 publications
109 citations
1–8 of 234
24 publications · 747 citations
16
h-index
7 publications · 362 citations
7
h-index
TPDS · 6 publications · 658 citations
6
h-index
5 publications · 152 citations
5
h-index
Repository · 4 publications · 59 citations
4
h-index
1–5