A triangular processor array for computing singular values (Q1072344)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A triangular processor array for computing singular values |
scientific article; zbMATH DE number 3942913
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A triangular processor array for computing singular values |
scientific article; zbMATH DE number 3942913 |
Statements
A triangular processor array for computing singular values (English)
0 references
1986
0 references
A triangular processor array for computing the singular values of an \(m\times n\) (m\(\geq n)\) matrix is proposed. A Jacobi-type algorithm is used to first triangularize the given matrix and then diagonalize the resultant triangular form. The requirements are \((1/4)n^ 2+O(n)\) processors and \(O(m+nS)\) time, where S denotes the number of sweeps. The ''triangular'' array can be extended to a ''rectangular'' one with \(mn+O(m)\) processors for the computation of singular vectors.
0 references
QR decomposition
0 references
singular values
0 references
Jacobi-type algorithm
0 references
0 references
0 references
