Parallel algorithms for solving large linear systems
DOI10.1016/0377-0427(94)90302-6zbMath0808.65020OpenAlexW2083898199MaRDI QIDQ1334766
T. J. Dekker, Walter Hoffmann, Kitty Potma
Publication date: 22 September 1994
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(94)90302-6
parallel algorithmssurvey paperparallelizationdirect methodsdistributed memory parallel computersGauss-Jordan methodEnright methodHuard methodlarge dense linear systems
Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (5)
Uses Software
Cites Work
- Solving linear systems on a vector computer
- Rehabilitation of the Gauss-Jordan algorithm
- On the performance of transputer networks for solving linear systems of equations
- Monitoring the numerical stability of Gaussian elimination
- Iterated Runge–Kutta Methods on Parallel Computers
- Average-Case Stability of Gaussian Elimination
- Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs
- Error Analysis of Direct Methods of Matrix Inversion
- Parallel Computers 2
- On the stability of Gauss-Jordan elimination with pivoting
- Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
- Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
- Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parallel algorithms for solving large linear systems