An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems

DOI10.1080/00207160108805034zbMath0967.65038OpenAlexW2151909695MaRDI QIDQ4528036

David V. Evans, Ke Chen

Publication date: 3 September 2001

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

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

zbMATH Keywords

algorithmnumerical experimentsparallel computingdense linear systemsGauss-Huard methodGauss-Jordan methodPurcell vector method

Mathematics Subject Classification ID

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

Related Items (1)

Purcell's method, Egerváry and related results

Cites Work

• Unnamed Item
• Rehabilitation of the Gauss-Jordan algorithm
• BSP linear solvers for dense matrices
• Parallel algorithms for solving large linear systems
• An extension of Purcell's vector method with applications to panel element equations
• Parallel Gauss-Jordan elimination for the solution of dense linear systems
• Matrix computation and the theory of moments
• The Vector Method of Solving Simultaneous Linear Equations

This page was built for publication: An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems