Solution of the complete symmetric eigenproblem in a virtual memory environment

Authors:
A. A. Dubrulle
Affiliations:
IBM Data Processin Division Development Center, Palo Alto, California
Venue:
IBM Journal of Research and Development
Year:
1972

Citing 2
Cited 1

The algebraic eigenvalue problem

The algebraic eigenvalue problem
Matrix computations with Fortran and paging

Communications of the ACM

On the Paging Performance of Array Algorithms

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.