Parallel Sparse LU Decomposition on a Mesh Network of Transputers
From MaRDI portal
Publication:3136552
DOI10.1137/0614059zbMath0783.65022OpenAlexW1978421859MaRDI QIDQ3136552
Rob H. Bisseling, A. Frank van der Stappen, Johannes G. G. van de Vorst
Publication date: 18 October 1993
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0614059
sparse matrixparallel algorithmsdirect methodtransputer networkdistributed multiprocessor\(LU\) decompositiondistributed-memory multiprocessor
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, The implementation of a generalized cross validation algorithm using deflation techniques for linear systems, Design and Implementation of a Parallel Markowitz Threshold Algorithm, An Arrow-Hurwicz-Uzawa type flow as least squares solver for network linear equations, A survey of direct methods for sparse linear systems, A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\), A new efficient algorithm for computing Gröbner bases \((F_4)\), The impact of high-performance computing in the solution of linear systems: Trends and problems, A parallel interior point algorithm for linear programming on a network of transputers
Uses Software
