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.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


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
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. ; ; ; (, IMA Journal of Numerical Analysis)
    Abstract In this paper, we propose and analyze a finite-element method of variational data assimilation for a second-order parabolic interface equation on a two-dimensional bounded domain. The Tikhonov regularization plays a key role in translating the data assimilation problem into an optimization problem. Then the existence, uniqueness and stability are analyzed for the solution of the optimization problem. We utilize the finite-element method for spatial discretization and backward Euler method for the temporal discretization. Then based on the Lagrange multiplier idea, we derive the optimality systems for both the continuous and the discrete data assimilation problems for the second-order parabolic interface equation. The convergence and the optimal error estimate are proved with the recovery of Galerkin orthogonality. Moreover, three iterative methods, which decouple the optimality system and significantly save computational cost, are developed to solve the discrete time evolution optimality system. Finally, numerical results are provided to validate the proposed method. 
    more » « less
  2. ; ; ; ; (, ITM Web of Conferences)
    In this paper, we develop an efficient numerical scheme for solving one-dimensional hyperbolic interface problems. The immersed finite element (IFE) method is used for spatial discretization, which allows the solution mesh to be independent of the interface. Consequently, a fixed uniform mesh can be used throughout the entire simulation. The method of lines is used for temporal discretization. Numerical experiments are provided to show the features of these new methods. 
    more » « less
  3. ; (, ESAIM: Mathematical Modelling and Numerical Analysis)
    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
  4. ; ; ; (, The Journal of Chemical Physics)
    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
  5. ; ; (, Advances in Computational Mathematics)
    The paper is concerned with efficient time discretization methods based on exponential integrators for scalar hyperbolic conservation laws. The model problem is first discretized in space by the discontinuous Galerkin method, resulting in a system of nonlinear ordinary differential equations. To solve such a system, exponential time differencing of order 2 (ETDRK2) is employed with Jacobian linearization at each time step. The scheme is fully explicit and relies on the computation of matrix exponential vector products. To accelerate such computation, we further construct a noniterative, nonoverlapping domain decomposition algorithm, namely localized ETDRK2, which loosely decouples the system at each time step via suitable interface conditions. Temporal error analysis of the proposed global and localized ETDRK2 schemes is rigorously proved; moreover, the schemes are shown to be conservative under periodic boundary conditions. Numerical results for the Burgers' equation in one and two dimensions (with moving shocks) are presented to verify the theoretical results and illustrate the performance of the global and localized ETDRK2 methods where large time step sizes can be used without affecting numerical stability. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email