Guaranteed and robust L2-norm a posteriori error estimates for 1D linear advection problems

We introduce the application of an arbitrary high‐order derivative (ADER) discontinuous Galerkin (DG) method to simulate earthquake rupture dynamics. The ADER‐DG method uses triangles as computational cells which simplifies the process of discretization of very complex surfaces and volumes by using external automated tools. Discontinuous Galerkin methods are well suited for solving dynamic rupture problems in the velocity‐stress formulation as the variables are naturally discontinuous at the interface between two elements. Therefore, the fault has to be honored by the computational mesh. The so‐called Riemann problem can be solved to obtain well defined values of the variables at the discontinuity itself. Fault geometries of high complexity can be modeled thanks to the flexibility of unstructured meshes, which solves a major bottleneck of other high‐order numerical methods. Additionally, element refinement and coarsening are easily controlled in the meshing process to better resolve the near‐fault area of the model. The fundamental properties of the method are shown, as well as a series of validating exercises with reference solutions and a comparison with the well‐established finite difference, boundary integral, and spectral element methods, in order to test the accuracy of our formulation. An example of dynamic rupture on a nonplanar fault based upon the Landers 1992 earthquake fault system is presented to illustrate the main potentials of the new method.

Devising discontinuous Galerkin methods for non-linear hyperbolic conservation laws

When solving nonlinear least-squares problems, it is often useful to regularize the problem using a quadratic term, a practice which is especially common in applications arising in inverse calculations. A solution method derived from a trust-region Gauss-Newton algorithm is analyzed for such applications, where, contrary to the standard algorithm, the least-squares subproblem solved at each iteration of the method is rewritten as a quadratic minimization subject to linear equality constraints. This allows the exploitation of duality properties of the associated linearized problems. This paper considers a recent conjugate-gradient-like method which performs the quadratic minimization in the dual space and produces, in exact arithmetic, the same iterates as those produced by a standard conjugate-gradients method in the primal space. This dual algorithm is computationally interesting whenever the dimension of the dual space is significantly smaller than that of the primal space, yielding gains in terms of both memory usage and computational cost. The relation between this dual space solver and PSAS (Physical-space Statistical Analysis System), another well-known dual space technique used in data assimilation problems, is explained. The use of an effective preconditioning technique is proposed and refined convergence bounds derived, which results in a practical solution method. Finally, stopping rules adequate for a trust-region solver are proposed in the dual space, providing iterates that are equivalent to those obtained with a Steihaug-Toint truncated conjugate-gradient method in the primal space.

In this article, we analyse several discontinuous Galerkin (DG) methods for the Stokes problem under minimal regularity on the solution. We assume that the velocity u belongs to H-0(1)(Omega)](d) and the pressure p is an element of L-0(2)(Omega). First, we analyse standard DG methods assuming that the right-hand side f belongs to H-1(Omega) boolean AND L-1(Omega)](d). A DG method that is well defined for f belonging to H-1(Omega)](d) is then investigated. The methods under study include stabilized DG methods using equal-order spaces and inf-sup stable ones where the pressure space is one polynomial degree less than the velocity space.

In this paper, we uncover and study a new superconvergence property of a large class of finite element methods for one-dimensional convection-diffusion problems. This class includes discontinuous Galerkin methods defined in terms of numerical traces, discontinuous Petrov–Galerkin methods and hybridized mixed methods. We prove that the so-called numerical traces of both variables superconverge at all the nodes of the mesh, provided that the traces are conservative , that is, provided they are single-valued. In particular, for a local discontinuous Galerkin method, we show that the superconvergence is order 2 p + 1 2\,p+1 when polynomials of degree at most p p are used. Extensive numerical results verifying our theoretical results are displayed.

In this paper, we give the first a priori error analysis of the hybridizable discontinuous Galerkin (HDG) methods for Timoshenko beams. The analysis is based on the use of a projection especially designed to fit the structure of the numerical traces of the HDG method. This property allows us to prove in a very concise manner that the projection of the errors is bounded in terms of the distance between the exact solution and its projection. The study of the influence of the stabilization function on the approximation is then reduced to the study of how they affect the approximation properties of the projection in a single element. Surprisingly, and unlike any other discontinuous Galerkin method, this can be done without assuming any positivity property of the stabilization function of the HDG method. We apply this approach to HDG methods using polynomials of degree k ≥ 0 k\ge 0 in all of the unknowns, and show that the projection of the error in each of them superconverges with order k + 2 k+2 when k ≥ 1 k \ge 1 and converges with order 1 1 for k = 0 k=0 . As a result, we show that the HDG methods converge with optimal order k + 1 k+1 for all the unknowns, and that they are free from shear locking. Finally, we show that all of the numerical traces converge with order 2 k + 1 2k+1 . Numerical experiments validating these results are shown.

Runge–Kutta discontinuous Galerkin methods for the special relativistic magnetohydrodynamics

In this paper we present a stabilized Discontinuous Galerkin (DG) method for hyperbolic and convection dominated problems. The presented scheme can be used in several space dimension and with a wide range of grid types. The stabilization method preserves the locality of the DG method and therefore allows to apply the same parallelization techniques used for the underlying DG method. As an example problem we consider the Euler equations of gas dynamics for an ideal gas. We demonstrate the stability and accuracy of our method through the detailed study of several test cases in two space dimension on both unstructured and cartesian grids. We show that our stabilization approach preserves the advantages of the DG method in regions where stabilization is not necessary. Furthermore, we give an outlook to adaptive and parallel calculations in 3d.

In this paper, we study superconvergence properties of the local discontinuous Galerkin (LDG) methods for solving nonlinear convection-diffusion equations in one space dimension. The main technicality is an elaborate estimate to terms involving projection errors. By introducing a new projection and constructing some correction functions, we prove the $$(2k+1)$$ th order superconvergence for the cell averages and the numerical flux in the discrete $$L^2$$ norm with polynomials of degree $$k\ge 1$$ , no matter whether the flow direction $$f'(u)$$ changes or not. Superconvergence of order $$k +2$$ ( $$k +1$$ ) is obtained for the LDG error (its derivative) at interior right (left) Radau points, and the convergence order for the error derivative at Radau points can be improved to $$k+2$$ when the direction of the flow doesn’t change. Finally, a supercloseness result of order $$k+2$$ towards a special Gauss–Radau projection of the exact solution is shown. The superconvergence analysis can be extended to the generalized numerical fluxes and the mixed boundary conditions. All theoretical findings are confirmed by numerical experiments.

We further investigate the high order positivity-preserving discontinuous Galerkin (DG) methods for linear hyperbolic and radiative transfer equations developed in Yuan et al. (SIAM J Sci Comput 38:A2987–A3019, 2016). The DG methods in Yuan et al. (2016) can maintain positivity and high order accuracy, but they rely both on the scaling limiter in Zhang and Shu (J Comput Phys 229:8918–8934, 2010) and a rotational limiter, the latter may alter cell averages of the unmodulated DG scheme, thereby affecting conservation. Even though a Lax–Wendroff type theorem is proved in Yuan et al. (2016), guaranteeing convergence to weak solutions with correct shock speed when such rotational limiter is applied, it would still be desirable if a conservative DG method without changing the cell averages can be obtained which has both high order accuracy and positivity-preserving capability. In this paper, we develop and analyze such a DG method for both linear hyperbolic equations and radiative transfer equations. In the one-dimensional case, the method uses traditional DG space $$P^k$$ of piecewise polynomials of degree at most k. A key result is proved that the unmodulated DG solver in this case can maintain positivity of the cell average if the inflow boundary value and the source term are both positive, therefore the positivity-preserving framework in Zhang and Shu (2010) can be used to obtain a high order conservative positivity-preserving DG scheme. Unfortunately, in two-dimensions this is no longer the case. We show that the unmodulated DG solver based either on $$P^k$$ or $$Q^k$$ spaces (piecewise kth degree polynomials or piecewise tensor-product kth degree polynomials) could generate negative cell averages. We augment the DG space with additional functions so that the positivity of cell averages from the unmodulated DG solver can be restored, thereby leading to high order conservative positivity-preserving DG scheme based on these augmented DG spaces following the framework in Zhang and Shu (2010). Computational results are provided to demonstrate the good performance of our DG schemes.

On the relationship between alternative variational formulations of a frictional contact model

In this work we investigate the advantages of multiscale methods in Petrov–Galerkin (PG) formulation in a general framework. The framework is based on a localized orthogonal decomposition of a high dimensional solution space into a low dimensional multiscale space with good approximation properties and a high dimensional remainder space, which only contains negligible fine scale information. The multiscale space can then be used to obtain accurate Galerkin approximations. As a model problem we consider the Poisson equation. We prove that a Petrov–Galerkin formulation does not suffer from a significant loss of accuracy, and still preserve the convergence order of the original multiscale method. We also prove inf-sup stability of a PG continuous and a discontinuous Galerkin finite element multiscale method. Furthermore, we demonstrate that the Petrov–Galerkin method can decrease the computational complexity significantly, allowing for more efficient solution algorithms. As another application of the framework, we show how the Petrov–Galerkin framework can be used to construct a locally mass conservative solver for two-phase flow simulation that employs the Buckley–Leverett equation. To achieve this, we couple a PG discontinuous Galerkin finite element method with an upwind scheme for a hyperbolic conservation law.

In this paper we prove a version of the loop theorem for surfaces in the boundary of a 3-dimensional duality space, i.e. a space which resembles a 3manifold only in that it satisfies the appropriate form of Poincar6-Lefschetz duality over some field of untwisted coefficients. Our motivation comes from the fact that such spaces occur as the infinite cyclic coverings of certain 4manifolds which arise in the study of knot concordance, and as the main application of our theorem we show that if a fibred knot in the 3-sphere is a ribbon knot, then its monodromy extends over a handlebody. We approach the loop theorem via the study of planar coverings of a surface, as in the original paper of Papakyriakopoulos [11] and the subsequent work of Maskit [9]. w contains a simple geometric treatment of these matters. The main result of w is that a duality space actually satisfies duality with (twisted) coefficient module the quotient of the fundamental group ring by any power of the augmentation ideal. In w 4, the results of w167 2 and 3, together with an algebraic lemma on the intersection of the powers of the augmentation ideal of a group ring, are used to prove the loop theorem for 3-dimensional duality spaces. (For the reader's convenience a proof of the algebraic temma is included as an appendix.) w contains the application to fibred ribbon knots mentioned above. In w the result of w is used to obtain a limited amount of information on some questions about knots in the boundaries of contractible 4-manifolds. In w we apply our methods to another aspect of knot concordance, and show that for any concordance with a rationally anisotropic fibred knot (see [7]) at one end, the inclusion of the complement of the knot into the complement of the concordance induces an injection of fundamental groups. For torus knots, this question was raised by Scharlemann [14].

This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to develop and implement advanced acceleration schemes for the DOE NEAMS neutronics code PROTEUSSN. The project team included the University of Massachusetts Lowell, The Ohio State University, University of Michigan, and Argonne National Laboratory. The PROTEUS code is a high-fidelity capable deterministic neutron transport code based on unstructured finite element meshes, which solves the steady-state and transient neutron transport problem using the 2nd-order discrete ordinate method (SN2ND), the method of characteristics (MOC), and the advanced nodal transport method (NODAL). The DSA scheme has been implemented in PROTEUS to speed up SN transport calculations. The existing DSA scheme employs a consistent finite element formulation on the same fine mesh structure as the SN solution While the use of consistent discretizations makes the DSA method effective, it does not necessarily make it efficient because the numerical solution of a discretized elliptic diffusion problem itself can be costly, particularly when the problem size becomes large. We developed a new discontinuous Galerkin (DG) discretization of the diffusion equation, called DG-DSA, which can effectively and efficiently accelerate the SN transport iterations. As compared with the previous work, the novelty of our method is that the diffusion equation is solved on a coarse-mesh grid using the DG methods, and the DG diffusion discretization incorporates local hp adaptation, i.e., local adaptation of mesh size and/or polynomial degree, based on local total cross section (or optical thickness). Therefore, the resulting number of degrees of freedom (DOF) of the DG discretization is much less than the conventional consistent DSA discretizations, and thus DG-DSA can achieve significant improvement in computational efficiency. We implemented this scheme in PROTEUS-SN. In addition, we developed a new stabilization scheme named linear prolongation CMFD (lpCMFD). A novel feature of this scheme is that the conventional flat flux ratio–based scaling approach is replaced with a linear interpolation of the scalar flux differences at the coarse-mesh cell edges between the neutron transport and CMFD calculations. Fourier convergence analysis and numerical results show that lpCMFD is unconditionally stable and more effective than other CMFD based on acceleration schemes such as pCMFD, odCMFD. We also developed a new nonlinear diffusion acceleration scheme for solving neutron transport equations. This scheme, called LR-NDA, employs a local refinement approach on the framework of CMFD by solving a local boundary value problem of the scalar flux on the coarse-mesh structure to replace the piecewise constant scalar flux obtained by CMFD. The refined flux is then used to update the scalar flux in the neutron transport source iteration. It has been demonstrated that that LR-NDA is much more effective and stable than CMFD for a wide range of optical thicknesses. LR-NDA is a local adaptive method, which means LR-NDA does not necessarily require local refinement for all the coarse-mesh cells on the problem domain, i.e., it can be used only for relatively optically thick regions where the standard CMFD scheme would encounter the convergence problem.

The modeling of acoustic waves in the time‐domain poses a significant challenge in scientific computing. A promising candidate for solving the three dimensional wave equation is the discontinuous Galerkin (DG) method. Advantages of the DG method are the easy parallelization and a special matrix structure which can reduce the overall time and the computer memory needed for solving the problem. In this study, a high order parallel DG method is investigated. The DG solver is implemented using the C++ programming language. Communication between processors of the parallel computer is performed using the message passing interface. In the solver, the polynomial degree of the basis functions is chosen individually for each element of the computation mesh (up to ninth order polynomials can be used). The unbounded problem is truncated using the perfectly matched layers. The method is evaluated with numerical simulations that are performed on a personal computer cluster.