The scheduling of sparse matrix-vector multiplication on a massively parallel DAP computer

DOI10.1016/0167-8191(92)90007-TzbMath0761.65033OpenAlexW2156570692MaRDI QIDQ1199098

S. Singh

Publication date: 16 January 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90007-t

zbMATH Keywords

performancelinear programmingparallel computationinterior point methodmatrix-vector multiplicationdistributed array of processorsiterative conjugate gradient solversparse algorithmsunstructured sparse matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Linear programming (90C05) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10) Probabilistic methods, stochastic differential equations (65C99)

Related Items (1)

Fast parallel algorithms for Graeffe's root squaring technique

Uses Software

• KORBX

This page was built for publication: The scheduling of sparse matrix-vector multiplication on a massively parallel DAP computer