A triangular processor array for computing singular values (Q1072344): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(86)90171-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981401525 / rank | |||
Normal rank | |||
Revision as of 22:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A triangular processor array for computing singular values |
scientific article |
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
