Computing the singular value decomposition on a distributed system of vector processors
type: Item
instance of: scholarly article
title: Computing the singular value decomposition on a distributed system of vector processors
zbMATH Open document ID: 0676.65029
DOI: 10.1016/0167-8191(89)90027-6
author: Christian H. Bischof
published in: Parallel Computing
publication date: 1989-01-01T00:00:00Z
full work available at URL: https://hdl.handle.net/1813/6709
review text: The two-sided Jacobi algorithm of \textit{G. E. Forsythe} and \textit{P. Henrici} [Trans. Am. Math. Soc. 94, 1-23 (1960; Zbl 0092.325)] is implemented on a LCAP system consisting of a ring of vector processors. Two block versions are compared on a series of random test matrices, and it is demonstrated that the computation is nearly perfectly sped up turning the speed of the subproblem solver into the decisive factor.
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4108019
zbMATH Keywords: singular value decomposition
zbMATH Keywords: two-sided Jacobi algorithm
zbMATH Keywords: vector processors
reviewed by: Axel Ruhe
MaRDI profile type: Publication
OpenAlex ID: W2042123940
description: scientific article; zbMATH DE number 4108019