Parallel solvers for large eigenvalue problems originating from Maxwell’s equations

Abstract

We present experiments with two new solvers for large sparse symmetric matrix eigenvalue problems: (1) the implicitly restarted Lanczos algorithm and (2) the Jacobi-Davidson algorithm. The eigenvalue problems originate from in the computation of a few of the lowest frequencies of standing electromagnetic waves in cavities that have been discretized by the finite element method. The experiments have been conducted on up to 12 processors of an HP Exemplar X-Class multiprocessor computer.KeywordsNode ElementEdge ElementLarge Problem SizeLanczos AlgorithmRitz VectorThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.