The Discontinuous Petrov-Galerkin (DPG) method and the exponential integrators are two well establishednumerical methods for solving Partial Differential Equations (PDEs) and stiff systems of Ordinary Differential Equations (ODEs), respectively. In this work, we apply the DPG method in the time variable for linear parabolic problems and we calculate the optimal test functions analytically. We show that the DPG method in time is equivalent to exponential integrators for the trace variables, which are decoupled from the interior variables. In addition, the DPG optimal test functions allow us to compute the approximated solutions in the time element interiors. This DPG method in time allows to construct a posteriori error estimations in order to perform adaptivity. We generalize this novel DPG-based time-marching scheme to general first order linear systems of ODEs. We show the performance of the proposed method for 1D and 2D +time linear parabolic PDEs after discretizing in space by the finite element method.
more »
« less
This content will become publicly available on July 1, 2026
The discontinuous Petrov–Galerkin method
The discontinuous Petrov–Galerkin (DPG) method is a Petrov–Galerkin finite element method with test functions designed for obtaining stability. These test functions are computable locally, element by element, and are motivated by optimal test functions which attain the supremum in an inf-sup condition. A profound consequence of the use of nearly optimal test functions is that the DPG method can inherit the stability of the (undiscretized) variational formulation, be it coercive or not. This paper combines a presentation of the fundamentals of the DPG ideas with a review of the ongoing research on theory and applications of the DPG methodology. The scope of the presented theory is restricted to linear problems on Hilbert spaces, but pointers to extensions are provided. Multiple viewpoints to the basic theory are provided. They show that the DPG method is equivalent to a method which minimizes a residual in a dual norm, as well as to a mixed method where one solution component is an approximate error representation function. Being a residual minimization method, the DPG method yields Hermitian positive definite stiffness matrix systems even for non-self-adjoint boundary value problems. Having a built-in error representation, the method has the out-of-the-box feature that it can immediately be used in automatic adaptive algorithms. Contrary to standard Galerkin methods, which are uninformed about test and trial norms, the DPG method must be equipped with a concrete test norm which enters the computations. Of particular interest are variational formulations in which one can tailor the norm to obtain robust stability. Key techniques to rigorously prove convergence of DPG schemes, including construction of Fortin operators, which in the DPG case can be done element by element, are discussed in detail. Pointers to open frontiers are presented.
more »
« less
- Award ID(s):
- 2245077
- PAR ID:
- 10616435
- Publisher / Repository:
- Cambridge University Press
- Date Published:
- Journal Name:
- Acta Numerica
- Volume:
- 34
- ISSN:
- 0962-4929
- Page Range / eLocation ID:
- 293 to 384
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In this article, we introduce an error representation function to perform adaptivity in time of the recently developed timemarching Discontinuous Petrov–Galerkin (DPG) scheme. We first provide an analytical expression for the error that is the Riesz representation of the residual. Then, we approximate the error by enriching the test space in such a way that it contains the optimal test functions. The local error contributions can be efficiently computed by adding a few equations to the time-marching scheme. We analyze the quality of such approximation by constructing a Fortin operator and providing an a posteriori error estimate. The time-marching scheme proposed in this article provides an optimal solution along with a set of efficient and reliable local error contributions to perform adaptivity. We validate our method for both parabolic and hyperbolic problems.more » « less
-
We propose and investigate the application of alternative enriched test spaces in the discontinuous Petrov–Galerkin (DPG) finite element framework for singular perturbation linear problems, with an emphasis on 2D convection-dominated diffusion. Providing robust L2 error estimates for the field variables is considered a convenient feature for this class of problems, since this normwould not account for the large gradients present in boundary layers. With this requirement in mind, Demkowicz and others have previously formulated special test norms, which through DPG deliver the desired L2 convergence. However, robustness has only been verified through numerical experiments for tailored test normswhich are problem-specific,whereas the quasi-optimal test norm (not problem specific) has failed such tests due to the difficulty to resolve the optimal test functions sought in the DPG technology. To address this issue (i.e. improve optimal test functions resolution for the quasi-optimal test norm), we propose to discretize the local test spaces with functions that depend on the perturbation parameter ϵ. Explicitly,wework with B-spline spaces defined on an ϵ-dependent Shishkin submesh. Two examples are run using adaptive h-refinement to compare the performance of proposed test spaces with that of standard test spaces. We also include a modified norm and a continuation strategy aiming to improve time performance and briefly experiment with these ideas.more » « less
-
In a time-harmonic setting, we show for heterogeneous acoustic and homogeneous electromagnetic wavesguides stability estimates with the stability constant depending linearly on the length L of the waveguide. These stability estimates are used for the analysis of the (ideal) ultraweak (UW) variant of the discontinuous Petrov--Galerkin (DPG) method. For this UW DPG, we show that the stability deterioration with L can be countered by suitably scaling the test norm of the method. We present the "full envelope approximation," a UW DPG method based on nonpolynomial ansatz functions that allows for treating long waveguides.more » « less
-
Wave propagation is fundamental to applications including natural resource exploration, nuclear fusion research, and military defense, among others. However, developing accurate and efficient numerical algorithms for solving time-harmonic wave propagation problems is notoriously difficult. One difficulty is that classical discretization techniques (e.g., Galerkin finite elements, finite difference, etc.) yield indefinite discrete systems that preclude the use of many scalable solution algorithms. Significant progress has been made to develop specialized preconditioners for high-frequency wave propagation problems but robust and scalable solvers for general problems, including non-homogenous media and complex geometries, remain elusive. An alternative approach is to use minimum residual discretization methods—that yield Hermitian positive-definite discrete systems—and may be amenable to more standard preconditioners. Indeed, popularization of the first-order system least-squares methodology (FOSLS) was driven by the applicability of geometric and algebraic multigrid to otherwise indefinite problems. However, for wave propagation problems, FOSLS is known to be highly dissipative and is thus less competitive in the high-frequency regime. The discontinuous Petrov–Galerkin (DPG) method of Demkowicz and Gopalakrishnan is a minimum residual finite element method with several additional attractive properties: mesh-independent stability, a built-in error indicator, and applicability to a number of variational formulations. In the context of high-frequency wave propagation, the ultraweak DPG formulation has been observed to produce pollution error roughly commensurate to Galerkin discretizations. DPG discretizations may thus deliver accuracy typical of classical discretization techniques, but result in Hermitian positive-definite discrete systems that are often more amenable to preconditioning. A multigrid preconditioner for DPG systems, developed in the dissertation work of S. Petrides, was shown to scale efficiently in a shared-memory implementation. The primary objective of this dissertation is development of an efficient, distributed implementation of the DPG multigrid solver (DPG-MG). The distributed DPG-MG solver developed in this work will be demonstrated to be massively scalable, enabling solution of three-dimensional problems with O(10¹²) degrees of freedom on up to 460 000 CPU cores, an unprecedented scale for high-frequency wave propagation. The scalability of the DPG-MG solver will be further combined with hp-adaptivity to enable efficient solution of challenging real-world high-frequency wave propagation problems including optical fiber modeling, simulation of RF heating in tokamak devices, and seismic simulation. These applications include complex three-dimensional geometries, heterogeneous and anisotropic media, and localized features; demonstrating the robustness and versatility of the solver and tools developed in this dissertation.more » « less
An official website of the United States government
