BSP linear solvers for dense matrices

DOI10.1016/S0167-8191(98)00014-3zbMath0909.68013OpenAlexW2026633184MaRDI QIDQ1274363

M. Barulli, David J. Evans

Publication date: 12 January 1999

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(98)00014-3

zbMATH Keywords

linear systemsGaussian eliminationshared memoryGauss-Jordan eliminationcluster of workstationsbulk synchronous parallel (BSP) modelimplicit elimination

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (5)

An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems ⋮ The block WZ factorization ⋮ An overlapped two-way method for solving tridiagonal linear systems in a BSP computer ⋮ A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system ⋮ Influence of Preconditioning and Blocking on Accuracy in Solving Markovian Models

This page was built for publication: BSP linear solvers for dense matrices