Overlapping domain decomposition based exponential time differencing methods for semilinear parabolic equations
Not provided.
Computer Science↗
SEARCH · Engineering Papers
Results for “overlapping domain decomposition”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
An overlapping domain decomposition method for large-scale problems
Discretization of dynamical models defined through partial differential equations leads to large-scale systems. Time-depending condition involves an iterative integration of such kind of systems. In this paper, a novel technique based on overlapped domain decomposition, without preconditioner and scalable, is presented. Due to the domain decomposition, subproblems are solved in parallel without communications, cutting off the computation time and optimizing the computational cost. This direct method describes an optimized parallel strategy to solve the initial problem, providing the exact solution, up to rounding errors. Moreover, it takes into account both physical nature of the problem and deriving numerical properties of the system. It is highly recommended in case of band matrices and a long time interval because of an increasing gain in terms of performance and computational cost with the number of integrations. A deep analysis of the computational cost concludes the paper.
97 MATHEMATICS AND COMPUTING↗
An overlapping Domain Decomposition preconditioning method for monolithic solution of shear bands
Metals subjected to high strain rate impact often exhibit a sudden and profound drop in the material’s load bearing capability, a ductile failure phenomenon known as shear banding. Shear bands, characterized as material instabilities, are driven by shear heating and described as narrow regions that have sustained intense plastic deformation and high temperature rise. This coupled thermo-mechanical localization problem can be formulated as a nonlinear system with two balance equations, momentum and energy, and two constitutive laws for elasticity and plasticity. Here in our formulation, mixed finite elements are used to discretize the equations in space and an implicit finite difference scheme is used to advance the system in time, where at every time step, a Newton type method is used to solve the system monolithically. To that end, a block Jacobian matrix is formed analytically using Gâteaux derivatives. The resulting Jacobian is sparse, nonsymmetric and its sparsity pattern and eigenvalue content vary with the different stages of shear bands formation, consequently posing a significant challenge to iterative solvers. To address this issue, an overlapping Domain Decomposition preconditioner that takes into account the physics of shear bands and the domain in which it forms, is proposed. The key idea is to resolve the shear band domain accurately while only solving the remaining domain approximately, with selective updates when necessary. The preconditioner is formed on the basis of an additive Schwartz method that is applied to a Schur complement partition of the system. The proposed preconditioner is implemented in parallel and tested on three different benchmark problems as compared against off-the-shelf solvers. We study the effect of h- and k-refinement that are obtained from Isogeometric discretizations of the system, the overlapping strategy and its parallel performance. Excellent performance is demonstrated in serial and parallel on all benchmark examples.
42 ENGINEERING↗
Large-Scale Uncertainty Propagation via Overlapping Domain Decomposition.
Abstract not provided.
Carlberg, Kevin Thomas↗
FROSch: A Fast and Robust Overlapping Schwarz Domain Decomposition Preconditioner Based on Xpetra in Trilinos
A parallel two-level overlapping Schwarz domain decomposition preconditioner has been integrated into the Trilinos ShyLU-package. The preconditioner uses an energy-minimizing coarse space and can be constructed from an assembled sparse matrix. The software implements variants of the two-level overlapping Schwarz method from [Dohrmann, Klawonn, Widlund, SINUM 2008], where it was denoted Generalized Dryja, Smith, Widlund (GDSW). The implementation is based on [Heinlein, Klawonn, Rheinbach, SISC 2016] but has been improved significantly with respect to efficiency, generality, e.g., for the use of Tpetra instead of Epetra matrices, and its interface.
97 MATHEMATICS AND COMPUTING↗
Fast non-overlapping Schwarz domain decomposition methods for solving the neutron diffusion equation
Studying numerically the steady state of a nuclear core reactor is expensive, in terms of memory storage and computational time. In order to address both requirements, one can use a domain decomposition method, implemented on a parallel computer. We present here such a method for the mixed neutron diffusion equations, discretized with Raviart–Thomas–Nédélec finite elements. This method is based on the Schwarz iterative algorithm with Robin interface conditions to handle communications. We analyse this method from the continuous point of view to the discrete point of view, and we give some numerical results in a realistic highly heterogeneous 3D configuration. Computations are carried out with the MINOS solver of the APOLLO3® neutronics code.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
FROSch: A Fast And Robust Overlapping Schwarz Domain Decomposition Preconditioner Based on Xpetra in Trilinos.
Abstract not provided.
Heinlein, Alexander↗
FROSch: A Fast And Robust Overlapping Schwarz Domain Decomposition Preconditioner Based on Xpetra in Trilinos.
Abstract not provided.
Source record↗
Domain decomposition and multiscale mortar mixed finite element methods for linear elasticity with weak stress symmetry
Two non-overlapping domain decomposition methods are presented for the mixed finite element formulation of linear elasticity with weakly enforced stress symmetry. The methods utilize either displacement or normal stress Lagrange multiplier to impose interface continuity of normal stress or displacement, respectively. By eliminating the interior subdomain variables, the global problem is reduced to an interface problem, which is then solved by an iterative procedure. The condition number of the resulting algebraic interface problem is analyzed for both methods. A multiscale mortar mixed finite element method for the problem of interest on non-matching multiblock grids is also studied. It uses a coarse scale mortar finite element space on the non-matching interfaces to approximate the trace of the displacement and impose weakly the continuity of normal stress. A priori error analysis is performed. It is shown that, with appropriate choice of the mortar space, optimal convergence on the fine scale is obtained for the stress, displacement, and rotation, as well as some superconvergence for the displacement. Computational results are presented in confirmation of the theory of all proposed methods.
Mathematics↗
Overlapping localized exponential time differencing methods for diffusion problems
The localized exponential time differencing (ETD) based on overlapping domain decomposition has been recently introduced for extreme-scale phase field simulations of coarsening dynamics, which displays excellent parallel scalability in supercomputers. This paper serves as the first step toward building a solid mathematical foundation for this approach. We study the overlapping localized ETD schemes for a model time-dependent diffusion equation discretized in space by the standard central difference. Two methods are proposed and analyzed for solving the fully discrete localized ETD systems: the first one is based on Schwarz iteration applied at each time step and involves solving stationary problems in the subdomains at each iteration, while the second one is based on the Schwarz waveform relaxation algorithm in which time-dependent subdomain problems are solved at each iteration. The convergences of the associated iterative solutions to the corresponding fully discrete localized ETD solution and to the exact semidiscrete solution are rigorously proved. Finally, numerical experiments are also carried out to confirm theoretical results and to compare the performance of the two methods.
58 GEOSCIENCES↗
A multiscale flux basis for mortar mixed discretizations of Stokes–Darcy flows
A multiscale flux basis algorithm is developed for the Stokes–Darcy flow problem. The method is based on a non-overlapping domain decomposition algorithm, where the global problem is reduced to a coarse scale mortar interface problem that is solved by an iterative solver. Subdomain solves are required at each interface iteration, so the cost for the method without a multiscale basis can be high when the number of subdomains or the condition number of the interface problem is large. Here the proposed algorithm involves precomputing a multiscale flux basis, which consists of the flux (or velocity trace) response from each mortar degree of freedom. It is computed by each subdomain independently before the interface iteration begins. The subdomain solves required at each iteration are substituted by a linear combination of the multiscale basis. This may lead to a significant reduction in computational cost since the number of subdomain solves is fixed, depending only on the number of mortar degrees of freedom associated with a subdomain. Several numerical examples are carried out to demonstrate the efficiency of the multiscale flux basis implementation for large-scale Stokes–Darcy problems.
97 MATHEMATICS AND COMPUTING↗
Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*
In modern large-scale supercomputing applications, algebraic multigrid (AMG) is a leading choice for solving matrix equations. However, the high cost of communication relative to that of computation is a concern for the scalability of traditional implementations of AMG on emerging architectures. This paper introduces two new algebraic multilevel algorithms, algebraic multigrid domain decomposition (AMG-DD) and algebraic multigrid range decomposition (AMG-RD), that replace traditional AMG V-cycles with a fully overlapping domain decomposition approach. While the methods introduced here are similar in spirit to the geometric methods developed by Brandt and Diskin [Multigrid solvers on decomposed domains, in Domain Decomposition Methods in Science and Engineering, Contemp. Math. 157, AMS, Providence, RI, 1994, pp. 135--155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224--233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443], they differ primarily in that they are purely algebraic: AMG-RD and AMG-DD trade communication for computation by forming global composite “grids” based only on the matrix, not the geometry. (As is the usual AMG convention, “grids” here should be taken only in the algebraic sense, regardless of whether or not it corresponds to any geometry.) Another important distinguishing feature of AMG-RD and AMG-DD is their novel residual communication process that enables effective parallel computation on composite grids, avoiding the all-to-all communication costs of the geometric methods. The main purpose of this paper is to study the potential of these two algebraic methods as possible alternatives to existing AMG approaches for future parallel machines. As a result, this paper develops some theoretical properties of these methods and reports on serial numerical tests of their convergence properties over a spectrum of problem parameters.
97 MATHEMATICS AND COMPUTING↗
Stochastic multiscale flux basis for Stokes-Darcy flows
Three algorithms are developed for uncertainty quantification in modeling coupled Stokes and Darcy flows. The porous media may consist of multiple regions with different properties. The permeability is modeled as a non-stationary stochastic variable, with its log represented as a sum of local Karhunen-Loève (KL) expansions. The problem is approximated by stochastic collocation on either tensor-product or sparse grids, coupled with a multiscale mortar mixed finite element method for the spatial discretization. A non-overlapping domain decomposition algorithm reduces the global problem to a coarse scale mortar interface problem, which is solved by an iterative solver, for each stochastic realization. In the traditional domain decomposition implementation, each subdomain solves a local Dirichlet or Neumann problem in every interface iteration. To reduce this cost, two additional algorithms based on deterministic or stochastic multiscale flux basis are introduced. The basis consists of the local flux (or velocity trace) responses from each mortar degree of freedom. It is computed for each subdomain independently before the interface iteration begins. The use of the multiscale flux basis avoids the need for subdomain solves on each iteration. The deterministic basis is computed at each stochastic collocation and used only at this realization. The stochastic basis is formed by further looping over all local realizations of a subdomain's KL region before the stochastic collocation begins. It is used over multiple realizations. Numerical tests are presented to illustrate the performance of the three algorithms, with the stochastic multiscale flux basis showing significant savings in computational cost compared to the other two algorithms.
97 MATHEMATICS AND COMPUTING↗
A Multiple-Set Overlapping-Domain Decomposed Monte Carlo Synthetic Acceleration Method for Linear Systems
We present a multiple-set overlapping-domain decomposed strategy for parallelizing the Monte Carlo Synthetic Acceleration method. Monte Carlo Synthetic Acceleration methods use the Neumann-Ulam class of Monte Carlo solvers for linear systems to accelerate a fixed-point iteration sequence. Effective parallel algorithms for these methods require the parallelization of the underlying Neumann-Ulam solvers. To do this in a domain decomposed environment, we borrow strategies traditionally implemented in Monte Carlo particle transport to parallelize the problem. The parallel Neumann-Ulam and multiple-set overlapping-domain decomposition algorithms are presented along with parallel scaling data for the resulting implementation using the Titan Cray XK7 machine at Oak Ridge National Laboratory.
Computer Science↗
Localized Exponential Time Differencing Method for Shallow Water Equations: Algorithms and Numerical Study
Here, we explore the performance of the exponential time differencing (ETD) method applied to the rotating shallow water equations. Comparing with explicit time stepping of the same order accuracy in time, the ETD algorithms could reduce the computational time in many cases by allowing the use of large time step sizes while still maintaining numerical stability. To accelerate the ETD simulations, we propose a localized approach that synthesizes the ETD method and overlapping domain decomposition. By dividing the original problem into many subdomain problems of smaller sizes and solving them locally, the proposed approach could speed up the calculation of matrix exponential vector products. Several standard test cases for shallow water equations of one or multiple layers are considered. The results show great potential of the localized ETD method for high-performance computing because each subdomain problem can be naturally solved in parallel at every time step.
58 GEOSCIENCES↗
Coupling lattice Boltzmann and continuum equations for flow and reactive transport in porous media.
In spatially and temporally localized instances, capturing sub-reservoir scale information is necessary. Capturing sub-reservoir scale information everywhere is neither necessary, nor computationally possible. The lattice Boltzmann Method for solving pore-scale systems. At the pore-scale, LBM provides an extremely scalable, efficient way of solving Navier-Stokes equations on complex geometries. Coupling pore-scale and continuum scale systems via domain decomposition. By leveraging the interpolations implied by pore-scale and continuum scale discretizations, overlapping Schwartz domain decomposition is used to ensure continuity of pressure and flux. This approach is demonstrated on a fractured medium, in which Navier-Stokes equations are solved within the fracture while Darcy's equation is solved away from the fracture Coupling reactive transport to pore-scale flow simulators allows hybrid approaches to be extended to solve multi-scale reactive transport.
97 MATHEMATICS AND COMPUTING↗
VARIANCE ESTIMATION IN DOMAIN DECOMPOSED MONTE CARLO EIGENVALUE CALCULATIONS
The number of tallies performed in a given Monte Carlo calculation is limited in most modern Monte Carlo codes by the amount of memory that can be allocated on a single processor. By using domain decomposition, the calculation is now limited by the total amount of memory available on all processors, allowing for significantly more tallies to be performed. However, decomposing the problem geometry introduces significant issues with the way tally statistics are conventionally calculated. In order to deal with the issue of calculating tally variances in domain decomposed environments for the Shift hybrid Monte Carlo code, this paper presents an alternative approach for reactor scenarios in which an assumption is made that once a particle leaves a domain, it does not reenter the domain. Particles that reenter the domain are instead treated as separate independent histories. This assumption introduces a bias that inevitably leads to under-prediction of the calculated variances for tallies within a few mean free paths of the domain boundaries. However, through the use of different decomposition strategies, primarily overlapping domains, the negative effects of such an assumption can be significantly reduced to within reasonable levels.
42 ENGINEERING↗
A Fundamentally New Coupled Approach to Contact Mechanics via the Dirichlet‐Neumann Schwarz Alternating Method
Contact phenomena are crucial for understanding the behavior of mechanical systems. However, existing computational approaches for simulating mechanical contact often face numerical challenges, such as inaccurate physical predictions, energy conservation errors, and unwanted oscillations. Here, we introduce an alternative technique for simulating dynamic contact based on the non‐overlapping Schwarz alternating method, originally developed for domain decomposition. In multibody contact scenarios, this method treats each body as a separate, non‐overlapping domain and prevents interpenetration using an alternating Dirichlet–Neumann iterative process. This approach has a strong theoretical foundation, eliminates the need for contact constraints, and offers flexibility, making it ideal for multiscale and multiphysics applications. We conducted a numerical comparison between the Schwarz method and traditional methods, such as the Lagrange multiplier and penalty methods, focusing on a benchmark impact problem. Our results indicate that the Schwarz alternating method outperforms traditional methods in several key areas: it provides more accurate predictions for various measurable quantities and demonstrates exceptional energy conservation capabilities. To address unwanted oscillations in contact velocities and forces, we explored various algorithms and stabilization techniques, ultimately opting for the naïve‐stabilized Newmark scheme for its simplicity and effectiveness. Additionally, we validated the efficiency of the Schwarz method in a three‐dimensional impact problem, highlighting its inherent capacity to accommodate different mesh topologies, time‐integration schemes, and time steps for each interacting body.
Schwarz alternating method↗