Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Execution Time of Symmetric Eigensolvers

Kendall Swenson Stanley

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-99-1039
1997

http://www.eecs.berkeley.edu/Pubs/TechRpts/1999/CSD-99-1039.pdf

The execution time of a symmetric eigendecomposition depends upon the application, the algorithm, the implementation, and the computer. Symmetric eigensolvers are used in a variety of applications, and the requirements of the eigensolver vary from application to application. Many different algorithms can be used to perform a symmetric eigendecompostion, each with differing computational properties. Different implementations of the same algorithm may also have greatly differing computational properties. The computer on which the eigensolver is run not only affects execution time but may favor certain algorithms and implementations over others.

This thesis explains the performance of the ScaLAPACK symmetric eigensolver, the algorithms that it uses, and other important algorithms for solving the symmetric eigenproblem on today's fastest computers. We offer advice on how to pick the best eigensolver for particular situations and propose a design for the next ScaLAPACK symmetric eigensolver which will offer greater flexibility and 50% better performance.


BibTeX citation:

@techreport{Stanley:CSD-99-1039,
    Author = {Stanley, Kendall Swenson},
    Title = {Execution Time of Symmetric Eigensolvers},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1997},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1997/5365.html},
    Number = {UCB/CSD-99-1039},
    Abstract = {The execution time of a symmetric eigendecomposition depends upon the application, the algorithm, the implementation, and the computer. Symmetric eigensolvers are used in a variety of applications, and the requirements of the eigensolver vary from application to application. Many different algorithms can be used to perform a symmetric eigendecompostion, each with differing computational properties.  Different implementations of the same algorithm may also have greatly differing computational properties.  The computer on which the eigensolver is run not only affects execution time but may favor certain algorithms and implementations over others. <p>This thesis explains the performance of the ScaLAPACK symmetric eigensolver, the algorithms that it uses, and other important algorithms for solving the symmetric eigenproblem on today's fastest computers.  We offer advice on how to pick the best eigensolver for particular situations and propose a design for the next ScaLAPACK symmetric eigensolver which will offer greater flexibility and 50% better performance.}
}

EndNote citation:

%0 Report
%A Stanley, Kendall Swenson
%T Execution Time of Symmetric Eigensolvers
%I EECS Department, University of California, Berkeley
%D 1997
%@ UCB/CSD-99-1039
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1997/5365.html
%F Stanley:CSD-99-1039