Staggered discontinuous Galerkin methods for the three-dimensional Maxwell's equations on Cartesian grids.

在本文中，我們為了三維空間的馬克士威方程組(Maxwell’s equation)制定和分析了一套新種類的交錯間斷伽遼金(discontinuous Galerkin)方法，同時考慮了時間依賴性和時間諧波的馬克士威方程組。我們用了空間離散上交錯笛卡兒網格，這種方法具有許多良好的性質。首先，我們的方法所得出的數值解保留了電磁能量，並自動符合了高斯定律的離散版本。第二，質量矩陣是對角矩陣，從而時間推進是顯式和非常有效的。第三，我們的方法是高階準確，最佳收斂性在這裏會被嚴格地證明。第四，基於笛卡兒網格，它也很容易被執行，並可視為是典型的Yee’s Scheme的以及四邊形的邊有限元的推廣。最後，超收斂結果也會在這裏被證明。在本文中，我們還提供了幾個數值結果驗證了理論的陳述。我們計算了時間依賴性和時間諧波的馬克士威方程組數值收斂結果。此外，我們計算時間諧波馬克士威方程組特徵值問題的數值特徵值，並與理論特徵值比較結果。最後，完美匹配層(Perfect Matching Layer)吸收邊界的問題也有實行其數值結果。We develop and analyze a new type of staggered discontinuous Galerkin methods for the three dimensional Maxwell’s equations in this paper. Both time-dependent and time-harmonic Maxwell’s equations are considered. The spatial discretization is based on staggered Cartesian grids which possess many good properties. First of all, our method has the advantages that the numerical solution preserves the electromagnetic energy and automatically fulfills a discrete version of the Gauss law. Second, the mass matrices are diagonal, thus time marching is explicit and is very efficient. Third, our method is high order accurate and the optimal order of convergence is rigorously proved. Fourth, it is also very easy to implement due to its Cartesian structure and can be regarded as a generalization of the classical Yee’s scheme as well as the quadrilateral edge finite elements. Lastly, a superconvergence result, that is the convergence rate is one order higher at interpolation nodes, is proved.In this paper, we also provide several numerical results to verify the theoretical statements. We compute the numerical convergence order using L2-norm and discrete-norm respectively for both the time-dependent and time-harmonic Maxwell’s equations. Also, we compute the numerical eigenvalues for the time-harmonic eigenvalue problem and compare the result with the theoretical eigenvalues. Lastly, applications to problems in unbounded domains with the use of PML are also presented.Detailed summary in vernacular field only.Detailed summary in vernacular field only.Yu, Tang Fei.Thesis (M.Phil.)--Chinese University of Hong Kong, 2012.Includes bibliographical references (leaves 46-49).Abstracts also in Chinese.Chapter 1 --- Introduction and Model Problems --- p.1Chapter 2 --- Staggered DG Spaces --- p.4Chapter 2.1 --- Review on Gauss-Radau and Gaussisan points --- p.5Chapter 2.2 --- Basis functions --- p.6Chapter 2.3 --- Finite Elements space --- p.7Chapter 3 --- Method derivation --- p.14Chapter 3.1 --- Method --- p.14Chapter 3.2 --- Time discretization --- p.17Chapter 4 --- Energy conservation and Discrete Gauss law --- p.19Chapter 4.1 --- Energy conservation --- p.19Chapter 4.2 --- Discrete Gauss law --- p.22Chapter 5 --- Error analysis --- p.24Chapter 6 --- Numerical examples --- p.29Chapter 6.1 --- Convergence tests --- p.30Chapter 6.2 --- Diffraction by a perfectly conducting object --- p.30Chapter 6.3 --- Perfectly matched layers --- p.37Chapter 7 --- Time Harmonic Maxwell’s equations --- p.40Chapter 7.1 --- Model Problems --- p.40Chapter 7.2 --- Numerical examples --- p.40Chapter 7.2.1 --- Convergence tests --- p.41Chapter 7.2.2 --- Eigenvalues tests --- p.41Chapter 8 --- Conclusion --- p.45Bibliography --- p.4

Simulation and design optimization for linear wave phenomena on metamaterials

Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2011.Cataloged from PDF version of thesis.Includes bibliographical references (p. 87-91).Periodicity can change materials properties in a very unintuitive way. Many wave propagation phenomena, such as waveguides, light bending structures or frequency filters can be modeled through finite periodic structures designed using optimization techniques. Two different kind of problems can be found: those involving linear waves and those involving nonlinear waves. The former have been widely studied and analyzed within the last few years and many interesting results have been found: cloaking devices, superlensing, fiber optics The latter is a topic of high interest nowadays and a lot of work still needs to be done, since it is far more complicated and very little is known. Nonlinear wave phenomena include acoustic amplitude filters, sound bullets or elastic shock mitigation structures, among others. The wave equation can be solved accurately using the Hybridizable Discontinuous Galerkin Method both in time and in frequency domain. Furthermore, convex optimization techniques can be used to obtain the desired material properties. Thus, the path to follow is to implement a wave phenomena simulator in 1 and 2 dimensions and then formulate specific optimization problems that will lead to materials with some particular and special properties. Within the optimization problems that can be found, there are eigenvalue optimization problems as well as more general optimal control topology optimization problems. This thesis is focused on linear phenomena. An HDG simulation code has been developed and optimization problems for the design of some model devices have also been formulated. A series of numerical results are also included showing how effective and unintuitive such designs are.by Joel Saà-Seoane.S.M

Advanced techniques in scientific computing: application to electromagnetics

Mención Internacional en el título de doctorDurante los últimos años, los componentes de radiofrecuencia que forman parte de un sistema de comunicaciones necesitan simulaciones cada vez más exigentes desde el punto de vista de recursos computacionales. Para ello, se han desarrollado diferentes técnicas con el método de los elementos finitos (FEM) como la conocida como adaptatividad hp, que consiste en estimar el error en el problema electromagnético para generar mallas de elementos adecuadas al problema que obtienen una aproximación de forma más efectiva que las mallas estándar; o métodos de descomposición de dominios (DDM), basado en la división del problema original en problemas más pequeños que se pueden resolver en paralelo. El principal problema de las técnicas de adaptatividad es que ofrecen buenas prestaciones para problemas bidimensionales, mientras que en tres dimensiones el tiempo de generación de las mallas adaptadas es prohibitivo. Por otra parte, DDM se ha utilizado satisfactoriamente para la simulación de problemas eléctricamente muy grandes y de gran complejidad, convirtiéndose en uno de los temas más actuales en la comunidad de electromagnetismo computacional. El principal objetivo de este trabajo es estudiar la viabilidad de algoritmos escalables (en términos de paralelización) combinando DDM no conformes y adaptatividad automática en tres dimensiones. Esto permitir ía la ejecución de algoritmos de adaptatividad independiente en cada subdominio de DDM. En este trabajo se presenta y discute un prototipo que combina técnicas de adaptatividad y DDM, que aún no se han tratado en detalle en la comunidad científica. Para ello, se implementan tres bloques fundamentales: i) funciones de base para los elementos finitos que permitan órdenes variables dentro de la misma malla; ii) DDM no conforme y sin solapamiento; y iii) algoritmos de adaptatividad en tres dimensiones. Estos tres bloques se han implementado satisfactoriamente en un código FEM mediante un método sistemático basado en el método de las soluciones manufacturadas (MMS). Además, se ha llevado a cabo una paralelización a tres niveles: a nivel de algoritmo, con DDM; a nivel de proceso, con MPI (Message Passing Interface); y a nivel de hebra, con OpenMP; todo en un código modular que facilita el mantenimiento y la introducción de nuevas características. Con respecto al primer bloque fundamental, se ha desarrollado una familia de funciones base con un enfoque sistemático que permite la expansión correcta del espacio de funciones. Por otra parte, se han introducido funciones de base jerárquicas de otros autores (con los que el grupo al que pertenece el autor de la tesis ha colaborado estrechamente en los últimos años) para facilitar la introducción de diferentes órdenes de aproximación en el mismo mallado. En lo relativo a DDM, se ha realizado un estudio cuantitativo del error generado por las disconformidades en la interfaz entre subdominios, incluidas las discontinuidades generadas por un algoritmo de adaptatividad. Este estudio es fundamental para el correcto funcionamiento de la adaptatividad, y no ha sido evaluado con detalle en la comunidad científica. Además, se ha desarrollado un algoritmo de adaptatividad con prismas triangulares, haciendo especial énfasis en las peculiaridades debidas a la elección de este elemento. Finalmente, estos tres bloques básicos se han utilizado para desarrollar, y discutir, un prototipo que une las técnicas de adaptatividad y DDM.In the last years, more and more accurate and demanding simulations of radiofrequency components in a system of communications are requested by the community. To address this need, some techniques have been introduced in finite element methods (FEM), such as hp adaptivity (which estimates the error in the problem and generates tailored meshes to achieve more accuracy with less unknowns than in the case of uniformly refined meshes) or domain decomposition methods (DDM, consisting of dividing the whole problem into more manageable subdomains which can be solved in parallel). The performance of the adaptivity techniques is good up to two dimensions, whereas for three dimensions the generation time of the adapted meshes may be prohibitive. On the other hand, large scale simulations have been reported with DDM becoming a hot topic in the computational electromagnetics community. The main objective of this dissertation is to study the viability of scalable (in terms of parallel performance) algorithms combining nonconformal DDM and automatic adaptivity in three dimensions. Specifically, the adaptivity algorithms might be run in each subdomain independently. This combination has not been detailed in the literature and a proof of concept is discussed in this work. Thus, three building blocks must be introduced: i) basis functions for the finite elements which support non-uniform approximation orders p; ii) non-conformal and non-overlapping DDM; and iii) adaptivity algorithms in 3D. In this work, these three building blocks have been successfully introduced in a FEM code with a systematic procedure based on the method of manufactured solutions (MMS). Moreover, a three-level parallelization (at the algorithm level, with DDM; at the process level, with message passing interface (MPI), and at the thread level, with OpenMP) has been developed using the paradigm of modular programming which eases the software maintenance and the introduction of new features. Regarding first building block, a family of basis functions which follows a sound mathematical approach to expand the correct space of functions is developed and particularized for triangular prisms. Also, to ease the introduction of different approximation orders in the same mesh, hierarchical basis functions from other authors are used as a black box. With respect to DDM, a thorough study of the error introduced by the non-conformal interfaces between subdomains is required for the adaptivity algorithm. Thus, a quantitative analysis is detailed including non-conformalities generated by independent refinements in neighbor subdomains. This error has not been assessed with detail in the literature and it is a key factor for the adaptivity algorithm to perform properly. An adaptivity algorithm with triangular prisms is also developed and special considerations for the implementation are explained. Finally, on top of these three building blocks, the proof of concept of adaptivity with DDM is discussed.Programa Oficial de Doctorado en Multimedia y ComunicacionesPresidente: Daniel Segovia Vargas.- Secretario: David Pardo Zubiaur.- Vocal: Romanus Dyczij-Edlinge

Compact support wavelet representations for solution of quantum and electromagnetic equations: Eigenvalues and dynamics

Wavelet-based algorithms are developed for solution of quantum and electromagnetic differential equations. Wavelets offer orthonormal localized bases with built-in multiscale properties for the representation of functions, differential operators, and multiplicative operators. The work described here is part of a series of tools for use in the ultimate goal of general, efficient, accurate and automated wavelet-based algorithms for solution of differential equations. The most recent work, and the focus here, is the elimination of operator matrices in wavelet bases. For molecular quantum eigenvalue and dynamics calculations in multiple dimensions, it is the coupled potential energy matrices that generally dominate storage requirements. A Coefficient Product Approximation (CPA) for the potential operator and wave function wavelet expansions dispenses with the matrix, reducing storage and coding complexity. New developments are required, however. It is determined that the CPA is most accurate for specific choices of wavelet families, and these are given here. They have relatively low approximation order (number of vanishing wavelet function moments), which would ordinarily be thought to compromise both wavelet reconstruction and differentiation accuracy. Higher-order convolutional coefficient filters are determined that overcome both apparent problems. The result is a practical wavelet method where the effect of applying the Hamiltonian matrix to a coefficient vector can be calculated accurately without constructing the matrix. The long-familiar Lanczos propagation algorithm, wherein one constructs and diagonalizes a symmetric tridiagonal matrix, uses both eigenvalues and eigenvectors. We show here that time-reversal-invariance for Hermitian Hamiltonians allows a new algorithm that avoids the usual need to keep a number Lanczos vectors around. The resulting Conjugate Symmetric Lanczos (CSL) method, which will apply for wavelets or other choices of basis or grid discretization, is simultaneously low-operation-count and low-storage. A modified CSL algorithm is used for solution of Maxwell's time-domain equations in Hamiltonian form for non-lossy media. The matrix-free algorithm is expected to complement previous work and to decrease both storage and computational overhead. It is expected- that near-field electromagnetic solutions around nanoparticles will benefit from these wavelet-based tools. Such systems are of importance in plasmon-enhanced spectroscopies

Mimetic finite difference method for the stokes problem on polygonal meshes

Various approaches to extend the finite element methods to non-traditional elements (pyramids, polyhedra, etc.) have been developed over the last decade. Building of basis functions for such elements is a challenging task and may require extensive geometry analysis. The mimetic finite difference (MFD) method has many similarities with low-order finite element methods. Both methods try to preserve fundamental properties of physical and mathematical models. The essential difference is that the MFD method uses only the surface representation of discrete unknowns to build stiffness and mass matrices. Since no extension inside the mesh element is required, practical implementation of the MFD method is simple for polygonal meshes that may include degenerate and non-convex elements. In this article, we develop a MFD method for the Stokes problem on arbitrary polygonal meshes. The method is constructed for tensor coefficients, which will allow to apply it to the linear elasticity problem. The numerical experiments show the second-order convergence for the velocity variable and the first-order for the pressure

Parallel and Adaptive Galerkin Methods for Radiative Transfer Problems

Finite element methods for radiative transfer problems are developed and their implementation on parallel computer architectures is discussed. A posteriori error estimates allow for efficient grid adaptation in two and three space dimensions

ANALYSIS OF ITERATIVE METHODS FOR THE SOLUTION OF BOUNDARY INTEGRAL EQUATIONS WITH APPLICATIONS TO THE HELMHOLTZ PROBLEM

This thesis is concerned with the numerical solution of boundary integral equations and the numerical analysis of iterative methods. In the first part, we assume the boundary to be smooth in order to work with compact operators; while in the second part we investigate the problem arising from allowing piecewise smooth boundaries. Although in principle most results of the thesis apply to general problems of reformulating boundary value problems as boundary integral equations and their subsequent numerical solutions, we consider the Helmholtz equation arising from acoustic problems as the main model problem. In Chapter 1, we present the background material of reformulation of Helmhoitz boundary value problems into boundary integral equations by either the indirect potential method or the direct method using integral formulae. The problem of ensuring unique solutions of integral equations for exterior problems is specifically discussed. In Chapter 2, we discuss the useful numerical techniques for solving second kind integral equations. In particular, we highlight the superconvergence properties of iterated projection methods and the important procedure of Nystrom interpolation. In Chapter 3, the multigrid type methods as applied to smooth boundary integral equations are studied. Using the residual correction principle, we are able to propose some robust iterative variants modifying the existing methods to seek efficient solutions. In Chapter 4, we concentrate on the conjugate gradient method and establish its fast convergence as applied to the linear systems arising from general boundary element equations. For boundary integral equalisations on smooth boundaries we have observed, as the underlying mesh sizes decrease, faster convergence of multigrid type methods and fixed step convergence of the conjugate gradient method. In the case of non-smooth integral boundaries, we first derive the singular forms of the solution of boundary integral solutions for Dirichlet problems and then discuss the numerical solution in Chapter 5. Iterative methods such as two grid methods and the conjugate gradient method are successfully implemented in Chapter 6 to solve the non-smooth integral equations. The study of two grid methods in a general setting and also much of the results on the conjugate gradient method are new. Chapters 3, 4 and 5 are partially based on publications [4], [5] and [35] respectively.Department of Mathematics and Statistics, Polytechnic South Wes

Multigrid methods for Maxwell\u27s equations

In this work we study finite element methods for two-dimensional Maxwell\u27s equations and their solutions by multigrid algorithms. We begin with a brief survey of finite element methods for Maxwell\u27s equations. Then we review the related fundamentals, such as Sobolev spaces, elliptic regularity results, graded meshes, finite element methods for second order problems, and multigrid algorithms. In Chapter 3, we study two types of nonconforming finite element methods on graded meshes for a two-dimensional curl-curl and grad-div problem that appears in electromagnetics. The first method is based on a discretization using weakly continuous P1 vector fields. The second method uses discontinuous P1 vector fields. Optimal convergence rates (up to an arbitrary positive epsilon) in the energy norm and the L2 norm are established for both methods on graded meshes. In Chapter 4, we consider a class of symmetric discontinuous Galerkin methods for a model Poisson problem on graded meshes that share many techniques with the nonconforming methods in Chapter 3. Optimal order error estimates are derived in both the energy norm and the L2 norm. Then we establish the uniform convergence of W-cycle, V-cycle and F-cycle multigrid algorithms for the resulting discrete problems. In Chapter 5, we propose a new numerical approach for two-dimensional Maxwell\u27s equations that is based on the Hodge decomposition for divergence-free vector fields. In this approach, an approximate solution for Maxwell\u27s equations can be obtained by solving standard second order scalar elliptic boundary value problems. We illustrate this new approach by a P1 finite element method. In Chapter 6, we first report numerical results for multigrid algorithms applied to the discretized curl-curl and grad-div problem using nonconforming finite element methods. Then we present multigrid results for Maxwell\u27s equations based on the approach introduced in Chapter 5. All the theoretical results obtained in this dissertation are confirmed by numerical experiments

B-spline collocation for two dimensional, time-dependent, parabolic PDEs

vi, 177 leaves : ill. ; 29 cm.Includes abstract and appendices.Includes bibliographical references (leaves 82-88).In this thesis, we consider B-spline collocation algorithms for solving two-dimensional in space, time-dependent parabolic partial differential equations (PDEs), defined over a rectangular region. We propose two ways to solve the problem: (i) The Method of Surfaces: Discretizing the problem in one of the spatial domains, we obtain a system of one-dimensional parabolic PDEs, which is then solved using a one-dimensional PDE system solver. (ii) Two-dimensional B-spline collocation: The numerical solution is represented as a bi-variate piecewise polynomial with unknown time-dependent coefficients. These coefficients are determined by requiring the numerical solution to satisfy the PDE at a number of points within the spatial domain, i.e., we collocate simultaneously in both spatial dimensions. This leads to an approximation of the PDE by a large system of time-dependent differential algebraic equations (DAEs), which we then solve using a high quality DAE solver