A parallel elimination algorithm for the solution of dense linear systems

DOI10.1080/00207169308804167zbMath0812.65022OpenAlexW1975876189MaRDI QIDQ4323419

M. M. Chawla

Publication date: 14 May 1995

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

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

zbMATH Keywords

partitioninglinear systemefficiencyparallel algorithmdense linear systemsGaussian elimination methodfolding methodparallel elimination method

Mathematics Subject Classification ID

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

Cites Work

• A new folding gaussian elimination algorithm for general linear systems
• Systolic lu-factorization “dequeues” for trldiagonal systems
• A parallel gaussian elimination method for general linear systems
• Unnamed Item

This page was built for publication: A parallel elimination algorithm for the solution of dense linear systems