skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Scalable DPG multigrid solver with applications in high-frequency wave propagation
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
Award ID(s):
2103524
PAR ID:
10633365
Author(s) / Creator(s):
Publisher / Repository:
The University of Texas at Austin
Date Published:
Subject(s) / Keyword(s):
Helmholtz Wave propagation Multigrid Frequency domain Finite element method
Format(s):
Medium: X Other: application/pdf
Institution:
The University of Texas at Austin
Sponsoring Org:
National Science Foundation
More Like this
  1. This paper presents a scalable multigrid preconditioner targeting large-scale systems arising from discontinuous Petrov-Galerkin (DPG) discretizations of high-frequency wave operators. This work is built on previously developed multigrid preconditioning techniques of Petrides and Demkowicz (Comput. Math. Appl. 87 (2021) pp. 12–26) and extends the convergence results from O(10^7) degrees of freedom (DOFs) to O(10^9) DOFs using a new scalable parallel MPI/OpenMP implementation. Novel contributions of this paper include an alternative definition of coarse-grid systems based on restriction of fine-grid operators, yielding superior convergence results. In the uniform refinement setting, a detailed convergence study is provided, demonstrating ℎand 𝑝robust convergence and linear scaling with respect to the wave frequency. The paper concludes with numerical results on hp-adaptive simulations including a large-scale seismic modeling benchmark problem with high material contrast. 
    more » « less
  2. 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
  3. 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
  4. We present the lowest-order hybridizable discontinuous Galerkin schemes with numerical integration (quadrature), denoted as HDG-P0 for the reaction-diffusion equation and the generalized Stokes equations on conforming simplicial meshes in two- and three-dimensions. Here by lowest order, we mean that the (hybrid) finite element space for the global HDG facet degrees of freedom (DOFs) is the space of piecewise constants on the mesh skeleton. A discontinuous piecewise linear space is used for the approximation of the local primal unknowns. We give the optimal a priori error analysis of the proposed HDG-P0 schemes, which hasn’t appeared in the literature yet for HDG discretizations as far as numerical integration is concerned. Moreover, we propose optimal geometric multigrid preconditioners for the statically condensed HDG-P0 linear systems on conforming simplicial meshes. In both cases, we first establish the equivalence of the statically condensed HDG system with a (slightly modified) nonconforming Crouzeix–Raviart (CR) discretization, where the global (piecewise-constant) HDG finite element space on the mesh skeleton has a natural one-to-one correspondence to the nonconforming CR (piecewise-linear) finite element space that live on the whole mesh. This equivalence then allows us to use the well-established nonconforming geometry multigrid theory to precondition the condensed HDG system. Numerical results in two- and three-dimensions are presented to verify our theoretical findings. 
    more » « less
  5. In this paper, we consider Maxwell’s equations in linear dispersive media described by a single-pole Lorentz model for electronic polarization. We study two classes of commonly used spatial discretizations: finite difference methods (FD) with arbitrary even order accuracy in space and high spatial order discontinuous Galerkin (DG) finite element methods. Both types of spatial discretizations are coupled with second order semi-implicit leap-frog and implicit trapezoidal temporal schemes. By performing detailed dispersion analysis for the semi-discrete and fully discrete schemes, we obtain rigorous quantification of the dispersion error for Lorentz dispersive dielectrics. In particular, comparisons of dispersion error can be made taking into account the model parameters, and mesh sizes in the design of the two types of schemes. This work is a continuation of our previous research on energy-stable numerical schemes for nonlinear dispersive optical media [6,7]. The results for the numerical dispersion analysis of the reduced linear model, considered in the present paper, can guide us in the optimal choice of discretization parameters for the more complicated and nonlinear models. The numerical dispersion analysis of the fully discrete FD and DG schemes, for the dispersive Maxwell model considered in this paper, clearly indicate the dependence of the numerical dispersion errors on spatial and temporal discretizations, their order of accuracy, mesh discretization parameters and model parameters. The results obtained here cannot be arrived at by considering discretizations of Maxwell’s equations in free space. In particular, our results contrast the advantages and disadvantages of using high order FD or DG schemes and leap-frog or trapezoidal time integrators over different frequency ranges using a variety of measures 
    more » « less