Fast eigensolver for dense real-symmetric matrices

Published: 15 July 2001| Version 1 | DOI: 10.17632/34rmn7tnfx.1
Carlos F. Bunge


Abstract A new eigensolver for dense real-symmetric matrices resulting from upgrading and combining previous programs is tested for matrices of orders 100 to 2000 on Cray YMP, Pentium, Mips R1×000 and Dec Alpha 21×64 single processors. Comparisons of execution times with the latest versions (November 1999) of LAPACK routines are quite favorable, by a factor of two in most cases, while requiring only one half as much memory and no special installation. Title of program: HQRII1 Catalogue Id: ADOP_v1_0 Nature of problem Solving eigenproblems is a widespread technique in engineering and basic sciences, as manifested by more than 400 paper titles carrying the word eigenvalue or eigenvector in the last two years. Versions of this program held in the CPC repository in Mendeley Data ADOP_v1_0; HQRII1; 10.1016/S0010-4655(01)00215-6 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Computational Physics, Computational Method