Solution of the Complete Symmetric Eigenproblem in a Virtual Memory Environment

Algorithms for the complete symmetric eigenproblem are studied from the viewpoint of performance in a virtual memory environment. The preferred algorithm is based on tridiagonalization and the implicit QR algorithms. Implementation factors that affect execution time are discussed.