Energy-conserved splitting FDTD methods for Maxwell’s equations

In this paper, two new energy-conserved splitting methods (EC-S-FDTDI and EC-S-FDTDII) for Maxwell’s equations in two dimensions are proposed. Both algorithms are energy-conserved, unconditionally stable and can be computed efficiently. The convergence results are analyzed based on the energy method, which show that the EC-S-FDTDI scheme is of first order in time and of second order in space, and the EC-S-FDTDII scheme is of second order both in time and space. We also obtain two identities of the discrete divergence of electric fields for these two schemes. For the EC-S-FDTDII scheme, we prove that the discrete divergence is of first order to approximate the exact divergence condition. Numerical dispersion analysis shows that these two schemes are non-dissipative. Numerical experiments confirm well the theoretical analysis results.     

Overlapping Schwarz methods for Maxwell's equations in three dimensions

Summary. A two-level overlapping Schwarz method is considered for a Nédélec finite element approximation of 3D Maxwell's equations. For a fixed relative overlap, the condition number of the method is bounded, independently of the mesh size of the triangulation and the number of subregions. Our results are obtained with the assumption that the coarse triangulation is quasi-uniform and, for the Dirichlet problem, that the domain is convex. Our work generalizes well–known results for conforming finite elements for second order elliptic scalar equations. Numerical results for one and two-level algorithms are also presented. Received November 11, 1997 / Revised version received May 26, 1999 / Published online June 21, 2000     

Galerkin methods for nonlinear Sobolev equations

Summary We study Galerkin approximations to the solution of nonlinear Sobolev equations with homogeneous Dirichlet boundary condition in two spatial dimensions and derive optimalL ² error estimates for the continuous Crank — Nicolson and Extrapolated Crank — Nicolson approximations.     

Dimension splitting for evolution equations

In this paper, we are concerned with splitting methods for the time integration of abstract evolution equations. We introduce an analytic framework which allows us to prove optimal convergence orders for various splitting methods, including the Lie and Peaceman–Rachford splittings. Our setting is applicable for a wide variety of linear equations and their dimension splittings. In particular, we analyze parabolic problems with Dirichlet boundary conditions, as well as degenerate equations on bounded domains. We further illustrate our theoretical results with a set of numerical experiments. This work was supported by the Austrian Science Fund under grant M961-N13.     

Quadratic spline collocation methods for elliptic partial differential equations

We consider Quadratic Spline Collocation (QSC) methods for linear second order elliptic Partial Differential Equations (PDEs). The standard formulation of these methods leads to non-optimal approximations. In order to derive optimal QSC approximations, high order perturbations of the PDE problem are generated. These perturbations can be applied either to the PDE problem operators or to the right sides, thus leading to two different formulations of optimal QSC methods. The convergence properties of the QSC methods are studied. OptimalO(h ^3–j ) global error estimates for thejth partial derivative are obtained for a certain class of problems. Moreover,O(h ^4–j ) error bounds for thejth partial derivative are obtained at certain sets of points. Results from numerical experiments verify the theoretical behaviour of the QSC methods. Performance results also show that the QSC methods are very effective from the computational point of view. They have been implemented efficiently on parallel machines.This research was supported in part by David Ross Foundation (U.S.A) and NSERC (Natural Sciences and Engineering Research Council of Canada).     

Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations

Summary We discuss block matrices of the formA=[A _ij ], whereA _ij is ak×k symmetric matrix,A _ij is positive definite andA _ij is negative semidefinite. These matrices are natural block-generalizations of Z-matrices and M-matrices. Matrices of this type arise in the numerical solution of Euler equations in fluid flow computations. We discuss properties of these matrices, in particular we prove convergence of block iterative methods for linear systems with such system matrices.     

Optimal error estimation for Petrov-Galerkin methods in two dimensions

Summary We examine the optimality of conforming Petrov-Galerkin approximations for the linear convection-diffusion equation in two dimensions. Our analysis is based on the Riesz representation theorem and it provides an optimal error estimate involving the smallest possible constantC. It also identifies an optimal test space, for any choice of consistent norm, as that whose image under the Riesz representation operator is the trial space. By using the Helmholtz decomposition of the Hilbert space [L ²()]², we produce a construction for the constantC in which the Riesz representation operator is not required explicitly. We apply the technique to the analysis of the Galerkin approximation and of an upwind finite element method.     

Analysis of a splitting method for incompressible inviscid rotational flow problems

This paper is devoted to analyze a splitting method for solving incompressible inviscid rotational flows. The problem is first recast into the velocity–vorticity–pressure formulation by introducing the additional vorticity variable, and then split into three consecutive subsystems. For each subsystem, the L²$L^2$ least-squares finite element approach is applied to attain accurate numerical solutions. We show that for each time step this splitting least-squares approach exhibits an optimal rate of convergence in the H¹$H^1$ norm for velocity and pressure, and a suboptimal rate in the L²$L^2$ norm for vorticity. A numerical example in two dimensions is presented, which confirms the theoretical error estimates.     

Boundary element methods for Maxwell's equations on non-smooth domains

Summary. Variational boundary integral equations for Maxwell's equations on Lipschitz surfaces in are derived and their well-posedness in the appropriate trace spaces is established. An equivalent, stable mixed reformulation of the system of integral equations is obtained which admits discretization by Galerkin boundary elements based on standard spaces. On polyhedral surfaces, quasioptimal asymptotic convergence of these Galerkin boundary element methods is proved. A sharp regularity result for the surface multipliers on polyhedral boundaries with plane faces is established. Received January 5, 2001 / Revised version received August 6, 2001 / Published online December 18, 2001 Correspondence to: C. Schwab     

An explicit fourth-order staggered finite-difference time-domain method for Maxwell's equations

A new explicit fourth-order accurate staggered finite-difference time-domain (FDTD) scheme is proposed and applied to electromagnetic wave problems. It is fourth-order accurate in both space and time, conditionally stable, and highly efficient (with respect to Yee's scheme) and still retains much of the original simplicity of Yee's scheme. Both extension to perfectly matched layers and modification to deal with dielectric interfaces and perfectly conducting boundaries of the scheme have also been presented. Numerical examples are shown to illustrate the efficiency of the method.     

Defect-based local error estimators for splitting methods,with application to Schrödinger equations,Part I: The linear case

We introduce a defect correction principle for exponential operator splitting methods applied to time-dependent linear Schrödinger equations and construct a posteriori local error estimators for the Lie–Trotter and Strang splitting methods. Under natural commutator bounds on the involved operators we prove asymptotical correctness of the local error estimators, and along the way recover the known a priori convergence bounds. Numerical examples illustrate the theoretical local and global error estimates.     

ADI preconditioned Krylov methods for large Lyapunov matrix equations

In the present paper, we propose preconditioned Krylov methods for solving large Lyapunov matrix equations AX+XA^T+BB^T=0. Such problems appear in control theory, model reduction, circuit simulation and others. Using the Alternating Direction Implicit (ADI) iteration method, we transform the original Lyapunov equation to an equivalent symmetric Stein equation depending on some ADI parameters. We then define the Smith and the low rank ADI preconditioners. To solve the obtained Stein matrix equation, we apply the global Arnoldi method and get low rank approximate solutions. We give some theoretical results and report numerical tests to show the effectiveness of the proposed approaches.     

Accelerated monotone iterative methods for finite difference equations of reaction-diffusion

This paper is concerned with numerical methods for a finite difference system of reaction-diffusion-convection equation under nonlinear boundary condition. Various monotone iterative methods are presented, and each of these methods leads to an existence-comparison theorem as well as a computational algorithm for numerical solutions. The monotone property of the iterations gives improved upper and lower bounds of the solution in each iteration, and the rate of convergence of the iterations is either quadratic or nearly quadratic depending on the property of the nonlinear function. Application is given to a model problem from chemical engineering, and some numerical results, including a test problem with known analytical solution, are presented to illustrate the various rates of convergence of the iterations. Received November 2, 1995 / Revised version received February 10, 1997     

Finite element methods for semilinear elliptic stochastic partial differential equations

We study finite element methods for semilinear stochastic partial differential equations. Error estimates are established. Numerical examples are also presented to examine our theoretical results. This research is supported by Air Force Office of Scientific Research under the grant number FA9550-05-1-0133 and 985 Project of Jilin University.     

An iterative substructuring method for Maxwell's equations in two dimensions

Iterative substructuring methods, also known as Schur complement methods, form an important family of domain decomposition algorithms. They are preconditioned conjugate gradient methods where solvers on local subregions and a solver on a coarse mesh are used to construct the preconditioner. For conforming finite element approximations of , it is known that the number of conjugate gradient steps required to reduce the residual norm by a fixed factor is independent of the number of substructures, and that it grows only as the logarithm of the dimension of the local problem associated with an individual substructure. In this paper, the same result is established for similar iterative methods for low-order Nédélec finite elements, which approximate in two dimensions. Results of numerical experiments are also provided.

     

Multilevel methods for mixed finite elements in three dimensions

In this paper we consider second order scalar elliptic boundary value problems posed over three–dimensional domains and their discretization by means of mixed Raviart–Thomas finite elements [18]. This leads to saddle point problems featuring a discrete flux vector field as additional unknown. Following Ewing and Wang [26], the proposed solution procedure is based on splitting the flux into divergence free components and a remainder. It leads to a variational problem involving solenoidal Raviart–Thomas vector fields. A fast iterative solution method for this problem is presented. It exploits the representation of divergence free vector fields as s of the –conforming finite element functions introduced by Nédélec [43]. We show that a nodal multilevel splitting of these finite element spaces gives rise to an optimal preconditioner for the solenoidal variational problem: Duality techniques in quotient spaces and modern algebraic multigrid theory [50, 10, 31] are the main tools for the proof. Received November 4, 1996 / Revised version received February 2, 1998     

Fully discrete finite element approaches for time-dependent Maxwell's equations

A fully discrete finite element method is used to approximate the electric field equation derived from time-dependent Maxwell's equations in three dimensional polyhedral domains. Optimal energy-norm error estimates are achieved for general Lipschitz polyhedral domains. Optimal -norm error estimates are obtained for convex polyhedral domains. Received February 3, 1997 / Revised version received February 27, 1998     

A numerical scheme for the Maxwell equations in the quasi-static regime with a non-local source

In this paper we study a non-linear evolution equation, based on quasi-static electromagnetic fields, with a non-local field-dependent source. This model occurs in transformer driven active magnetic shielding. We present a numerical scheme for both time and space discretization and prove convergence of this scheme. We also derive the corresponding error estimates.     

Development of discontinuous Galerkin methods for Maxwell’s equations in metamaterials and perfectly matched layers

The discontinuous Galerkin method has proved to be an accurate and efficient way to numerically solve many differential equations. In this paper, we extend this method to solve the time-dependent Maxwell’s equations when metamaterials and perfectly matched layers are involved. Numerical results are presented to demonstrate that our method is not only simple to implement, but also quite effective in solving Maxwell’s equations in complex media.     

Block-iterative methods for consistent and inconsistent linear equations

Summary We shall in this paper consider the problem of computing a generalized solution of a given linear system of equations. The matrix will be partitioned by blocks of rows or blocks of columns. The generalized inverses of the blocks are then used as data to Jacobi- and SOR-types of iterative schemes. It is shown that the methods based on partitioning by rows converge towards the minimum norm solution of a consistent linear system. The column methods converge towards a least squares solution of a given system. For the case with two blocks explicit expressions for the optimal values of the iteration parameters are obtained. Finally an application is given to the linear system that arises from reconstruction of a two-dimensional object by its one-dimensional projections.