Design, Analysis, and Application of Immersed Finite Element Methods
MetadataShow full item record
This dissertation consists of three studies of immersed finite element (IFE) methods for inter- face problems related to partial differential equations (PDEs) with discontinuous coefficients. These three topics together form a continuation of the research in IFE method including the extension to elasticity systems, new breakthroughs to higher degree IFE methods, and its application to inverse problems. First, we extend the current construction and analysis approach of IFE methods in the literature for scalar elliptic equations to elasticity systems in the vector format. In particular, we construct a group of low-degree IFE functions formed by linear, bilinear, and rotated Q1 polynomials to weakly satisfy the jump conditions of elasticity interface problems. Then we analyze the trace inequalities of these IFE functions and the approximation capabilities of the resulted IFE spaces. Based on these preparations, we develop a partially penalized IFE (PPIFE) scheme and prove its optimal convergence rates. Secondly, we discuss the limitations of the current approaches of IFE methods when we try to extend them to higher degree IFE methods. Then we develop a new framework to construct and analyze arbitrary p-th degree IFE methods. In this framework, each IFE function is the extension of a p-th degree polynomial from one subelement to the whole interface element by solving a local Cauchy problem on interface elements in which the jump conditions across the interface are employed as the boundary conditions. All the components in the analysis, including existence of IFE functions, the optimal approximation capabilities and the trace inequalities, are all reduced to key properties of the related discrete extension operator. We employ these results to show the optimal convergence of a discontinuous Galerkin IFE (DGIFE) method. In the last part, we apply the linear IFE methods in the literature together with the shape optimization technique to solve a group of interface inverse problems. In this algorithm, both the governing PDEs and the objective functional for interface inverse problems are discretized optimally by the IFE method regardless of the location of the interface in a chosen mesh. We derive the formulas for the gradients of the objective function in the optimization problem which can be implemented efficiently in the IFE framework through a discrete adjoint method. We demonstrate the properties of the proposed algorithm by applying it to three representative applications.
- Doctoral Dissertations