A Hierarchically Blocked Jacobi SVD Algorithm for Single and Multiple Graphics Processing Units
نویسندگان
چکیده
منابع مشابه
A hierarchically blocked Jacobi SVD algorithm for single and multiple graphics processing units
We present a hierarchically blocked one-sided Jacobi algorithm for the singular value decomposition (SVD), targeting both single and multiple graphics processing units (GPUs). The blocking structure reflects the levels of GPU’s memory hierarchy. The algorithm may outperform MAGMA’s dgesvd, while retaining high relative accuracy. To this end, we developed a family of parallel pivot strategies on...
متن کاملEfficient pre-processing in the parallel block-Jacobi SVD algorithm
One way, how to speed up the computation of the singular value decomposition of a given matrix A ∈ C, m ≥ n, by the parallel two-sided block-Jacobi method, consists of applying some pre-processing steps that would concentrate the Frobenius norm near the diagonal. Such a concentration should hopefully lead to fewer outer parallel iteration steps needed for the convergence of the entire algorithm...
متن کاملMGUPGMA: A Fast UPGMA Algorithm With Multiple Graphics Processing Units Using NCCL
A phylogenetic tree is a visual diagram of the relationship between a set of biological species. The scientists usually use it to analyze many characteristics of the species. The distance-matrix methods, such as Unweighted Pair Group Method with Arithmetic Mean and Neighbor Joining, construct a phylogenetic tree by calculating pairwise genetic distances between taxa. These methods have the comp...
متن کاملPreconditioned Parallel Block-jacobi Svd Algorithm
We show experimentally, that the QR factorization with the complete column pivoting, optionally followed by the LQ factorization of the Rfactor, can lead to a substantial decrease of the number of outer parallel iteration steps in the parallel block-Jacobi SVD algorithm, whereby the details depend on the condition number and on the shape of spectrum, including the multiplicity of singular value...
متن کاملParallel One - Sided Block - Jacobi Svd Algorithm
A new dynamic ordering is presented for the parallel one-sided block Jacobi SVD algorithm. Similarly to the two-sided variant, which has been analyzed and implemented in last 10 years, the dynamic ordering takes into account the actual status of a matrix—this time of its block columns with respect to their mutual orthogonality. Using p processors, in each parallel iteration step the p mostly in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2015
ISSN: 1064-8275,1095-7197
DOI: 10.1137/140952429