In this paper, we propose a novel mesh-free numerical method for solving the elliptic interface problems based on deep learning. We approximate the solution by the neural networks and, since the solution may change dramatically across the interface, we employ different neural networks in different sub-domains. By reformulating the interface problem as a least-squares problem, we discretize the objective function using mean squared error via sampling and solve the proposed deep least-squares method by standard training algorithms such as stochastic gradient descent. The discretized objective function utilizes only the point-wise information on the sampling points and thus no underlying mesh is required. Doing this circumvents the challenging meshing procedure as well as the numerical integration on the complex interface. To improve the computational efficiency for more challenging problems, we further design an adaptive sampling strategy based on the residual of the least-squares function and propose an adaptive algorithm. Finally, we present several numerical experiments in both 2D and 3D to show the flexibility, effectiveness, and accuracy of the proposed deep least-square method for solving interface problems.
An arbitrarily high order unfitted finite element method for elliptic interface problems with automatic mesh generation, Part II. Piecewise-smooth interfaces
We propose a novel discrete concept for the total generalized variation (TGV), which has originally been derived to reduce the staircasing effect in classical total variation (TV) regularization, in image denoising problems. We describe discrete, second-order TGV for piecewise constant functions on triangular meshes, thus allowing the TGV functional to be applied to more general data structures than pixel images, and in particular in the context of finite element discretizations. Particular attention is given to the description of the kernel of the TGV functional, which, in the continuous sett…
Efficient and Qualified Mesh Generation for Gaussian Molecular Surface Using Piecewise Trilinear Polynomial Approximation
State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学与科学工程计算研究所）；Center for System Biology, Department of Mathematics, Soochow University（苏州大学数学系系统生物学中心）
We propose a numerical algorithm for the reconstruction of a piecewise constant leading coefficient of an elliptic problem. The inverse problem is reduced to a shape reconstruction problem. The proposed algorithm is based on the minimization of a cost functional where a control function is the right-hand side of an auxiliary elliptic equation for a level set representation of unknown shape. The numerical implementation is based on the finite element method and the open-source computing platform FEniCS. The performance of the algorithm is demonstrated on computationally simulated data.
Mesh sensitivity of finite element solution for linear elliptic partial differential equations is analyzed. A bound for the change in the finite element solution is obtained in terms of the mesh deformation and its gradient. The bound shows how the finite element solution changes continuously with the mesh. The result holds in any dimension and for arbitrary unstructured simplicial meshes, general linear elliptic partial differential equations, and general finite element approximations.
A Frontal-Delaunay refinement algorithm for mesh generation in piecewise smooth domains is described. Built using a restricted Delaunay framework, this new algorithm combines a number of novel features, including: (i) an unweighted, conforming restricted Delaunay representation for domains specified as a (non-manifold) collection of piecewise smooth surface patches and curve segments, (ii) a protection strategy for domains containing curve segments that subtend sharply acute angles, and (iii) a new class of off-centre refinement rules designed to achieve high-quality point-placement along embe…
We propose a discontinuous Galerkin(DG) method to approximate the elliptic interface problem on unfitted mesh using a new approximation space. The approximation space is constructed by patch reconstruction with one degree of freedom per element. The optimal error estimates in both L2 norm and DG energy norm are obtained, without the typical constraints for DG method on how the interface intersects to the elements in the mesh. Other than enjoying the advantages of DG method, our method may achieve even better efficiency than the conforming finite element method, as illustrated by numerical exam…
Sharp Error Bounds for Piecewise Polynomial Approximation: Revisit and Application to Elliptic PDE Eigenvalue Computation
LSEC, Institute of Computational Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学研究所）；Beijing Computational Science Research Center（北京计算科学研究中心）；Department of Mathematics, Wayne State University（韦恩州立大学数学系）
In this paper we present an immersed weak Galerkin method for solving second-order elliptic interface problems on polygonal meshes, where the meshes do not need to be aligned with the interface. The discrete space consists of constants on each edge and broken linear polynomials satisfying the interface conditions in each element. For triangular meshes, such broken linear plynomials coincide with the basis functions in immersed finite element methods [26]. We establish some approximation properties of the broken linear polynomials and the discrete weak gradient of a certain projection of the so…
This paper presents a lowest-order immersed Raviart-Thomas mixed triangular finite element method for solving elliptic interface problems on unfitted meshes independent of the interface. In order to achieve the optimal convergence rates on unfitted meshes, an immersed finite element finite (IFE) is constructed by modifying the traditional Raviart-Thomas element. Some important properties are derived including the unisolvence of IFE basis functions, the optimal approximation capabilities of the IFE space and the corresponding commuting digram. Optimal error estimates are rigorously proved for t…
We present the lowest-order hybridizable discontinuous Galerkin schemes with numerical integration (quadrature), denoted as HDG-P0, for the reaction-diffusion equation and the generalized Stokes equations on conforming simplicial meshes in two- and three-dimensions. Here by lowest order, we mean that the (hybrid) finite element space for the global HDG facet degrees of freedom (DOFs) is the space of piecewise constants on the mesh skeleton. A discontinuous piecewise linear space is used for the approximation of the local primal unknowns. We give the optimal a priori error analysis of the propo…
In this work we analyze a virtual element method on polyhedral meshes for solving the sixth-order elliptic problem with simply supported boundary conditions. We apply the Ciarlet-Raviart arguments to introduce an auxiliary unknown $σ:=-Δ^2 u$ and to search the main uknown $u$ in the $H^2\cap H_0^1$ Sobolev space. The virtual element discretization is well possed on a $C^1\times C^0$ virtual element spaces. We also provide the convergence and error estimates results. Finally, we report a series of numerical tests to verify the performance of numerical scheme.
We present and analyse a numerical framework for the approximation of nonlinear degenerate elliptic equations of the Stefan or porous medium types. This framework is based on piecewise constant approximations for the functions, which we show are essentially necessary to obtain convergence and error estimates. Convergence is established without regularity assumption on the solution. A detailed analysis is then performed to understand the design properties that enable a scheme, despite these piecewise constant approximations and the degeneracy of the model, to satisfy high-order error estimates …
A Nonlinear Discretization Theory for Meshfree Collocation Methods applied to Quasilinear Elliptic Equations
Fachbereich Mathematik und Informatik, Universität Marburg（马尔堡大学数学与计算机科学系）；Institut für Numerische und Angewandte Mathematik, Universität Göttingen（哥廷根大学数值与应用数学研究所）
A numerical algorithm is presented to solve a benchmark problem proposed by Hemker. The algorithm incorporates asymptotic information into the design of appropriate piecewise-uniform Shishkin meshes. Moreover, different co-ordinate systems are utilized due to the different geometries and associated layer structures that are involved in this problem. Numerical results are presented to demonstrate the effectiveness of the proposed numerical algorithm.
This article considers the extension of two-grid $hp$-version discontinuous Galerkin finite element methods for the numerical approximation of second-order quasilinear elliptic boundary value problems of monotone type to the case when agglomerated polygonal/polyhedral meshes are employed for the coarse mesh approximation. We recall that within the two-grid setting, while it is necessary to solve a nonlinear problem on the coarse approximation space, only a linear problem must be computed on the original fine finite element space. In this article, the coarse space will be constructed by agglome…
In this paper, we propose two arbitrary order eXtended hybridizable Discontinuous Galerkin (X-HDG) methods for second order elliptic interface problems in two and three dimensions. The first X-HDG method applies to any piecewise $C^2$ smooth interface. It uses piecewise polynomials of degrees $k$ $(k>= 1)$ and $k-1$ respectively for the potential and flux approximations in the interior of elements inside the subdomains, and piecewise polynomials of degree $ k$ for the numerical traces of potential on the inter-element boundaries inside the subdomains. Double value numerical traces on the parts…
Local Multilevel Preconditioned Jacobi-Davidson Method for Elliptic Eigenvalue Problems on Adaptive Meshes
School of Mathematical Science, Tongji University（同济大学数学科学学院）；Key Laboratory of Intelligent Computing and Applications, Tongji University, Ministry of Education（同济大学教育部智能计算与应用重点实验室）
We design an adaptive unfitted finite element method on the Cartesian mesh with hanging nodes. We derive an hp-reliable and efficient residual type a posteriori error estimate on K-meshes. A key ingredient is a novel hp-domain inverse estimate which allows us to prove the stability of the finite element method under practical interface resolving mesh conditions and also prove the lower bound of the hp a posteriori error estimate. Numerical examples are included.
In this article, we develop and analyze a finite element method with the first family Nédélec elements of the lowest degree for solving a Maxwell interface problem modeled by a $\mathbf{H}(\text{curl})$-elliptic equation on unfitted meshes. To capture the jump conditions optimally, we construct and use $\mathbf{H}(\text{curl})$ immersed finite element (IFE) functions on interface elements while keep using the standard Nédélec functions on all the non-interface elements. We establish a few important properties for the IFE functions including the unisolvence according to the edge degrees of free…
We investigate the piecewise linear nonconforming Crouzeix-Raviar and the lowest order Raviart-Thomas finite-element methods for the Poisson problem on three-dimensional anisotropic meshes. We first give error estimates of the Crouzeix-Raviart and the Raviart-Thomas finite-element approximate problems. We next present the equivalence between the Raviart-Thomas finite-element method and the enriched Crouzeix-Raviart finite-element method. We emphasise that we do not impose either shape-regular or maximum-angle condition during mesh partitioning. Numerical results confirm the results that we obt…
We present a meshfree generalized finite difference method for solving Poisson's equation with a diffusion coefficient that contains jump discontinuities up to several orders of magnitude. To discretize the diffusion operator, we formulate a strong form method that uses a smearing of the discontinuity; and a conservative formulation based on locally computed Voronoi cells. Additionally, we propose a novel conservative formulation for enforcing Neumann boundary conditions that is compatible with the conservative formulation of the diffusion operator. Finally, we introduce a way to switch from t…
