Matrix-vector multiplication: Parallel algorithms and architectures

DOI10.1016/0898-1221(88)90262-3MaRDI QIDQ1114309zbMATH OpenOpenAlexFDO

Authors Bruno Codenotti, C. Puglisi

Publication date 1988

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(88)90262-3

zbMATH Keywords

binary treeefficiencyJacobi and Lanczos iterationJacobi methodLanczos methodmatrix-vector multiplicationmesh of treesparallel computationspeeduptime complexity

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Review text

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.

Recommendations

• Parallel algorithms and architectures for matrix multiplication
• scientific article; zbMATH DE number 4072257
• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• An algorithm for multiplication of concatenated matrices
• Parallel complexity of matrix multiplication

Cites work

• A Survey of Parallel Algorithms in Numerical Linear Algebra
• A Survey of Parallelism in Numerical Analysis
• scientific article; zbMATH DE number 3628373 (Why is no real title available?)

Cited in

(3)

• Matrix structures in parallel matrix computations
• Parallel algorithms and architectures for matrix multiplication
• Parallel Processing of Matrix Multiplication in a CPU and GPU Heterogeneous Environment

This page was built for publication: Matrix-vector multiplication: Parallel algorithms and architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114309)