On the cost of sequential and parallel algorithms for solving linear system of equations

DOI10.1080/00207160008804950zbMath0955.65016OpenAlexW1983786656MaRDI QIDQ4955156

Salman H. Abbas

Publication date: 25 May 2000

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

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

zbMATH Keywords

algorithmsnumerical examplesparallel computationLU-decompositionmultitaskingMIMD machineforward and backward substitutionssequence balance machine

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items (2)

Parallel solution of linear system of equations using a column oriented approach ⋮ A parallel implementation of Wang's method for solving tridiagonal systems

Cites Work

• The ijk forms of factorization methods. II: Parallel systems
• On the performance of transputer networks for solving linear systems of equations
• $LU$ Factorization Algorithms on Distributed-Memory Multiprocessor Architectures
• A New Variant of Gaussian Elimination
• On Stable Parallel Linear System Solvers

This page was built for publication: On the cost of sequential and parallel algorithms for solving linear system of equations