A parallel gaussian elimination method for general linear systems

DOI10.1080/00207169208804052zbMath0748.65020OpenAlexW2154657762MaRDI QIDQ3989755

M. M. Chawla

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804052

zbMATH Keywords

partitioningconsistencyefficiencyGaussian eliminationparallel implementationfolding methodoperational countparallel Gauss-Jordan-like method

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A parallel elimination algorithm for the solution of dense linear systems

Cites Work

• Unnamed Item
• Parallel Gaussian elimination on an MIMD computer
• A new folding gaussian elimination algorithm for general linear systems
• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• Parallel Algorithms for Dense Linear Algebra Computations
• Systolic lu-factorization “dequeues” for trldiagonal systems

This page was built for publication: A parallel gaussian elimination method for general linear systems