We propose and analyze a numerical method to solve an elliptic transmission problem in full space. The method consists of a variational formulation involving standard boundary integral operators on the coupling interface and an ultra-weak formulation in the interior. To guarantee the discrete inf-sup condition, the system is discretized by the DPG method with optimal test functions. We prove that principal unknowns are approximated quasi-optimally. Numerical experiments for problems with smooth and singular solutions confirm optimal convergence orders.
We present an ultra-weak formulation of a hypersingular integral equation on closed polygons and prove its well-posedness and equivalence with the standard variational formulation. Based on this ultra-weak formulation we present a discontinuous Petrov-Galerkin method with optimal test functions and prove its quasi-optimal convergence in $L^2$. Theoretical results are confirmed by numerical experiments on an open curve with uniform and adaptively refined meshes.
We develop and analyze a discontinuous Petrov--Galerkin method with optimal test functions (DPG method) for a shallow shell model of Koiter type. It is based on a uniformly stable ultraweak formulation and thus converges robustly quasi-uniformly. Numerical experiments for various cases, including the Scordelis--Lo cylindrical roof, elliptic and hyperbolic geometries, illustrate its performance. The built-in DPG error estimator gives rise to adaptive mesh refinements that are capable to resolve boundary and interior layers. The membrane locking is dealt with by raising the polynomial degree only of the tangential displacement trace variable.
This article introduces the DPG-star (from now on, denoted DPG$^*$) finite element method. It is a method that is in some sense dual to the discontinuous Petrov-Galerkin (DPG) method. The DPG methodology can be viewed as a means to solve an overdetermined discretization of a boundary value problem. In the same vein, the DPG$^*$ methodology is a means to solve an underdetermined discretization. These two viewpoints are developed by embedding the same operator equation into two different saddle-point problems. The analyses of the two problems have many common elements. Comparison to other methods in the literature round out the newly garnered perspective. Notably, DPG$^*$ and DPG methods can be seen as generalizations of $mathcal{L}mathcal{L}^ast$ and least-squares methods, respectively. A priori error analysis and a posteriori error control for the DPG$^*$ method are considered in detail. Reports of several numerical experiments are provided which demonstrate the essential features of the new method. A notable difference between the results from the DPG$^*$ and DPG analyses is that the convergence rates of the former are limited by the regularity of an extraneous Lagrange multiplier variable.
We propose and analyze a discretization scheme that combines the discontinuous Petrov-Galerkin and finite element methods. The underlying model problem is of general diffusion-advection-reaction type on bounded domains, with decomposition into two sub-domains. We propose a heterogeneous variational formulation that is of the ultra-weak (Petrov-Galerkin) form with broken test space in one part, and of Bubnov-Galerkin form in the other. A standard discretization with conforming approximation spaces and appropriate test spaces (optimal test functions for the ultra-weak part and standard test functions for the Bubnov-Galerkin part) gives rise to a coupled DPG-FEM scheme. We prove its well-posedness and quasi-optimal convergence. Numerical results confirm expected convergence orders.