Advantages for solving linear systems in an asynchronous environment

DOI10.1016/0377-0427(85)90028-7zbMath0576.65019OpenAlexW1985895814MaRDI QIDQ1064732

B. George

Publication date: 1985

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(85)90028-7

zbMATH Keywords

parallel computersGauss-Jordan algorithmasynchronous multiprocessor computerMIMDGauss algorithmWZ-algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items (1)

PARALLEL BLOCK METHODS FOR SOLVING LINEAR SYSTEMS

Cites Work

• Unnamed Item
• Optimal Parallel Scheduling of Gaussian Elimination DAG's
• A Computation Model of Parallel Solution of Linear Equations
• A parallel linear system solver
• Solving Linear Algebraic Equations on an MIMD Computer
• On Stable Parallel Linear System Solvers
• A Survey of Parallel Algorithms in Numerical Linear Algebra

This page was built for publication: Advantages for solving linear systems in an asynchronous environment