Parallel real-world LU decomposition: Gauss vs. Crout algorithm
نویسندگان
چکیده
منابع مشابه
The Gauss-Huard algorithm and LU factorization
In this paper we analyze the Gauss-Huard algorithm. From a description of the algorithm in terms of matrix-vector operations we reveal a close relation between the Gauss-Huard algorithm and an LU factorization as constructed in an ikj variant.
متن کاملParallel LU Decomposition on a Transputer Network
A parallel algorithm is derived for LU decomposition with partial pivoting on a local-memory multiprocessor. A general Cartesian data distribution scheme is presented which contains many of the existing distribution schemes as special cases. This scheme is used to prove optimality of toad balance for the grid distribution. Experimental results of an implementation of the algorithm in occam-2 on...
متن کاملAn Improved Algorithm for Parallel Sparse LU Decomposition on a Distributed Memory Multiprocessor
In this paper we present a new parallel algorithm for the LU decomposition of a general sparse matrix Among its features are matrix redistribution at regular intervals and a dynamic pivot search strategy that adapts itself to the number of pivots produced Experimental results obtained on a network of transputers show that these features considerably improve the performance
متن کاملSequential Performance Versus Scalability: Optimizing Parallel LU-Decomposition
High e cient implementations of parallel algorithms need high e cient sequential kernels. Therefore, libraries like BLAS are successfully used in many numerical applications. In this paper we show the tradeo between the performance of these kernels and the scalability of parallel applications. It turns out that the fastest routine on a single node does not necessarily lead to the fastest parall...
متن کاملLU-Decomposition on a Massively Parallel Transputer System
Two algorithms for LU{decomposition on a transputer based reconngurable MIMD parallel computer with distributed memory have been analyzed in view of the interdependence of granularity and execution time. In order to investigate this experimentally, LU{decomposition algorithms have been implemented on a parallel computer, the Parsytec SuperCluster 128. The results of this investigation may be su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Computer Science
سال: 2018
ISSN: 2299-1093
DOI: 10.1515/comp-2018-0020