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 , 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...

Full description

Bibliographic Details

Published in:	Parallel computing Vol. 32; no. 2; pp. 166 - 176
Main Authors:	Okša, Gabriel, Vajteršic, Marián
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2006
Subjects:	Cluster of personal computers LQ factorization Message passing interface Parallel computation QR factorization with column pivoting Singular value decomposition Two-sided block-Jacobi method QR factorization with column pivoting LQ factorization Message passing interface Two-sided block-Jacobi method Parallel computation Cluster of personal computers Singular value decomposition
ISSN:	0167-8191, 1872-7336
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!