
doi: 10.3390/math13020298
MATLAB programing language is one of the most popular scientific computing tools, especially for solving linear algebra problems. LU factorization is an essential component for the direct solution of linear equations systems. This paper studied a coarse-grained column agglomeration parallel algorithm in MATLAB to analyze the implementation performance among all the available computation resources. In this paper, we focus on parallelizing the LU decomposition without pivoting algorithm using Gaussian elimination under MATLAB R2020b platform. Numerical experiments were provided to demonstrate the efficiency of CPU parallelization. Performances of the present methods were assessed by comparing the speed and accuracy of different coarse-grained column agglomeration algorithms using different sizes of matrices. Different algorithms were implemented in a four-core Xeon E3-1220 v3 @ 3.10 GHz CPU with 16 GB RAM memory.
coarse-grained column agglomeration, parallel MATLAB, high-level languages, QA1-939, Mathematics
coarse-grained column agglomeration, parallel MATLAB, high-level languages, QA1-939, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
