Metrics
19 File views/ downloads
225 Record Views
Conference paper
Givens and householder reductions for linear least squares on a cluster of workstations
pp.734-739
High performance computing : proceedings of the International Conference on High Performance Computing (HiPC '95) (New Delhi, India, 12/27/1995–12/30/1995)
1995
Abstract
We report on the properties of implementations of fast-Givens rotation and Householder reflector based parallel algorithms for the solution of linear least squares problems on a cluster of workstations. Givens rotations enable communication hiding and take greater advantage of parallelism then Householder reflectors, provided the matrices are sufficiently large.
Details
- Title
- Givens and householder reductions for linear least squares on a cluster of workstations
- Publication Details
- pp.734-739
- Resource Type
- Conference paper
- Conference
- High performance computing : proceedings of the International Conference on High Performance Computing (HiPC '95) (New Delhi, India, 12/27/1995–12/30/1995)
- Publisher
- New Delhi
- Grant note
- Supported in part by the NASA grant NAGW-3888, and UCSB Committee on Research grant 8-562503-19900-7.
- Copyright
- Permission granted to the University of West Florida Libraries to digitize and/or display this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires the permission of the copyright holder.
- Identifiers
- 99380090790706600
- Academic Unit
- Computer Science; Hal Marcus College of Science and Engineering
- Language
- English