Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “explicit time integration”

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.

At least 55 records · Page 3

A scalable exponential-DG approach for nonlinear conservation laws: With application to Burger and Euler equations

In this work, we propose an Exponential DG framework for partial differential equations. We decompose 7 governing equations into linear and nonlinear parts to which we apply the discontinuous Galerkin 8 (DG) spatial discretization. In particular, we construct the linear part using Jacobian that effectively 9 capture stiff characteristics in the system. The former is integrated analytically, whereas the latter 10 is approximated. This approach i) is stable with a large Courant number (Cr > 1); ii) supports 11 high-order solutions both in time and space; iii) is computationally favorable compared to IMEX 12 DG methods with no preconditioner; iv) becomes comparable to explicit RKDG methods on uniform 13 mesh and beneficial on non-uniform grid for Euler equations; v) is scalable in a modern massively 14 parallel computing architecture due to its explicit nature of exponential time integrators and com15 pact communication stencil of DG method. Numerical results demonstrate the performance of our 16 proposed methods through various examples. We also discuss the stability and convergence analysis 17 for our exponential DG scheme in the context of Burgers equation.

42 ENGINEERING↗

Implicit-Explicit Multirate Infinitesimal GARK Methods

This work focuses on the development of a new class of high-order accurate methods for multirate time integration of systems of ordinary differential equations. Unlike other recent work in this area, the proposed methods support mixed implicit-explicit (IMEX) treatment of the slow time scale. In addition to allowing this slow time scale flexibility, the proposed methods utilize a so-called infinitesimal formulation for the fast time scale through definition of a sequence of modified “fast" initial-value problems that may be solved using any viable algorithm. We name the proposed class as implicit-explicit multirate infinitesimal generalized-structure additive Runge--Kutta (IMEX-MRI-GARK) methods. In addition to defining these methods, we prove that they may be viewed as specific instances of GARK methods and derive a set of order conditions on the IMEX-MRI-GARK coefficients to guarantee both third and fourth order accuracy for the overall multirate method. Additionally, we provide three specific IMEX-MRI-GARK methods, two of order three and one of order four. We conclude with numerical simulations on two multirate test problems, demonstrating the methods' predicted convergence rates and comparing their efficiency against both legacy IMEX multirate schemes and recent third and fourth order implicit MRI-GARK methods.

97 MATHEMATICS AND COMPUTING↗

An immersed interface method for the 2D vorticity-velocity Navier-Stokes equations with multiple bodies

We present an immersed interface method for the vorticity-velocity form of the 2D Navier Stokes equations that directly addresses challenges posed by nonconvex immersed bodies, multiply connected domains, and the calculation of force distributions on immersed surfaces. The immersed interface method is re-interpreted as a polynomial extrapolation of flow quantities and boundary conditions into the immersed solid bodies, reducing computational cost and enabling simulations with nonconvex bodies that could not be discretized with previous immersed interface methods. In the flow, the vorticity transport equation is discretized using a conservative finite difference scheme and explicit Runge-Kutta time integration. The velocity reconstruction problem is transformed to a scalar Poisson equation that is discretized with conservative finite differences, and solved using an FFT-accelerated iterative algorithm. The use of conservative differencing throughout leads to exact enforcement of a discrete Kelvin's theorem, allowing for simulations with multiply connected domains and outflow boundaries that have challenged other immersed interface vortex methods. We also explore novel methods for recovering time-dependent pressure distributions on immersed bodies within a vorticity-based method and present a novel control volume formulation for recovering aerodynamic moments from only the vorticity and velocity fields. The method achieves second order spatial accuracy and third order temporal accuracy, and is validated on a variety of 2D flows in internal and free-space domains.

97 MATHEMATICS AND COMPUTING↗

Photochemically Induced Acousto-optics Fluid Simulations

PIAFS is a finite-difference code to solve the compressible Navier-Stokes equations with chemical heating on Cartesian grids. It models chemical reactions of air (oxygen and carbon dioxide) with ozone subject to radiation. It uses a high-order WENO spatial discretization and explicit Runge-Kutta time integration. It is capable of parallel simulations using MPI. The code is written in C/C++.

Oudin, AlbertineN [Lawrence Livermore National Lab↗

Implicit fast sweeping method for hyperbolic systems of conservation laws

Implicit time-accurate methods are often used to integrate stiff problems where explicit schemes impose severe time step restrictions. This paper presents an efficient numerical framework based on the Fast Sweeping Method (FSM) for solving linear and nonlinear hyperbolic systems of conservation laws. The solution at each discrete location is computed by sweeping the numerical domain in several predetermined directions that follow the causality of the characteristic families. The use of a fractional step strategy eliminates the need for a solution selection criterion while one-sided stencils limit the number of sweeps to at most 2 d for d space dimensions. This work focuses on the first-order implicit upwind method since it constitutes the building block for high-order conservative schemes. For problems where the degree of stiffness evolves over time, implicit-explicit hybridization can be accomplished with the same algorithm by simply switching the stencil at each time level. As opposed to traditional implicit solvers, the sweeping method does not require a local time linearization of the fluxes thereby preserving the nonlinear stability properties of the original implicit scheme. It also avoids the large computational and memory requirements associated with solving large block-diagonal systems of equations. Here, a series of one- and two-dimensional test cases are presented for the inviscid Burgers' equation and the reactive Euler equations. The results indicate that the implicit FSM can allow a major reduction in the number of time steps even in the presence of discontinuous solution profiles.

74 ATOMIC AND MOLECULAR PHYSICS↗

One-sweep moment-based semi-implicit-explicit integration for gray thermal radiation transport

Thermal radiation transport (TRT) is a time dependent, high dimensional partial integro-differential equation. In practical applications such as inertial confinement fusion, TRT is coupled to other physics such as hydrodynamics, plasmas, etc., and the timescales one is interested in capturing are often much slower than the radiation timescale. As a result, TRT is treated implicitly, and due to its stiffness and high dimensionality, is often a dominant computational cost in multiphysics simulations. Here we develop a new approach for implicit-explicit (IMEX) integration of gray TRT in the deterministic SN setting, which requires only one sweep per stage, with the simplest first-order method requiring only one sweep per time step. The partitioning of equations is done via a moment-based high-order low-order formulation of TRT, where the streaming operator and first two moments are used to capture the asymptotic stiff regimes of the streaming limit and diffusion limit. Absorption-reemission is treated explicitly, and although stiff, is sufficiently damped by the implicit solve that we achieve stable accurate time integration without incorporating the coupling of the high order and low order equations implicitly. Due to nonlinear coupling of the high-order and low-order equations through temperature-dependent opacities, to facilitate IMEX partitioning and higher-order methods, we use a semi-implicit integration approach amenable to nonlinear partitions. In conclusion, results are demonstrated on thick Marshak and crooked pipe benchmark problems, demonstrating orders of magnitude improvement in accuracy and wallclock compared with the standard first-order implicit integration typically used.

97 MATHEMATICS AND COMPUTING↗

Implicit–explicit multirate infinitesimal stage-restart methods

Implicit–Explicit (IMEX) methods are flexible numerical time integration methods which solve an initial-value problem (IVP) that is split into stiff and nonstiff processes with the goal of lower computational costs than a purely implicit or explicit approach. A complementary form of flexible IVP solvers are multirate infinitesimal methods for problems split into fast- and slow-changing dynamics, that solve a multirate IVP by evolving a sequence of “fast” IVPs using any suitably accurate algorithm. This article introduces a new class of high-order implicit–explicit multirate methods that are designed for multirate IVPs in which the slow-changing dynamics are further split in an IMEX fashion. This new class, which we call implicit–explicit multirate infinitesimal stage-restart (IMEX-MRI-SR), both improves upon the previous implicit–explicit multirate infinitesimal generalized-structure additive Runge Kutta (IMEX-MRI-GARK) methods by allowing for far easier creation of new embedded methods, and extends multirate exponential Runge Kutta (MERK) methods by allowing the fast-changing dynamics to be nonlinear and the methods to be implicit. We leverage GARK theory to derive conditions for orders of accuracy up to four, and we provide second- and third-order accurate example methods, which are the first known embedded MRI methods with IMEX structure. We then perform numerical simulations demonstrating convergence rates and computational performance in both fixed-step and adaptive-step settings.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

The Schwarz alternating method for transient solid dynamics

Abstract In our earlier work, we formulated the Schwarz alternating method as a means for concurrent multiscale coupling in finite deformation solid mechanics for quasi‐static problems. Herein, we advance this method for the study of transient dynamic multiscale solid mechanics problems where information is exchanged back and forth between small and large scales. The extension to dynamics relies on the notion of a global time stepper. Within each global time step, the subdomains are coupled by the standard Schwarz iterative process. Remarkably, each subdomain can use its own time step or even its own time integrator to advance its solution in time, provided that they synchronize at each global time step. We study the performance of the Schwarz method on several examples designed for this purpose. Our numerical experiments demonstrate that the method is capable of coupling regions with different mesh resolutions, different element types, and different time integration schemes (e.g., implicit and explicit), all without introducing any artifacts that afflict other coupling methods for transient dynamics. Finally, we apply the dynamic Schwarz alternating method to the simulation of a bolted joint subjected to dynamic loading, as a demonstration of the performance of the method in a realistic scenario.

Mota, Alejandro↗

On Properties of Adjoint Systems for Evolutionary PDEs

We investigate the geometric structure of adjoint systems associated with evolutionary partial differential equations at the fully continuous, semi-discrete, and fully discrete levels and the relations between these levels. We show that the adjoint system associated with an evolutionary partial differential equation has an infinite-dimensional Hamiltonian structure, which is useful for connecting the fully continuous, semi-discrete, and fully discrete levels. We subsequently address the question of discretize-then-optimize versus optimize-then-discrete for both semi-discretization and time integration, by characterizing the commutativity of discretize-then-optimize methods versus optimize-then-discretize methods uniquely in terms of an adjoint-variational quadratic conservation law. For Galerkin semi-discretizations and one-step time integration methods in particular, we explicitly construct these commuting methods by using structure-preserving discretization techniques.

97 MATHEMATICS AND COMPUTING↗

Towards modelling AR Sco: generalized particle dynamics and strong radiation-reaction regimes

Numerical simulations of relativistic plasmas have become more feasible, popular, and crucial for various astrophysical sources with the availability of computational resources. The necessity for high-accuracy particle dynamics is especially highlighted in pulsar modelling due to the extreme associated electromagnetic fields and particle Lorentz factors. Including the radiation-reaction force in the particle dynamics adds even more complexity to the problem, but is crucial for such extreme astrophysical sources. We have also realized the need for such modelling concerning magnetic mirroring and particle injection models proposed for AR Sco, the first white dwarf pulsar. This paper demonstrates the benefits of using higher-order explicit numerical integrators with adaptive time-step methods to solve the full particle dynamics with radiation-reaction forces included. We show that for standard test scenarios, namely various combinations of uniform E- and B-fields and a static dipole B-field, the schemes we use are equivalent to and in extreme field cases outperform standard symplectic integrators in accuracy. We show that the higher-order schemes have massive computational time improvements due to the adaptive time-steps we implement, especially in non-uniform field scenarios and included radiation reaction where the particle gyro-radius rapidly changes. When balancing accuracy and computational time, we identified the adaptive Dormand–Prince eighth-order scheme to be ideal for our use cases. The schemes we use maintain accuracy and stability in describing the particle dynamics and we indicate how a charged particle enters radiation-reaction equilibrium and conforms to the analytical Aristotelian Electrodynamics expectations.

79 ASTRONOMY AND ASTROPHYSICS↗

Interpenetrating Plasma Simulations

This project investigated multifluid models for simulating interpenetrating plasmas. These models solve the Euler equations for each plasma stream along with an appropriate model for electron dynamics. The project developed a novel code, Euclid, that simulates these models using high-order conservative spatial discretization methods and explicit and semi-implicit time integration methods. Euclid was used to solve several multifluid test cases representative of plasma dynamics in high-energy density physics experiments. Kinetic simulations of interpenetrating flows using the LOKI code revealed novel physical effects of the ion-ion streaming instability. A new multi-flow collision operator was developed for the LOKI code. A simple model of the ion-ion streaming instability was also developed. Several presentations were given on the project results; three journal articles have been published, one has been submitted, and two are planned.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

thornado-transport: Anderson- and GPU-accelerated nonlinear solvers for neutrino-matter coupling

Algorithms for neutrino-matter coupling in core-collapse supernovae (CCSNe) are investigated in the context of a spectral two-moment model, which is discretized in space with the discontinuous Galerkin method, integrated in time with implicit-explicit (IMEX) methods, and implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado). The model considers electron neutrinos and antineutrinos and tabulated opacities from Bruenn (1985), which includes neutrino-electron scattering and pair processes. The nonlinear system arising from implicit time discretization of the equations governing neutrino-matter coupling is iterated to convergence using Anderson-accelerated fixed-point methods, which avoid formation of Jacobians and inversion of dense linear systems. Numerical experiments show that, for a given tolerance, a nested iteration scheme which aims to reduce opacity evaluations can lower the computational cost. Our initial port to GPUs, using both OpenMP and OpenACC, shows an overall speedup of up to ~ 100× when compared to results using a single CPU core. These results indicate that the algorithms implemented in thornado are well-suited to GPU acceleration.

Laiu, Paul↗

An error-controlled adaptive time-stepping method for particle advancement in coupled CFD-DEM simulations

Coupled Computational-Fluid-Dynamics (CFD) and Discrete-Element-Method (DEM) models provide an accurate description of multiphase physical systems where a solid granular particle phase exists in an underlying gaseous continuous medium. The time integration of the granular phase in these simulations is typically handled using an explicit scheme with a constant time-step among all particles that is invariant in time to resolve inter-particle collisions. A locally third-order accurate adaptive time integration technique for particles that employs an embedded locally second-order scheme for error determination is presented in this work. The particle time-step size is dynamically adapted based on solution error, thus leading to significant savings in computational time. The efficacy of our scheme is quantified using four test cases of varying complexity (binary collision, homogeneous cooling system, fluidized bed and hopper discharge). The adaptive time-stepping method exhibits improved performance (~ 2–3 times in most of the cases studied) compared to three commonly used non-adaptive time-step methods (first-order Euler-explicit, second-order Adams-Bashforth and third-order Runge-Kutta schemes), while maintaining the same level of accuracy and parallel scalability.

42 ENGINEERING↗

Simulation of Reverse Osmosis Membrane Compaction Using Material Point Method (MPM)

Access to fresh drinking water in the future requires effective management of industrial wastewater and water purification from available resources. In this study, we present the simulation methodology and the analysis of a Reverse Osmosis (RO) membrane under various pressure conditions using the Material Point Method (MPM). In contrast to other numerical methods, MPM solves the continuum governing equations on material points in a Lagrangian framework. The method does not require a grid connecting the material points hence making it suitable to simulate large deformations during membrane compaction. The time integration is carried out using the explicit Euler method, while the spatial discretization is performed using linear or cubic-spline shape functions. A series of planar images containing detailed pore structures obtained from X-ray tomography experiments is converted to a three-dimensional collection of material points to simulate the membrane. Compressive loads are applied to the top layer of the membrane to simulate the experiments. The membrane deformation and pore size distribution before and after load application are reported and compared with the experimental measurements. The presentation discusses the numerical methods used, the performance of the solver on high-performance computing machines, and the results of membrane compaction in detail.

ENGINEERING,MATHEMATICS AND COMPUTING↗

Simulation of Reverse Osmosis Membrane Compaction Using Material Point Method

Reverse Osmosis (RO) is a promising technology to address the impending water-crisis in the upcoming decades. RO at high salinities and high pressures is challenging due to membrane compaction that changes its porosity and permeability. In this study, we present a simulation methodology for membrane structural mechanics to understand pore size distribution and permeability variations under high pressure. We use the material point method (MPM), that solves the solid mechanics equations in a Lagrangian framework. MPM provides many features that make it well-suited for simulating mesoporous membranes. The Lagrangian framework allows for large deformations, easy integration of constitutive models and direct import of complex geometries as particles. The spatial discretization in our MPM solver is achieved using linear or cubic-spline shape functions while the time integration is carried out using the explicit Euler method. A series of images containing detailed pore structures obtained from X-ray tomography is first converted to a collection of material points. Compressive loads are applied to the top layer of the membrane to simulate the application of pressure. The membrane deformation and pore size distribution before and after load application are reported and compared with the experimental measurements. The presentation discusses the numerical methods used, the performance of the solver on high-performance computing machines, and the results of membrane compact in detail.

compaction↗

Scale-bridging with the extended/generalized finite element method for linear elastodynamics

This paper presents an extended/generalized finite element method for bridging scales in linear elastodynamics in the absence of scale separation. More precisely, the GFEMgl framework is expanded to enable the numerical solution of multiscale problems through the automated construction of specially-tailored shape functions, thereby enabling high-fidelity finite element modeling on simple, fixed finite element meshes. Furthermore, this introduces time-dependencies in the shape functions in that they are subject to continuous adaptation with time. The temporal aspects of the formulation are investigated by considering the Newmark-β time integration scheme, and the efficacy of mass lumping strategies is explored in an explicit time-stepping scheme. This method is demonstrated on representative wave propagation examples as well as a dynamic fracture problem to assess its accuracy and flexibility.

36 MATERIALS SCIENCE↗

Accelerating discrete dislocation dynamics simulations with graph neural networks

Discrete dislocation dynamics (DDD) is a widely employed computational method to study plasticity at the mesoscale that connects the motion of dislocation lines to the macroscopic response of crystalline materials. However, the computational cost of DDD simulations remains a bottleneck that limits its range of applicability. Here, we introduce a new DDD-GNN framework in which the expensive time-integration of dislocation motion is entirely substituted by a graph neural network (GNN) model trained on DDD trajectories. As a first application, we demonstrate the feasibility and potential of our method on a simple yet relevant model of a dislocation line gliding through an array of obstacles. We show that the DDD-GNN model is stable and reproduces very well unseen ground-truth DDD simulation responses for a range of straining rates and obstacle densities, without the need to explicitly compute nodal forces or dislocation mobilities during time-integration. Our approach opens new promising avenues to accelerate DDD simulations and to incorporate more complex dislocation motion behaviors.

36 MATERIALS SCIENCE↗

ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods

We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge–Kutta methods, ARKODE supports one-step methods designed to treat additive splittings of the IVP, including implicit-explicit (ImEx) additive Runge–Kutta methods and multirate infinitesimal (MRI) methods. We present the role of ARKODE within the SUNDIALS suite of time integration and nonlinear solver libraries, the core ARKODE infrastructure for utilities common to large classes of one-step methods, as well as its use of “time stepper” modules enabling easy incorporation of novel algorithms into the library. Numerical results show example problems of increasing complexity, highlighting the algorithmic flexibility afforded through this infrastructure, and include a larger multiphysics application leveraging multiple algorithmic features from ARKODE and SUNDIALS.

97 MATHEMATICS AND COMPUTING↗