Parallel Gauss-Jordan elimination for the solution of dense linear systems

DOI10.1016/0167-8191(87)90031-7zbMath0618.65021OpenAlexW2054335331MaRDI QIDQ1822450

R. G. Melhem

Publication date: 1987

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(87)90031-7

zbMATH Keywords

Gauss eliminationdense linear systemscomputational networkoptimal parallel implementationparallel Gauss-Jordan elimination algorithm

Mathematics Subject Classification ID

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

Related Items (9)

An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems ⋮ A new Gaussian elimination-based algorithm for parallel solution of linear equations ⋮ TWO-SIDED ELIMINATION ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS USING HOUSEHOLDER REDUCTIONS ⋮ A NEW MODIFIED GRAM-SCHMIDT ORTHOGONAL MATRIX FACTORIZATION BASED ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS ⋮ Systolic algorithm for the solution of dense linear equations ⋮ A multi-GPU implementation of a full-field crystal plasticity solver for efficient modeling of high-resolution microstructures ⋮ A systolic algorithm for solving dense linear systems ⋮ A fault tolerant systolic mesh for linear system solution ⋮ Implementing stochastic control software on supercomputing machines

This page was built for publication: Parallel Gauss-Jordan elimination for the solution of dense linear systems