A parallel adaptive Gauss-Jordan algorithm

DOI10.1023/A:1008182404262MaRDI QIDQ1592938zbMATH OpenOpenAlexFDO

Authors Nouredine Melab, El-Ghazali Talbi, Serge G. Petiton

Publication date 24 October 2001

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008182404262

zbMATH Keywords

fault toleranceGauss-Jordan algorithmnetwork of working stationsnumerical examplesparallel computationscheduling

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Review text

The parallel solution of a block-based Gauss-Jordan algorithm on a network of workstations is discussed. A work scheduling strategy and an application oriented solution of the fault tolerance problem is given. Implementations and experiments are reported.

Recommendations

• Publication:5753518
• A parallel gaussian elimination method for general linear systems
• scientific article; zbMATH DE number 2069330
• Publication:4721514
• A note on parallel matrix inversion

Cited in

(6)

• Rehabilitation of the Gauss-Jordan algorithm
• A class of Adams-type parallel hybrid algorithms
• scientific article; zbMATH DE number 1204366 (Why is no real title available?)
• scientific article; zbMATH DE number 2069330 (Why is no real title available?)
• scientific article; zbMATH DE number 4189187 (Why is no real title available?)
• Clustered Gauss-Huard algorithm for the solution of Ax = b

This page was built for publication: A parallel adaptive Gauss-Jordan algorithm

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