Pairwise reduction for the direct, parallel solution of sparse, unsymmetric sets of linear equations

DOI10.1109/12.9742MaRDI QIDQ3805752zbMATH OpenOpenAlexFDO

Authors Timothy A. Davis, Edward S. Davidson

Publication date 1988

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.9742

zbMATH Keywords

asynchronous algorithmsconcurrent data structuresgather/scatter vector hardwareGaussian eliminationpairwise pivotingparallel algorithmsparallel architecturessparse matricessparse matrix algorithmssparse vector hardwaresynchronization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• scientific article; zbMATH DE number 4076453
• Parallel sparse matrix solution and performance
• scientific article; zbMATH DE number 18297
• scientific article; zbMATH DE number 3874479
• Fast and Efficient Parallel Solution of Sparse Linear Systems

Cited in

(3)

• scientific article; zbMATH DE number 434524 (Why is no real title available?)
• Design and implementation of a parallel Markowitz threshold algorithm
• A survey of direct methods for sparse linear systems

This page was built for publication: Pairwise reduction for the direct, parallel solution of sparse, unsymmetric sets of linear equations

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