Weighted Regularization of Maxwell Equations Computations in Curvilinear Polygons

Similar documents
Standard Finite Elements and Weighted Regularization

Institut de Recherche MAthématique de Rennes

Problems of Corner Singularities

Corner Singularities

Nedelec elements for computational electromagnetics

Transformation of corner singularities in presence of small or large parameters

Inequalities of Babuška-Aziz and Friedrichs-Velte for differential forms

A Multigrid Method for Two Dimensional Maxwell Interface Problems

A Remark on the Regularity of Solutions of Maxwell s Equations on Lipschitz Domains

Multigrid Methods for Maxwell s Equations

1. Fast Solvers and Schwarz Preconditioners for Spectral Nédélec Elements for a Model Problem in H(curl)

From the Boundary Element Domain Decomposition Methods to Local Trefftz Finite Element Methods on Polyhedral Meshes

Domain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions

From the Boundary Element DDM to local Trefftz Finite Element Methods on Polyhedral Meshes

Local discontinuous Galerkin methods for elliptic problems

SCHRIFTENREIHE DER FAKULTÄT FÜR MATHEMATIK. On Maxwell s and Poincaré s Constants. Dirk Pauly SM-UDE

Numerical approximation of output functionals for Maxwell equations

Invertibility of the biharmonic single layer potential operator

Numerische Mathematik

On the Maxwell Constants in 3D

Chapter 1 Mathematical Foundations

Superconductivity in domains with corners

A posteriori error estimates for a Maxwell type problem

Mixed Finite Elements Method

Finite element approximation on quadrilateral meshes

Basics and some applications of the mortar element method

Scattering of electromagnetic waves by thin high contrast dielectrics II: asymptotics of the electric field and a method for inversion.

Overlapping Schwarz Preconditioners for Spectral. Problem in H(curl)

A very short introduction to the Finite Element Method

A Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions

A FV Scheme for Maxwell s equations

HIGHER ORDER FINITE-ELEMENT MODELLING FOR CURVED INTERFACE PROBLEMS BASED ON STRAIGHT- EDGED N-SIMPLEXES AND POLYNOMIAL ALGEBRA

EXISTENCE AND REGULARITY OF SOLUTIONS FOR STOKES SYSTEMS WITH NON-SMOOTH BOUNDARY DATA IN A POLYHEDRON

Lecture 2. Introduction to FEM. What it is? What we are solving? Potential formulation Why? Boundary conditions

A Balancing Algorithm for Mortar Methods

Volume and surface integral equations for electromagnetic scattering by a dielectric body

Scientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1

A note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations

A High-Order Nodal Finite Element Formulation for Microwave Engineering

Mimetic Finite Difference methods

c 2008 Society for Industrial and Applied Mathematics

A NONCONFORMING PENALTY METHOD FOR A TWO DIMENSIONAL CURL-CURL PROBLEM

Mixed Finite Element Method for 2D Vector Maxwell s Eigenvalue Problem in Anisotropic Media

A priori error analysis of the BEM with graded meshes for the electric eld integral equation on polyhedral surfaces

A Balancing Algorithm for Mortar Methods

H(div) and H(curl)-conforming Virtual Element Methods

Anisotropic mesh refinement in polyhedral domains: error estimates with data in L 2 (Ω)

Scientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1

Explicit kernel-split panel-based Nyström schemes for planar or axisymmetric Helmholtz problems

An introduction to Isogeometric Analysis

MULTIGRID METHODS FOR MAXWELL S EQUATIONS

Graded Mesh Refinement and Error Estimates of Higher Order for DGFE-solutions of Elliptic Boundary Value Problems in Polygons

MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* Dedicated to Professor Jim Douglas, Jr. on the occasion of his seventieth birthday.

A u + b u + cu = f in Ω, (1.1)

R T (u H )v + (2.1) J S (u H )v v V, T (2.2) (2.3) H S J S (u H ) 2 L 2 (S). S T

field using second order edge elements in 3D

Finite Element Method (FEM)

Key words. Incompressible magnetohydrodynamics, mixed finite element methods, discontinuous Galerkin methods

Numerical analysis of problems in electromagnetism

MATHEMATICS. Course Syllabus. Section A: Linear Algebra. Subject Code: MA. Course Structure. Ordinary Differential Equations

Divergence-conforming multigrid methods for incompressible flow problems

Corner singularities of Maxwell interface and eddy current problems

Adaptive C1 Macroelements for Fourth Order and Divergence-Free Problems

Scientific Computing: Numerical Integration

Chapter 3 Conforming Finite Element Methods 3.1 Foundations Ritz-Galerkin Method

A P4 BUBBLE ENRICHED P3 DIVERGENCE-FREE FINITE ELEMENT ON TRIANGULAR GRIDS

Numerical Solutions to Partial Differential Equations

Basic Concepts of Adaptive Finite Element Methods for Elliptic Boundary Value Problems

Computations of the first eigenpairs for the Schrödinger operator with magnetic field

Static Maxwell Type Problems: Functional A Posteriori Error Estimates and Estimates for the Maxwell Constant in 3D. Dirk Pauly

NEUMANN AND MIXED PROBLEMS ON CURVILINEAR POLYHEDRA

Singularly Perturbed Partial Differential Equations

The Imaging of Anisotropic Media in Inverse Electromagnetic Scattering

LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)

arxiv: v1 [math.na] 8 Feb 2018

Overlapping Schwarz preconditioners for Fekete spectral elements

Simple Examples on Rectangular Domains

Electromagnetic wave propagation. ELEC 041-Modeling and design of electromagnetic systems

Finite Element Methods for Maxwell Equations

Electromagnetic Forces on Parallel Current-

1 Fundamentals. 1.1 Overview. 1.2 Units: Physics 704 Spring 2018

INTRODUCTION TO FINITE ELEMENT METHODS

Some New Elements for the Reissner Mindlin Plate Model

A posteriori error estimation for elliptic problems

Isogeometric modeling of Lorentz detuning in linear particle accelerator cavities

Divergence-free or curl-free finite elements for solving the curl-div system

Technische Universität Graz

A DELTA-REGULARIZATION FINITE ELEMENT METHOD FOR A DOUBLE CURL PROBLEM WITH DIVERGENCE-FREE CONSTRAINT

Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses

arxiv: v1 [math.na] 29 Feb 2016

Technische Universität Graz

Introduction. Finite and Spectral Element Methods Using MATLAB. Second Edition. C. Pozrikidis. University of Massachusetts Amherst, USA

arxiv: v1 [math.na] 11 Jul 2011

Locking in the incompressible limit: pseudo-divergence-free element free Galerkin

A Framework for Analyzing and Constructing Hierarchical-Type A Posteriori Error Estimators

Divergence Boundary Conditions for Vector Helmholtz Equations with Divergence Constraints

High Order Differential Form-Based Elements for the Computation of Electromagnetic Field

Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials

8 A pseudo-spectral solution to the Stokes Problem

Transcription:

Weighted Regularization of Maxwell Equations Computations in Curvilinear Polygons Martin Costabel, Monique Dauge, Daniel Martin and Gregory Vial IRMAR, Université de Rennes, Campus de Beaulieu, Rennes, France dauge@univ-rennes.fr, URL: http://www.maths.univ-rennes.fr/~dauge Maxwell eigenfrequency problem The problem consists in finding the non-zero frequencies ω> such that there exists an electromagnetic field (E, H) solving the equation curl εe iω µh = and curl µh + iω εe = in Ω, () in the cavity Ω. We assume perfect conductor boundary conditions, that is E n = and H n =on Ω, where n denotes the outer unit normal on Ω. Concentrating on the problems posed by the singularities of the boundary of Ω, we assume that the dielectric material filling Ω is homogeneous and isotropic, that is, after a possible change of unknowns ε = µ =. We want to solve () by a Galerkin procedure. The first step is to propose a variational formulation for (). Eliminating H from the equations, we find the formulation E H (curl; Ω), E H (curl; Ω), curl E curl E dx = ω E E dx, () Ω Ω where H (curl; Ω) is the space of L (Ω) fields E with curl E L (Ω) and tangential component E n =on Ω. Testing against gradients of functions ϕ H (Ω) we find that if ω, then div E =. Conversely, any such gradient is a solution of () with ω =. There are two classes of strategies to overcome the difficulties generated by the presence of this big kernel: (i) Discretize () directly by special families of finite elements possessing a discrete derham complex property: these are the edge elements first introduced by Nedelec [, ]. (ii) Regularize () by a term div, div and use more standard elements. Strategy (i) is widely spread but, still, it is worthwhile to develop an alternative, which will have different advantages.

Martin Costabel, Monique Dauge, Daniel Martin and Gregory Vial At first glance, strategy (ii) is a very bad idea if Ω has non-convex corners or edges. The reason for this is now well known: The variational space for the continuous problem is X N = { E H (curl; Ω), div E L (Ω) } () whereas any finite element field which is conforming for the bilinear form curl, curl L + div, div L is continuous across the faces of the elements, therefore belong to the subspace H N X N of H (Ω) fields. But H N is closed in X N for the norm curl L + div L and finally H N X N as soon as Ω has reentrant corners in D and reentrant edges in D. Thus we are in the somewhat unusual situation where the convergence of the Galerkin method does not mean that the limit is the solution of the continuous problem. Weighted regularization In order to overcome this difficulty due to the lack of density, a weighted regularization was proposed in [], that is replacing the regularization term div, div L by the scalar product div, div Y in another functional space Y containing L (Ω) and contained in H (Ω). Such a space can be conveniently realized as a weighted L space, where the weight is a power γ, γ, of a distance function d : x d(x) to the reentrant corners or edges of Ω. The variational space is, instead of () X N [γ] = { E H (curl; Ω), d(x) γ div E L (Ω) } () and the corresponding variational formulation is (with α := γ and s > chosen ad libitum) E X N [γ], E X N [γ], (curl E curl E + sd(x) α div E div E ) dx = ω Ω Ω E E dx. () It is clear that the eigenpairs (E,ω) with ω of () are eigenpairs of (). Any grad ϕ with ϕ H (Ω) is an eigenvector of () with ω =. For problem () also the spurious eigenvectors are gradients grad ϕ with ϕ H (Ω) and d γ ϕ L (Ω): ϕ is such that d γ ϕ is an eigenvector of the self-adjoint operator A[γ] :=d γ d γ with Dirichlet conditions. One can prove Theorem. The eigenpairs (E,ω) of problem () can be split into two types (i) div E =and ω : (E,ω) is then a Maxwell eigenpair. (ii) curl E =and ω = sν with ν and eigenvalue of the operator A[γ]. It is important to know that the spectrum of A[γ] is separated from :

Weighted Regularization of Maxwell Equations Theorem. The eigenvalues of A[γ] decrease when γ increases. For any γ, A[γ] is positive definite. For any γ<, A[γ] has a compact resolvent. From Theorems and we know that the continuous formulation () can be used to determine the Maxwell eigenvalues for any α. Now, we have to investigate whether there exists α so that smooth fields are dense in X N [γ]. The following statement is deduced from [] Theorem. Let Ω be non-convex polygon or a non-convex polyhedron. Then there exists γ Ω < such that for any γ, γ Ω <γ<, the space H N of H vector fields satisfying the electric boundary condition is dense in X N [γ]. If Ω is a polygon, let ω Ω be its largest corner. Then γ Ω = π/ω Ω. There holds a similar formula for polyhedra. Moreover, it is proved in [] that for the source problem in a polygon, if nodal elements of degree p are used, we have a convergence rate in energy norm for the h-version of finite elements in h τ ε for all ε>, where τ = min { γ + π ω Ω, + with ω conv the largest convex angle of Ω. π ω conv, π }, ω Ω Experiments in an L-shape domain The condition p is not necessary for practical convergence of the method (it was simply comfortable for the proof). On the other hand, owing to the classical structure of the singularities (though unbounded) we can guess that a geometrical refinement of the mesh near singular points of the boundary will improve the performance of the method... -. -. - -. - -... layers. - -. - -... layers. Fig.. Meshes on the L-shape domain Figure presents our first domain of computation Ω with the first two levels of refinement of the mesh. Here we use a ratio.

Martin Costabel, Monique Dauge, Daniel Martin and Gregory Vial We have computed the first Maxwell eigenvalue by a Galerkin discretization of formulation () with α = in eight nested meshes where the number of layers increases from to and with nodal elements based on tensor Q p polynomials, p ranging from to. Note that, since the edges of the boundary Ω are straight, the essential boundary condition E n = is implemented exactly. The computations are done with the Finite Element Library Mélina []. - - layers layers layers layers layers 9 9 9 9 9 9 - layers 9 9 layers 9 - layers Fig.. Relative errors for st eigenvalue In Figure relative errors for the first Maxwell eigenvalue are represented: The comparison value ω =. is obtained by solving the Neumann problem on the same domain with the finest mesh and p = the D Maxwell computations work as a benchmark problem since the Maxwell eigenpairs are the (curl ϕ, ν) with ϕ eigenvector of the Laplace Neumann problem with eigenvalue ν. The abscissae represent the number of degrees of freedom, and the ordinates the relative error. Each line connects the relative errors for a fixed number of layers and as p goes from to. The numbers above the lines indicate the values of the degree p. In Figure we represent the convergence rates of the previous relative errors with respect to the number N of degrees of freedom (N is proportional to p on each mesh) and as p increases. The hp effect is clearly visible.

Weighted Regularization of Maxwell Equations - - - - - - - - -9 layers layers layers layers layers layers 9 layers layers - Fig.. Convergence rates of relative errors Experiments in a curved L-domain The domain Ω with curved boundaries (arcs of circle A, A and A of radii, and respectively) for which we did the computations is represented opposite. The discretization of its boundary depends now on the mesh we choose and on the degree q of the geometrical approximation...... Fig.. The curved L-domain The meshes are similar to those constructed in the straight L-domain of Section and refined by adding successive layers of elements around the reentrant corner. Let m be the number of layers of the mesh. Whatever the value of m we have elements abutting at the exterior arc A, and at the interior arc A. Along A there are m elements. We use a geometrical approximation of degree q ranging from to, independently of the functional

Martin Costabel, Monique Dauge, Daniel Martin and Gregory Vial degree p. The values of q and m determine different approximations Ω q,m of Ω, which consist in defining each element by a grid of (q +) of Gauss- Lobatto points. For example, when q =, the discretized domains Ω,m are polygonal approximations of Ω, cf Figure........... Fig.. Meshes on the approximate curved L-domains Ω q,m, q =,m =, If we represent the relative errors for the first eigenvalue with the eight best geometrical approximations Ω,m with m =,...,, as p increases, we obtain a graph very similar to Figure. We prefer to investigate the influence of the geometrical degree q on the quality of the approximation. We represent in Figures and the relative errors obtained by the computation of the first and second Maxwell eigenvalues with the variational formulation () on the meshes with layers and geometrical degree q. The comparison is done with the Neumann eigenvalues computed on the same mesh with q =. We have to note that our approximation is now non conforming for two reasons:. The domains of computation Ω q,m do not coincide exactly with Ω: the boundary is approximated by piecewise curves of degree q. Only at the grid points a i the boundary Ω q,m of the approximate domain coincides with Ω.. The essential boundary condition E n = is implemented only at the functional (Gauss-Lobatto) nodes b j. If and only if q =, these pointwise conditions imply that E n =on Ω q,m. We can see the relative influence of the position of the geometrical nodes a i and the functional nodes b j by modifying their position. If the a i are defined from an equidistant grid and b j unchanged, the results are very similar. The geometrical degree q is the degree of the local maps which transform the reference element ˆK intothe elements K. The functional degree p is the degree of the interpolating polynomials in ˆK for the test and trial functions. The case p = q corresponds to isoparametric elements.

Weighted Regularization of Maxwell Equations - 9 - Geo. deg. Geo. deg. Geo. deg. - Geo. deg. Geo. deg. Geo. deg. 9 9 9 - Fig.. Relative errors for the st eigenvalue - 9 - - - - Geo. deg. Geo. deg. Geo. deg. Geo. deg. Geo. deg. Geo. deg. 9 9 9 - Fig.. Relative errors for the nd eigenvalue

Martin Costabel, Monique Dauge, Daniel Martin and Gregory Vial If, on the other hand, the a i are Gauss-Lobatto points and the b j are equidistant, we obtain for the second eigenvalue the numerical results contained in Figure. - 9 - - Geo. deg. Geo. deg. Geo. deg. 9 - Geo. deg. Geo. deg. - Geo. deg. Fig.. Relative errors for the nd eigenvalue with equidistant functional nodes We see that the choice of equidistant nodes for the interpolation of the boundary condition E n = is a very serious variational crime that prevents further reduction of the error for degrees p. Note that this phenomenon is only observed for vector boundary conditions and curved boundaries. It does not appear in scalar problems nor on domains with piecewise straight boundaries. References. M. Costabel, M. Dauge. Weighted regularization of maxwell equations in polyhedral domains. Preprint -, Université de Rennes (). Toappear in Numer. Math.. D. Martin. Mélina. On line documentation: http://www.maths.univ-rennes.fr/~dmartin.. J.-C. Nédélec. Mixed finite elements in R. Numer. Math. (9).. J.-C. Nédélec. A new family of mixed finite elements in R. Numer. Math. () (9).