Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems

被引：26

作者：

Arbenz, P ^{[1
]}

Geus, R ^{[1
]}

机构：

[1] ETH, Inst Computat Sci, CH-8092 Zurich, Switzerland

来源：

APPLIED NUMERICAL MATHEMATICS | 2005年 / 54卷 / 02期

关键词：

Maxwell equation; generalized eigenvalue problem; Jacobi-Davidson; LOBPCG; smoothed aggregation AMG preconditioner;

D O I：

10.1016/j.apnum.2004.09.026

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We investigate eigensolvers for computing a few of the smallest eigenvalues of a generalized eigenvalue problem resulting from the finite element discretization of the time independent Maxwell equation. Various multilevel preconditioners are employed to improve the convergence and memory consumption of the Jacobi-Davidson algorithm and of the locally optimal block preconditioned conjugate gradient (LOBPCG) method. We present numerical results of very large eigenvalue problems originating from the design of resonant cavities of particle accelerators. (c) 2004 IMACS. Published by Elsevier B.V. All rights reserved.

引用

页码：107 / 121

页数：15

共 33 条

[1]

[Anonymous], 1997, ARPACK Users' Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods, DOI 10.1137/1.9780898719628

[2]

Arbenz P, 2001, PHYS REV SPEC TOP-AC, V4, DOI [10.1103/PhysRevSTAB.4.022001, 10.1103/PhysRevSTAB4.022001]

[3]

Arbenz P, 1999, NUMER LINEAR ALGEBR, V6, P3, DOI 10.1002/(SICI)1099-1506(199901/02)6:1<3::AID-NLA142>3.0.CO

[4]

2-I

[5]

Bai Z., 2000, TEMPLATES SOLUTION A, DOI DOI 10.1137/1.9780898719581

[6] Implicit memory .2. Introduction [J].