engleski

Batched Computation of the Singular Value Decompositions of Order Two by the AVX-512 Vectorization

In this paper a vectorized algorithm for simultaneously computing up to eight singular value decompositions (SVDs, each of the form A = U ∑ V*) of real or complex matrices of order two is proposed. The algorithm extends to a batch of matrices of an arbitrary length n, that arises, for example, in the annihilation part of the parallel Kogbetliantz algorithm for the SVD of matrices of order 2n. The SVD method for a single matrix of order two is derived first. It scales, in most instances error-free, the input matrix A such that the scaled singular values cannot overflow whenever the elements of A are finite, and then computes the URV factorization of the scaled matrix, followed by the SVD of the non-negative upper triangular middle factor. A vector-friendly data layout for the batch is then introduced, where the same-indexed elements of each of the input and the output matrices form vectors, and the algorithm's steps over such vectors are described. The vectorized approach is shown to be about three times faster than processing each matrix in the batch separately, while slightly improving accuracy over the straightforward method for the 2 × 2 SVD.

batched computation ; singular value decomposition ; AVX-512 vectorization

Rad je prihvaćen 14.09.2020. i objavljen online 07.01.2021.