Matrix-vector multiplication: Parallel algorithms and architectures (Q1114309)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4084859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matrix-vector multiplication: Parallel algorithms and architectures |
scientific article; zbMATH DE number 4084859 |
Statements
Matrix-vector multiplication: Parallel algorithms and architectures (English)
0 references
1988
0 references
Discussion of time complexity, speedup and efficiency of the matrix- vector multiplication of dimension n for linear array (n processors),mesh of trees \((3n^ 2-2n\) processors), binary tree (2n-1 processors) and all configurations with p processors. For the binary tree short outline of Jacobi and Lanczos iteration. It seems that in the paper the notions ``column'' and ``row'' have been confused.
0 references
parallel computation
0 references
Jacobi method
0 references
Lanczos method
0 references
time complexity
0 references
speedup
0 references
efficiency
0 references
matrix-vector multiplication
0 references
mesh of trees
0 references
binary tree
0 references
Jacobi and Lanczos iteration
0 references
0.8216321468353271
0 references
0.7955419421195984
0 references
0.77351975440979
0 references
0.7721989750862122
0 references
