Parallel Gaussian elimination on an MIMD computer

DOI10.1016/0167-8191(88)90070-1zbMath0634.65017OpenAlexW2004058992MaRDI QIDQ1096997

Yves Robert, Mounir Marrakchi, Denis Trystram, Michel Cosnard

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90070-1

zbMATH Keywords

computational complexityGaussian eliminationparallel algorithmsMIMD computerasymptotic performancesparallel Gaussian-like triangularization algorithmstask graph models

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (13)

A parallel gaussian elimination method for general linear systems ⋮ Applying abstraction and formal specification in numerical software design ⋮ PARALLEL BLOCK METHODS FOR SOLVING LINEAR SYSTEMS ⋮ Systolic algorithm for the solution of dense linear equations ⋮ ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems ⋮ A complex structure-preserving algorithm for split quaternion matrix \textit{LDU} decomposition In split quaternion mechanics ⋮ Implementing stochastic control software on supercomputing machines ⋮ A new presentation of the conjugate direction algorithm ⋮ Minimizing the schedule length for a parallel 3D-grid precedence graph ⋮ Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors ⋮ An optimal schedule for Gaussian elimination on an MIMD architecture ⋮ A complex structure-preserving algorithm for the full rank decomposition of quaternion matrices and its applications ⋮ A parallel continuation algorithm for nonlinear eigenvalue problems

This page was built for publication: Parallel Gaussian elimination on an MIMD computer