Multitasking the Householder Diagonalization Algorithm on the CRAY X-MP/48

  • K. A. Berrington


In a previous lecture (computational implementation of the R—matrix method in atomic and molecular collision problems) it was mentioned that an important part of the computation in solving collision problems by R—matrix techniques was the diagonalization of the internal-region Hamiltonian matrices. These matrices are usually real, symmetric and dense (ii.e. non—sparse). All eigenvalues and eigenvectors are required to define the R—matrix. the matrices can be of various sizes, up to an order of a few thousand square.


Nest Loop Collision Problem Fast Memory Triangle Form Hamiltonian Matrice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Berrington, K.A., Burke, P.G., Le Dourneuf M, Robb, W.D., Taylor, K.T. and Vo Ky Lan, 1978, Comp. Phys. Commun. 14, 367.CrossRefGoogle Scholar
  2. Gourlay, A.R. and Watson, G.A., 1973, Computational methods for matrix eigenproblems. Wiley & Sons.Google Scholar
  3. Householder, A.S. and Bauer, F.L., 1959, Numerische Math. 1 Band 1. Heft, p29.Google Scholar
  4. Ralston, A. and Wilf, H.S., 1967, Mathematical methods for digital computers. II Wiley & Sons.Google Scholar
  5. Sawey, M. and Berrington, K.A., 1989, Comp. Phys. Commun.: submitted.Google Scholar
  6. Wilkinson, J.H. 1960, Computer J. 3, 23.CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1990

Authors and Affiliations

  • K. A. Berrington
    • 1
  1. 1.Department of Applied Mathematics and Theoretical PhysicsQueen’s University BelfastUK

Personalised recommendations