Linear least squares solutions by Householder transformations with column pivoting on a parallel machine
High Performance Computing and Grid in Asia Pacific Region, International Conference on (1997)
Apr. 28, 1997 to May 2, 1997
Sangback Ma , Dept. of Comput. Sci., Hanyang Univ., Ansan, South Korea
Using Householder transformations to solve linear least squares problems is very efficient. We have found a computational form especially suitable for BBN Butterfly, a parallel computer. We modified the algorithm for parallel processing using various constructs from the BBN Mach 1000 system. We were able to obtain a speed-up of 3 with 4 processors, and 3.83 with 6 processors for M=1000, and N=200, which means Ep=75% and 64% CPU utilization. We conclude that our algorithm realized a reasonably good speedup with a moderate number of processors.
least squares approximations; linear least squares problems; Householder transformations; column pivoting; parallel machine; BBN Butterfly; parallel computer; parallel algorithm; parallel processing; BBN Mach 1000 system; speed-up; CPU utilization; matrices; vectors; shared memory system
Sangback Ma, "Linear least squares solutions by Householder transformations with column pivoting on a parallel machine", High Performance Computing and Grid in Asia Pacific Region, International Conference on, vol. 00, no. , pp. 134, 1997, doi:10.1109/HPC.1997.592136