BSP linear solvers for dense matrices

DOI10.1016/S0167-8191(98)00014-3MaRDI QIDQ1274363zbMATH OpenOpenAlexFDO

Authors D. J. Evans, M. Barulli

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

bulk synchronous parallel (BSP) modelcluster of workstationsGauss-Jordan eliminationGaussian eliminationimplicit eliminationlinear systemsshared memory

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Direct bulk-synchronous parallel algorithms
• A BSP Bareiss algorithm for Toeplitz systems
• The bulk-synchronous parallel random access machine
• scientific article; zbMATH DE number 1424562

Cited in

(7)

• The block WZ factorization
• An overlapped two-way method for solving tridiagonal linear systems in a BSP computer
• Influence of Preconditioning and Blocking on Accuracy in Solving Markovian Models
• An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems
• JBSP: A BSP programming library in Java
• Basic techniques for numerical linear algebra on bulk synchronous parallel computers
• A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system

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

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