By Topic

Linear least squares solutions by Householder transformations with column pivoting on a parallel machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
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

Published in:

High Performance Computing on the Information Superhighway, 1997. HPC Asia '97

Date of Conference:

28 Apr-2 May 1997