skip to main content


Title: A posteriori error analysis for Schwarz overlapping domain decomposition methods
Domain decomposition methods are widely used for the numerical solution of partial differential equations on high performance computers. We develop an adjoint-based a posteriori error analysis for both multiplicative and additive overlapping Schwarz domain decomposition methods. The numerical error in a user-specified functional of the solution (quantity of interest) is decomposed into contributions that arise as a result of the finite iteration between the subdomains and from the spatial discretization. The spatial discretization contribution is further decomposed into contributions arising from each subdomain. This decomposition of the numerical error is used to construct a two stage solution strategy that efficiently reduces the error in the quantity of interest by adjusting the relative contributions to the error.  more » « less
Award ID(s):
1720473 1720402
NSF-PAR ID:
10276736
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
BIT Numerical Mathematics
ISSN:
0006-3835
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    A vector‐river network explicitly uses realistic geometries of river reaches and catchments for spatial discretization in a river model. This enables improving the accuracy of the physical properties of the modeled river system, compared to a gridded river network that has been used in Earth System Models. With a finer‐scale river network, resolving smaller‐scale river reaches, there is a need for efficient methods to route streamflow and its constituents throughout the river network. The purpose of this study is twofold: (1) develop a new method to decompose river networks into hydrologically independent tributary domains, where routing computations can be performed in parallel; and (2) perform global river routing simulations with two global river networks, with different scales, to examine the computational efficiency and the differences in discharge simulations at various temporal scales. The new parallelization method uses a hierarchical decomposition strategy, where each decomposed tributary is further decomposed into many sub‐tributary domains, enabling hybrid parallel computing. This parallelization scheme has excellent computational scaling for the global domain where it is straightforward to distribute computations across many independent river basins. However, parallel computing for a single large basin remains challenging. The global routing experiments show that the scale of the vector‐river network has less impact on the discharge simulations than the runoff input that is generated by the combination of land surface model and meteorological forcing. The scale of vector‐river networks needs to consider the scale of local hydrologic features such as lakes that are to be resolved in the network.

     
    more » « less
  2. The paper introduces a new finite element numerical method for the solution of partial differential equations on evolving domains. The approach uses a completely Eulerian description of the domain motion.The physical domain is embedded in a triangulated computational domain and can overlap the time-independent background mesh in an arbitrary way. The numerical method is based on finite difference discretizations of time derivatives and a standard geometrically unfitted finite element method with an additional stabilization term in the spatial domain.The performance and analysis of the method rely on the fundamental extension result in Sobolev spaces for functions defined on bounded domains. This paper includes a complete stability and error analysis, which accounts for discretization errors resulting from finite difference and finite element approximations as well as for geometric errors coming from a possible approximate recovery of the physical domain. Several numerical examples illustrate the theory and demonstrate the practical efficiency of the method. 
    more » « less
  3. Many sampling strategies commonly used in molecular dynamics, such as umbrella sampling and alchemical free energy methods, involve sampling from multiple states. The Multistate Bennett Acceptance Ratio (MBAR) formalism is a widely used way of recombining the resulting data. However, the error of the MBAR estimator is not well-understood: previous error analyses of MBAR assumed independent samples. In this work, we derive a central limit theorem for MBAR estimates in the presence of correlated data, further justifying the use of MBAR in practical applications. Moreover, our central limit theorem yields an estimate of the error that can be decomposed into contributions from the individual Markov chains used to sample the states. This gives additional insight into how sampling in each state affects the overall error. We demonstrate our error estimator on an umbrella sampling calculation of the free energy of isomerization of the alanine dipeptide and an alchemical calculation of the hydration free energy of methane. Our numerical results demonstrate that the time required for the Markov chain to decorrelate in individual states can contribute considerably to the total MBAR error, highlighting the importance of accurately addressing the effect of sample correlation. 
    more » « less
  4. Abstract

    The reduced basis method (RBM) empowers repeated and rapid evaluation of parametrized partial differential equations through an offline–online decomposition, a.k.a. a learning‐execution process. A key feature of the method is a greedy algorithm repeatedly scanning the training set, a fine discretization of the parameter domain, to identify the next dimension of the parameter‐induced solution manifold along which we expand the surrogate solution space. Although successfully applied to problems with fairly high parametric dimensions, the challenge is that this scanning cost dominates the offline cost due to it being proportional to the cardinality of the training set which is exponential with respect to the parameter dimension. In this work, we review three recent attempts in effectively delaying this curse of dimensionality, and propose two new hybrid strategies through successive refinement and multilevel maximization of the error estimate over the training set. All five offline‐enhanced methods and the original greedy algorithm are tested and compared on two types of problems: the thermal block problem and the geometrically parameterized Helmholtz problem.

     
    more » « less
  5. Abstract

    We formulate the two-dimensional gravity-capillary water wave equations in a spatially quasi-periodic setting and present a numerical study of solutions of the initial value problem. We propose a Fourier pseudo-spectral discretization of the equations of motion in which one-dimensional quasi-periodic functions are represented by two-dimensional periodic functions on a torus. We adopt a conformal mapping formulation and employ a quasi-periodic version of the Hilbert transform to determine the normal velocity of the free surface. Two methods of time-stepping the initial value problem are proposed, an explicit Runge–Kutta (ERK) method and an exponential time-differencing (ETD) scheme. The ETD approach makes use of the small-scale decomposition to eliminate stiffness due to surface tension. We perform a convergence study to compare the accuracy and efficiency of the methods on a traveling wave test problem. We also present an example of a periodic wave profile containing vertical tangent lines that is set in motion with a quasi-periodic velocity potential. As time evolves, each wave peak evolves differently, and only some of them overturn. Beyond water waves, we argue that spatial quasi-periodicity is a natural setting to study the dynamics of linear and nonlinear waves, offering a third option to the usual modeling assumption that solutions either evolve on a periodic domain or decay at infinity.

     
    more » « less