Chapter

Computational Science – ICCS 2008

Volume 5101 of the series Lecture Notes in Computer Science pp 945-954

Tridiagonalizing Complex Symmetric Matrices in Waveguide Simulations

  • W. N. GanstererAffiliated withResearch Lab Computational Technologies and Applications, University of Vienna
  • , H. SchabauerAffiliated withResearch Lab Computational Technologies and Applications, University of Vienna
  • , C. PacherAffiliated withAustrian Research Centers GmbH - ARC, Smart Systems Division
  • , N. FingerAffiliated withAustrian Research Centers GmbH - ARC, Smart Systems Division

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We discuss a method for solving complex symmetric (non-Hermitian) eigenproblems Ax = λBx arising in an application from optoelectronics, where reduced accuracy requirements provide an opportunity for trading accuracy for performance. In this case, the objective is to exploit the structural symmetry. Consequently, our focus is on a non-Hermitian tridiagonalization process. For solving the resulting complex symmetric tridiagonal problem, a variant of the Lanczos algorithm is used. Based on Fortran implementations of these algorithms, we provide extensive experimental evaluations. Runtimes and numerical accuracy are compared to the standard routine for non-Hermitian eigenproblems, LAPACK/zgeev. Although the performance results reveal that more work is needed in terms of increasing the fraction of Level 3 Blas in our tridiagonalization routine, the numerical accuracy achieved with the non-Hermitian tridiagonalization process is very encouraging and indicates important research directions for this class of eigenproblems.

Keywords

Tridiagonalization complex symmetric eigenvalue problems waveguide simulation optoelectronic