The University of Southampton
University of Southampton Institutional Repository

An Efficient Parallel Version of the Householder-QL Matrix Diagonalisation Algorithm

Reeve, JS and Heath, M (1999) An Efficient Parallel Version of the Householder-QL Matrix Diagonalisation Algorithm Parallel Computing, 25, (3), pp. 311-319.

Record type: Article


In this paper we report an effective parallelisation of the Householder routine for the reduction of a real symmetric matrix to tri-diagonal form and the QL algorithm for the diagonalisation of the resulting matrix. The Householder algorithm scales like $\alpha N^3/P+\beta N^2 \log_2(P)$ and the QL algorithm like $\gamma N^2 + \delta N^3/P$ as the number of processors $P$ is increased for fixed problem size. The constant parameters $\alpha$, $\beta$, $\gamma$ and $\delta$ are obtained empirically. When the eigenvalues only are required the Householder method scales as above while the QL algorithm remains sequential. The code is implemented in c in conjunction with the Message Passing Interface (MPI) libraries and verified on a sixteen node IBM SP2 and for real matrices that occur in the simulation of properties of crystaline materials

Postscript - Other
Download (213kB)

More information

Published date: 1999
Organisations: EEE


Local EPrints ID: 251943
ISSN: 0167-8191
PURE UUID: a3249294-1382-42d0-9686-ffc9a6ac3db7

Catalogue record

Date deposited: 14 Apr 2000
Last modified: 18 Jul 2017 10:07

Export record


Author: JS Reeve
Author: M Heath

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.