The Gautschi time stepping scheme for edge finite element discretizations of the Maxwell equations

被引:12
作者
Botchev, M. A. [1 ]
Harutyunyan, D. [1 ]
van der Vegt, J. J. W. [1 ]
机构
[1] Univ Twente, Dept Appl Math, NL-7500 AE Enschede, Netherlands
关键词
Maxwell equations; Gautschi cosine scheme; dispersion analysis; edge elements; staggered leap frog scheme; Krylov subspace; Arnoldi process;
D O I
10.1016/j.jcp.2006.01.014
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
For the time integration of edge finite element discretizations of the three-dimensional Maxwell equations, we consider the Gautschi cosine scheme where the action of the matrix function is approximated by a Krylov subspace method. First, for the space-discretized edge finite element Maxwell equations, the dispersion error of this scheme is analyzed in detail and compared to that of two conventional schemes. Second, we show that the scheme can be implemented in such a way that a higher accuracy can be achieved within less computational time (as compared to other implicit schemes). We also analyzed the error made in the Krylov subspace matrix function evaluations. Although the new scheme is unconditionally stable, it is explicit in structure: as an explicit scheme, it requires only the solution of linear systems with the mass matrix. (c) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码:654 / 686
页数:33
相关论文
共 41 条
[1]   Dispersive properties of high-order Nedelec/edge element approximation of the time-harmonic Maxwell equations [J].
Ainsworth, M .
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2004, 362 (1816) :471-491
[2]  
Barrett R., 1994, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, V2nd ed.
[3]   Stability control for approximate implicit time stepping schemes with minimum residual iterations [J].
Botchev, MA ;
Sleijpen, GLG ;
van der Vorst, HA .
APPLIED NUMERICAL MATHEMATICS, 1999, 31 (03) :239-253
[4]  
Cohen G., 2002, HIGHER ORDER NUMERIC
[5]   One-step finite-difference time-domain algorithm to solve the Maxwell equations [J].
De Raedt, H ;
Michielsen, K ;
Kole, JS ;
Figge, MT .
PHYSICAL REVIEW E, 2003, 67 (05) :12
[6]   KRYLOV SUBSPACE APPROXIMATION OF EIGENPAIRS AND MATRIX FUNCTIONS IN EXACT AND COMPUTER ARITHMETIC [J].
DRUSKIN, V ;
KNIZHNERMAN, L .
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 1995, 2 (03) :205-217
[7]   Extended Krylov subspaces: Approximation of the matrix square root and related functions [J].
Druskin, V ;
Knizhnerman, L .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1998, 19 (03) :755-771
[8]   2 POLYNOMIAL METHODS OF CALCULATING FUNCTIONS OF SYMMETRICAL MATRICES [J].
DRUSKIN, VL ;
KNIZHNERMAN, LA .
USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1989, 29 (06) :112-121
[9]   Investigation of numerical time-integrations of Maxwell's equations using the staggered grid spatial discretization [J].
Faragó, I ;
Horváth, R ;
Schilders, WHA .
INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS, 2005, 18 (02) :149-169
[10]   A generalized mass lumping technique for vector finite-element solutions of the time-dependent Maxwell equations [J].
Fisher, A ;
Rieben, RN ;
Rodrigue, GH ;
White, DA .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2005, 53 (09) :2900-2910