Parallel direct linear system solvers -- a survey
โ Scribed by Ahmed H. Sameh; David J. Kuck
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 510 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper is a survey of direct parallel algorithms for solving systems of linear equations. We present an up-to-date collection of algorithms for solving triangular, dense, and tridiagonal systems of equations.
We state their resulting speedup over the corresponding sequential algorithms, and evaluate their numerical stability, whenever possible.
๐ SIMILAR VOLUMES
This paper presents a parallel mixed direct/iterative method for solving linear systems Ax = b arising from circuit simulation. The systems are solved by a block LU factorization with an iterative method for the Schur complement. The Schur complement is a small and rather dense matrix. Direct LU dec
We propose a hybrid sparse system solver for handling linear systems using algebraic domain decomposition-based techniques. The solver consists of several stages. The first stage uses a reordering scheme that brings as many of the largest matrix elements as possible closest to the main diagonal. Thi
The direct sparse matrix solver is based on a domain decomposition technique to achieve data and work parallelization. Geometries that have long and thin structures are specially efficiently tractable with this solver, provided that they can be decomposed mainly in one direction. Due to the separati