More Like this

1. Numerical analysis of sparse initial data identification for parabolic problems

   https://doi.org/10.1051/m2an/2019083  

   Leykekhman, Dmitriy ; Vexler, Boris ; Walter, Daniel ( July 2020 , ESAIM: Mathematical Modelling and Numerical Analysis)

   null (Ed.)

   In this paper we consider a problem of initial data identification from the final time observation for homogeneous parabolic problems. It is well-known that such problems are exponentially ill-posed due to the strong smoothing property of parabolic equations. We are interested in a situation when the initial data we intend to recover is known to be sparse, i.e. its support has Lebesgue measure zero. We formulate the problem as an optimal control problem and incorporate the information on the sparsity of the unknown initial data into the structure of the objective functional. In particular, we are looking for the control variable in the space of regular Borel measures and use the corresponding norm as a regularization term in the objective functional. This leads to a convex but non-smooth optimization problem. For the discretization we use continuous piecewise linear finite elements in space and discontinuous Galerkin finite elements of arbitrary degree in time. For the general case we establish error estimates for the state variable. Under a certain structural assumption, we show that the control variable consists of a finite linear combination of Dirac measures. For this case we obtain error estimates for the locations of Dirac measures as well as for the corresponding coefficients. The key to the numerical analysis are the sharp smoothing type pointwise finite element error estimates for homogeneous parabolic problems, which are of independent interest. Moreover, we discuss an efficient algorithmic approach to the problem and show several numerical experiments illustrating our theoretical results. 

   more » « less
2. Solving three-dimensional interface problems with immersed finite elements: A-priori error analysis

   https://doi.org/10.1016/j.jcp.2021.110445  

   Guo, R. ; Zhang, X ( September 2021 , Journal of computational physics)

   Immersed finite element methods are designed to solve interface problems on interface- unfitted meshes. However, most of the study, especially analysis, is mainly limited to the two-dimension case. In this paper, we provide an a priori analysis for the trilinear immersed finite element method to solve three-dimensional elliptic interface problems on Cartesian grids consisting of cuboids. We establish the trace and inverse inequalities for trilinear IFE functions for interface elements with arbitrary interface-cutting configuration. Optimal a priori error estimates are rigorously proved in both energy and L2 norms, with the constant in the error bound independent of the interface location and its dependence on coefficient contrast explicitly specified. Numerical examples are provided not only to verify our theoretical results but also to demonstrate the applicability of this IFE method in tackling some real-world 3D interface models. 

   more » « less
3. Discontinuous Galerkin approximations to elliptic and parabolic problems with a Dirac line source

   https://doi.org/10.1051/m2an/2022095  

   Masri, Rami ; Shen, Boqian ; Riviere, Beatrice ( March 2023 , ESAIM: Mathematical Modelling and Numerical Analysis)

   The analyses of interior penalty discontinuous Galerkin methods of any order k for solving elliptic and parabolic problems with Dirac line sources are presented. For the steady state case, we prove convergence of the method by deriving a priori error estimates in the L 2 norm and in weighted energy norms. In addition, we prove almost optimal local error estimates in the energy norm for any approximation order. Further, almost optimal local error estimates in the L 2 norm are obtained for the case of piecewise linear approximations whereas suboptimal error bounds in the L 2 norm are shown for any polynomial degree. For the time-dependent case, convergence of semi-discrete and of backward Euler fully discrete scheme is established by proving error estimates in L 2 in time and in space. Numerical results for the elliptic problem are added to support the theoretical results. 

   more » « less
4. Solving two-dimensional H(curl)-elliptic interface systems with optimal convergence on unfitted meshes

   https://doi.org/10.1017/S0956792522000390  

   Guo, Ruchi ; Lin, Yanping ; Zou, Jun ( January 2023 , European Journal of Applied Mathematics)

   Abstract Finite element methods developed for unfitted meshes have been widely applied to various interface problems. However, many of them resort to non-conforming spaces for approximation, which is a critical obstacle for the extension to $\textbf{H}(\text{curl})$ equations. This essential issue stems from the underlying Sobolev space $\textbf{H}^s(\text{curl};\,\Omega)$ , and even the widely used penalty methodology may not yield the optimal convergence rate. One promising approach to circumvent this issue is to use a conforming test function space, which motivates us to develop a Petrov–Galerkin immersed finite element (PG-IFE) method for $\textbf{H}(\text{curl})$ -elliptic interface problems. We establish the Nédélec-type IFE spaces and develop some important properties including their edge degrees of freedom, an exact sequence relating to the $H^1$ IFE space and optimal approximation capabilities. We analyse the inf-sup condition under certain assumptions and show the optimal convergence rate, which is also validated by numerical experiments. 

   more » « less
5. Optimal order multigrid preconditioners for the distributed control of parabolic equations with coarsening in space and time

   https://doi.org/10.1080/10556788.2021.2022145  

   Drăgănescu, Andrei ; Hajghassem, Mona ( February 2022 , Optimization Methods and Software)

   We devise multigrid preconditioners for linear-quadratic space-time distributed parabolic optimal control problems. While our method is rooted in earlier work on elliptic control, the temporal dimension presents new challenges in terms of algorithm design and quality. Our primary focus is on the cG(s)dG(r) discretizations which are based on functions that are continuous in space and discontinuous in time, but our technique is applicable to various other space-time finite element discretizations. We construct and analyse two kinds of multigrid preconditioners: the first is based on full coarsening in space and time, while the second is based on semi-coarsening in space only. Our analysis, in conjunction with numerical experiments, shows that both preconditioners are of optimal order with respect to the discretization in case of cG(1)dG(r) for r = 0, 1 and exhibit a suboptimal behaviour in time for Crank–Nicolson. We also show that, under certain conditions, the preconditioner using full space-time coarsening is more efficient than the one involving semi-coarsening in space, a phenomenon that has not been observed previously. Our numerical results confirm the theoretical findings. 

   more » « less