Singular value decomposition (SVD) an important part of numerical calculation, widely used in many areas such as biological medicine, meteorology and quantum mechanics. Improving the speed and accuracy of SVD algorith...
详细信息
ISBN:
(纸本)9781509013456
Singular value decomposition (SVD) an important part of numerical calculation, widely used in many areas such as biological medicine, meteorology and quantum mechanics. Improving the speed and accuracy of SVD algorithm becomes an important issue, so we study efficient parallel SVD algorithm on AMD GPU using OpenCL language. In recent years, there are many approaches for SVD hardware computation have been proposed, however, which are limited by speed and we propose an one-sidedjacobi parallel algorithm on AMD Graphics Processing Unit by using OpenCL. In the front part of this paper, SVD algorithm and one-sided jacobi algorithm are introduced and by using the Ring jacobi Ordering we achieve our parallelism computation. The next we give SVD workflow and implement 8x8, 16x16, 32x32, 64x64,128x128 and 256x256 matrices on GPU. By comparing with MATLAB and other paper, our speedups are respective approximately 3.25x and 1.24x.
Singular value decomposition(SVD) an important part of numerical calculation, widely used in many areas such as biological medicine, meteorology and quantum mechanics. Improving the speed and accuracy of SVD algorithm...
详细信息
Singular value decomposition(SVD) an important part of numerical calculation, widely used in many areas such as biological medicine, meteorology and quantum mechanics. Improving the speed and accuracy of SVD algorithm becomes an important issue, so we study efficient parallel SVD algorithm on AMD GPU using OpenC L language. In recent years, there are many approaches for SVD hardware computation have been proposed, however, which are limited by speed and we propose an one-sidedjacobi parallel algorithm on AMD Graphics Processing Unit by using OpenC L. In the front part of this paper, SVD algorithm and one-sided jacobi algorithm are introduced and by using the Ring jacobi Ordering we achieve our parallelism computation. The next we give SVD workflow and implement 8×8, 16×16, 32×32, 64×64,128×128 and 256×256 matrices on GPU. By comparing with MATLAB and other paper, our speedups are respective approximately 3.25× and 1.24×.
A one-sidedjacobi hyperbolic singular value decomposition (HSVD) algorithm, using a massively parallel graphics processing unit (GPU), is developed. The algorithm also serves as the final stage of solving a symmetric...
详细信息
A one-sidedjacobi hyperbolic singular value decomposition (HSVD) algorithm, using a massively parallel graphics processing unit (GPU), is developed. The algorithm also serves as the final stage of solving a symmetric indefinite eigenvalue problem. Numerical testing demonstrates the gains in speed and accuracy over sequential and MPI-parallelized variants of similar jacobi-type HSVD algorithms. Finally, possibilities of hybrid CPU-GPU parallelism are discussed.
An old algorithm for computing the singular value decomposition, which was first mentioned by Hestenes [SIAM J. Appl. Math., 6 (1958), pp. 51–90], has gained renewed interest because of its properties of parallelism ...
详细信息
An old algorithm for computing the singular value decomposition, which was first mentioned by Hestenes [SIAM J. Appl. Math., 6 (1958), pp. 51–90], has gained renewed interest because of its properties of parallelism and vectorizability. Some computational modifications are given and a comparison with the well-known Golub–Reinsch algorithm is made. Comparative experiments on a CYBER 205 are reported.
暂无评论