## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
R P Brent; Franklin T Luk; Mathematical Sciences Research Centre.; Australian National University. Centre for Mathematical Analysis.; Cornell University. Department of Computer Science. |

OCLC Number: | 10649105 |

Notes: | "TR 83-562." "July 1983." |

Description: | 34 pages ; 28 cm |

Responsibility: | R.P. Brent, F.T. Luk. |

### Abstract:

Parallel Jacobi-like algorithms are presented for computing a singular-value decomposition of an $mxn$ matrix $(m \geq n)$ and an eigenvalue decomposition of an $n x n$ symmetric matrix. A linear array of $O(n)$ processors is proposed for the singular-value problem and the associated algorithm requires time $O(mnS)$, where $S$ is the number of sweeps (typically $S \leq 10)$. A square array of $O(n[superscript]{2})$ processors with nearest-neighbor communication is proposed for the eigenvalue problem; the associated algorithm requires time $O(nS)$.

Key Words And Phrases: Multiprocessor arrays, systolic arrays, singular-value decomposition, eigenvalue decomposition, real symmetric matrices, Hestenes method, Jacobi method, VLSI, real-time computation, parallel algorithms.

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays".
Be the first.