Abstract
The tridiagonalization of symmetric matrices appears frequently in the solution of mathematical problems. In this paper we present the parallelization of Householder’s method in hypercube computers with distributed memory and messagepassing communications, using a single program-multiple data mode of parallelism. Results for the NCUBE/10 and for a SUPERNODE system, composed of eight transputers T800 interconnected as a hypercube, are included. We have designed a parallel algorithm getting minimum data redundancy (the matrices are symmetric) and a very high computational load balance among the processing elements. © 1992 Taylor & Francis Group, LLC.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
