NEW ACCURATE ALGORITHMS FOR SINGULAR VALUE DECOMPOSITION OF MATRIX TRIPLETS.

This paper presents a new algorithm for accurate floating-point computation of the singular value decomposition (SVD) of the product A = B^τSC, where B ∈ R^p×m, C ∈ R^q×n, S ∈ R^p×q, and p ≤ m, q ≤ n. The new algorithm uses diagonal scalings, the LU factorization with complete pivoting, the QR factorization with column pivoting, and matrix multiplication to replace A by A′ = B′^τS′C′, where A and A′ have the same singular values and the matrix A′ is computed explicitly. The singular values of A′ are computed using the Jacobi SVD algorithm. It is shown that the accuracy of the new algorithm is determined by (i) the accuracy of the QR factorizations of B^τ and C^τ; (ii) the accuracy of the LU factorization with complete pivoting of S; and (iii) the accuracy of the computation of the SVD of a matrix A′ with moderate min_D=_diagκ₂(A′D). Theoretical analysis and numerical evidence show that, in the case of rank(B) = rank(C) = p and full rank S, the accuracy of the new algorithm is unaffected by replacing B, S, C with, respectively, D₁B, D₂SD₃, D₄C, where D_i, i = 1,…,4, are arbitrary diagonal matrices. As an application, the paper proposes new accurate algorithms for computing the (H,K)­SVD and (H^-1,K)­SVD of S. [ABSTRACT FROM AUTHOR]