On the performance of transputer networks for solving linear systems of equations

DOI10.1016/S0167-8191(05)80006-7zbMath0736.65011OpenAlexW2052556960MaRDI QIDQ1180621

E. Gehrke, Georg Bader

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(05)80006-7

zbMATH Keywords

performancescalingtest problemstriangular systemsasynchronous communication\(LU\)-decompositionlarge linear systemsparallel Gaussian eliminationcoarse granularitytransputer networksmassively parallel transputer- networkstriangular system solving

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Parallel algorithms for solving large linear systems ⋮ TRANSPOSE-FREE LANCZOS-TYPE SCHEMES ON TRANSPUTER NETWORK∗ ⋮ A domain splitting algorithm for parabolic problems ⋮ On the cost of sequential and parallel algorithms for solving linear system of equations ⋮ Parallel implementation of the boundary element method for linear elastic problem on a MIMD parallel computer