On a parallel multilevel preconditioned Maxwell eigensolver

  • Authors:

  • Peter Arbenz;Martin Bečka;Roman Geus;Ulrich Hetmaniuk;Tiziano Mengotti

  • Affiliations:

  • Institute of Computational Science, Swiss Federal Institute of Technology (ETH), CH-8092 Zurich, Switzerland;Institute of Computational Science, Swiss Federal Institute of Technology (ETH), CH-8092 Zurich, Switzerland;Paul Scherrer Institut, CH-5232 Villigen PSI, Switzerland;Sandia National Laboratories, Albuquerque, NM 87185-1110, USA2Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Ene ...;Institute of Computational Science, Swiss Federal Institute of Technology (ETH), CH-8092 Zurich, Switzerland

  • Venue:
  • Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We report on a parallel implementation of the Jacobi-Davidson algorithm to compute a few eigenvalues and corresponding eigenvectors of a large real symmetric generalized matrix eigenvalue problemAx=@lMx,C^Tx=0. The eigenvalue problem stems from the design of cavities of particle accelerators. It is obtained by the finite element discretization of the time-harmonic Maxwell equation in weak form by a combination of Nedelec (edge) and Lagrange (node) elements. We found the Jacobi-Davidson (JD) method to be a very effective solver provided that a good preconditioner is available for the correction equations that have to be solved in each step of the JD iteration. The preconditioner of our choice is a combination of a hierarchical basis preconditioner and the ML smoothed aggregation AMG preconditioner. It is close to optimal regarding iteration count. The parallel code makes extensive use of the Trilinos software framework. In our examples from accelerator physics, we observe satisfactory speedups and efficiencies.