Parallel symmetric eigenvalue problem solvers

<p>Sparse symmetric eigenvalue problems arise in many computational science and engineering applications: in structural mechanics, nanoelectronics, and spectral reordering, for example. Often, the large size of these problems requires the development of eigensolvers that scale well on parallel computing platforms. In this dissertation, we describe two such eigensolvers, TraceMin and TraceMin-Davidson. These methods are different from many other eigensolvers in that they do not require accurate linear solves to be performed at each iteration in order to find the smallest eigenvalues and their associated eigenvectors. After introducing these closely related eigensolvers, we discuss alternative methods for solving the saddle point problems arising at each iteration, which can improve the overall running time. Additionally, we present TraceMin-Multisectioning, a new TraceMin implementation geared towards finding large numbers of eigenpairs in any given interval of the spectrum. We conclude with numerical experiments comparing our trace-minimization solvers to other popular eigensolvers (such as Krylov-Schur, LOBPCG, Jacobi-Davidson, and FEAST), establishing the competitiveness of our methods.</p>

Name thesis:degree_name

Doctor of Philosophy (PhD)

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Year

2015

Author dc:creator

• Klinvex, Alicia Marie

Contributors dc:contributor

• Ahmed Sameh
• Ananth Grama
• Alex Pothen
• Robert Skeel
• Rudolf Eigenmann

• Computer Sciences
• Mathematics

Repository record dc:identifier

https://docs.lib.purdue.edu/open_access_dissertations/489

OAI identifier oai:identifier

oai:docs.lib.purdue.edu:open_access_dissertations-1387