Parallel real-world LU decomposition: Gauss vs. Crout algorithm
This paper presents numerical experiments with assorted versions of parallel LU matrix decomposition algorithms (Gauss and Crout algorithm). The tests have been carried out on the hardware platform with fourcore Skylake processor featuring hyperthreading technology doubling virtually core number. Pa...
Main Author: | Stabrowski Marek |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2018-12-01
|
Series: | Open Computer Science |
Subjects: | |
Online Access: | https://doi.org/10.1515/comp-2018-0020 |
Similar Items
-
Analysis of Crout, Lu, Cholesky Decomposition, and QR Factorization: A Case Study On The Relationship Between Abiotic (Carbon and Nitrogen) and Biotic (Macrobenthos Diversity) Factors
by: Widowati Widowati
Published: (2014-08-01) -
A robust LU polynomial matrix decomposition for spatial multiplexing
by: Moustapha Mbaye, et al.
Published: (2020-11-01) -
Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks
by: Chunhui Zhao, et al.
Published: (2015-09-01) -
Parallel Power Flow Computation Trends and Applications: A Review Focusing on GPU
by: Dong-Hee Yoon, et al.
Published: (2020-05-01) -
Factorizations related to some numerical triangles
by: Prodinger Helmut
Published: (2017-11-01)