18 research outputs found
An analysis of the practical DPG method
In this work we give a complete error analysis of the Discontinuous Petrov
Galerkin (DPG) method, accounting for all the approximations made in its
practical implementation. Specifically, we consider the DPG method that uses a
trial space consisting of polynomials of degree on each mesh element.
Earlier works showed that there is a "trial-to-test" operator , which when
applied to the trial space, defines a test space that guarantees stability. In
DPG formulations, this operator is local: it can be applied
element-by-element. However, an infinite dimensional problem on each mesh
element needed to be solved to apply . In practical computations, is
approximated using polynomials of some degree on each mesh element. We
show that this approximation maintains optimal convergence rates, provided that
, where is the space dimension (two or more), for the Laplace
equation. We also prove a similar result for the DPG method for linear
elasticity. Remarks on the conditioning of the stiffness matrix in DPG methods
are also included.Comment: Mathematics of Computation, 201
Partial expansion of a Lipschitz domain and some applications
We show that a Lipschitz domain can be expanded solely near a part of its
boundary, assuming that the part is enclosed by a piecewise C1 curve. The
expanded domain as well as the extended part are both Lipschitz. We apply this
result to prove a regular decomposition of standard vector Sobolev spaces with
vanishing traces only on part of the boundary. Another application in the
construction of low-regularity projectors into finite element spaces with
partial boundary conditions is also indicated
A first order system least squares method for the Helmholtz equation
We present a first order system least squares (FOSLS) method for the
Helmholtz equation at high wave number k, which always deduces Hermitian
positive definite algebraic system. By utilizing a non-trivial solution
decomposition to the dual FOSLS problem which is quite different from that of
standard finite element method, we give error analysis to the hp-version of the
FOSLS method where the dependence on the mesh size h, the approximation order
p, and the wave number k is given explicitly. In particular, under some
assumption of the boundary of the domain, the L2 norm error estimate of the
scalar solution from the FOSLS method is shown to be quasi optimal under the
condition that kh/p is sufficiently small and the polynomial degree p is at
least O(\log k). Numerical experiments are given to verify the theoretical
results
On p-Robust Saturation for hp-AFEM
We consider the standard adaptive finite element loop SOLVE, ESTIMATE, MARK,
REFINE, with ESTIMATE being implemented using the -robust equilibrated flux
estimator, and MARK being D\"orfler marking. As a refinement strategy we employ
-refinement. We investigate the question by which amount the local
polynomial degree on any marked patch has to be increase in order to achieve a
-independent error reduction. The resulting adaptive method can be turned
into an instance optimal -adaptive method by the addition of a coarsening
routine
Breaking spaces and forms for the DPG method and applications including Maxwell equations
Discontinuous Petrov Galerkin (DPG) methods are made easily implementable
using `broken' test spaces, i.e., spaces of functions with no continuity
constraints across mesh element interfaces. Broken spaces derivable from a
standard exact sequence of first order (unbroken) Sobolev spaces are of
particular interest. A characterization of interface spaces that connect the
broken spaces to their unbroken counterparts is provided. Stability of certain
formulations using the broken spaces can be derived from the stability of
analogues that use unbroken spaces. This technique is used to provide a
complete error analysis of DPG methods for Maxwell equations with perfect
electric boundary conditions. The technique also permits considerable
simplifications of previous analyses of DPG methods for other equations.
Reliability and efficiency estimates for an error indicator also follow.
Finally, the equivalence of stability for various formulations of the same
Maxwell problem is proved, including the strong form, the ultraweak form, and a
spectrum of forms in between
The DPG-star method
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 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