Skip to Main Content
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.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.