Parallel Matrix-vector Multiplication
Parallel Matrix-Vector Multiplication is a parallel numerical algorithm that distributes the computation of the product between a matrix and a vector across multiple processing units to accelerate execution, distinguished from sequential methods by its concurrent evaluation of submatrix-subvector operations through domain decomposition and inter-process communication.
425
Publications
20.8K
Citations
1.2K
Authors
403
Institutions
Publications per year
2017–2026
75
425
1–5 of 425
1.2K
13
h-index
9
h-index
9
h-index
5
h-index
5
h-index
1–5 of 1.2K
403
University of Tennessee at Knoxville
Knoxville, United States
12 h-index
27 publications
3.6K citations
The University of Texas at Austin
Austin, United States
12 h-index
24 publications
2.3K citations

Oak Ridge National Laboratory
Oak Ridge, United States
10 h-index
18 publications
1.2K citations
Purdue University West Lafayette
West Lafayette, United States
10 h-index
29 publications
2.1K citations
The Ohio State University
Columbus, United States
9 h-index
21 publications
972 citations
University of California, Berkeley
Berkeley, United States
9 h-index
20 publications
1.1K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
8 h-index
9 publications
171 citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
14 publications
525 citations
1–8 of 403
TPDS · 17 publications · 1.2K citations
16
h-index
22 publications · 874 citations
14
h-index
9 publications · 398 citations
9
h-index
7 publications · 250 citations
7
h-index
7 publications · 242 citations
7
h-index
1–5