Robust Parallel Implementation of a Lanczos-based Algorithm for an Structured Electromagnetic Eigenvalue Problem
Main Article Content
Abstract
This paper describes a parallel implementation of a Lanczos-based
method to solve generalised eigenvalue problems related to the
modal computation of arbitrarily shaped waveguides. This efficient
implementation is intended for execution mainly in moderate-low cost
workstations (2 to 4 processors). The problem under study has
several features: the involved matrices are sparse with a certain
structure, and all the eigenvalues needed are contained in a given
interval. The novel parallel algorithms proposed show excellent
speed-up for small number of processors.
method to solve generalised eigenvalue problems related to the
modal computation of arbitrarily shaped waveguides. This efficient
implementation is intended for execution mainly in moderate-low cost
workstations (2 to 4 processors). The problem under study has
several features: the involved matrices are sparse with a certain
structure, and all the eigenvalues needed are contained in a given
interval. The novel parallel algorithms proposed show excellent
speed-up for small number of processors.
Article Details
Issue
Section
Proposal for Special Issue Papers