Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Runge Kutta Methods”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Computational Study of Variable Fuel-Air Ratio and Hydrogen Doping in a Rotating Detonation Engine

Rotating detonation engines (RDEs) hold great promise as a technology for powering aviation engines. The pressure gain that results from continuously traversing detonation waves enables high theoretical performance compared to deflagration-based combustion. However, the harsh operating conditions inside an RDE restrict the availability of suitable experimental diagnostics to study these systems in detail and the range of spatial and temporal scales render numerical simulations of these systems difficult. In this study, we have combined adaptive mesh refinement and a robust shock-capturing approach to study RDE systems computationally using the compressible, reactive solver PeleC. Multi-species transport along with compressible Navier-Stokes equations are solved in the model along with finite-rate chemistry. Complex geometries are represented using an embedded boundary method with second-order spatial accuracy and the system is evolved in time using a second-order Runge-Kutta method. We present studies of a methane-air RDE system that is doped with varying levels of hydrogen. Our analysis focusses on how fuel mixture and doping levels effect the detonation flame structure and the generation of multiple wave modes.

ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2023

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Fourth-Order Embedded Boundary Finite Volume Method for the Unsteady Stokes Equations with Complex Geometries

A fourth-order finite volume embedded boundary (EB) method is presented for the unsteady Stokes equations. The algorithm represents complex geometries on a Cartesian grid using EB, employing a technique to mitigate the ``small cut-cell"" problem without mesh modifications, cell merging, or state redistribution. Spatial discretizations are based on a weighted least-squares technique that has been extended to fourth-order operators and boundary conditions, including an approximate projection to enforce the divergence-free constraint. Solutions are advanced in time using a fourth-order additive implicit-explicit Runge-Kutta method, with the viscous and source terms treated implicitly and explicitly, respectively. Formal accuracy of the method is demonstrated with several grid convergence studies, and results are shown for an application with a complex bio-inspired material. In conclusion, the developed method achieves fourth-order accuracy and is stable despite the pervasive small cells arising from complex geometries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Anisotropic fluid dynamical simulations of heavy-ion collisions

We present VAH, a (3+1)–dimensional simulation that evolves the far-from-equilibrium quark-gluon plasma produced in ultrarelativistic heavy-ion collisions with anisotropic fluid dynamics. We solve the hydrodynamic equations on an Eulerian grid using the Kurganov–Tadmor algorithm in combination with a new adaptive Runge–Kutta method. Our numerical scheme allows us to start the simulation soon after the nuclear collision, largely avoiding the need to integrate it with a separate pre-equilibrium dynamics module. We test the code's performance by simulating on the Eulerian grid conformal and non-conformal Bjorken flow as well as conformal Gubser flow, whose (0+1)–dimensional solutions are precisely known. Finally, we compare non-conformal anisotropic hydrodynamics to second-order viscous hydrodynamics in central Pb+Pb collisions and find that the former's longitudinal flow profile responds more consistently to the fluid's gradients along the spacetime rapidity direction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Storm Surge Modeling as an Application of Local Time-Stepping in MPAS-Ocean

This paper presents the first practical application of local time-stepping (LTS) schemes in the Model for Prediction Across Scales-Ocean (MPAS-O). We use LTS schemes in a single-layer, global ocean model that predicts the storm surge around the eastern coast of the United States during Hurricane Sandy. The variable-resolution meshes used are of unprecedentedly high resolution in MPAS-O, containing cells as small as 125 m wide in Delaware Bay. It is shown that a particular, third-order LTS scheme (LTS3) produces sea-surface height solutions that are of comparable quality to solutions produced by the classical four-stage, fourth-order Runge-Kutta method (RK4) with a uniform time step on the same meshes. Furthermore, LTS3 is up to 35% faster in the best cases considered, where the number of cells using the coarse time-step relative to those using the fine time-step is as low as 1:1. This shows that LTS schemes are viable for use in MPAS-O with the added benefit of substantially less computational cost. The results of these performance experiments inform us of the requirements for efficient mesh design and configuration of LTS regions for LTS schemes. In particular, we see that for LTS to be efficient on a given mesh, it is important to have enough cells using the coarse time-step relative to those using the fine time-step, typically at least 1:5 to see an increase in performance.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Clebsch canonization of Lie–Poisson systems

We propose a systematic procedure called the Clebsch canonization for obtaining a canonical Hamiltonian system that is related to a given Lie–Poisson equation via a momentum map. We describe both coordinate and geometric versions of the procedure, the latter apparently for the first time. We also find another momentum map so that the pair of momentum maps constitute a dual pair under a certain condition. The dual pair gives a concrete realization of what is commonly referred to as collectivization of Lie–Poisson systems. It also implies that solving the canonized system by symplectic Runge–Kutta methods yields so-called collective Lie–Poisson integrators that preserve the coadjoint orbits and hence the Casimirs exactly. We give a couple of examples, including the Kida vortex and the heavy top on a movable base with controls, which are Lie–Poisson systems on $\mathfrak{so}$ (2,1)* and ($\mathfrak{se}$ (3) ⋉ $\mathbb{R}^3$)* and, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fixed Bit Rotary Drilling Failure Criteria Effect on Drilling Vibration

Polycrystalline diamond compact (PDC) bit use has been expanded to geothermal drilling applications due to their improved performance in drilling compared to roller cone bits. Multiple vibration models have been developed yet and there are limited use of field data to study the ability of numerical vibration model to predict recorded vibration in the field. The objective of this paper is to evaluate the capabilities of two different rock-bit interaction models with two different ROP formulations for predicting the actual behavior seen in the field. The first model (Model-I) considers the rock-bit interaction, incorporating the effect of subsurface formation characteristics. The second model (Model-II) is a PDC bit model that uses calculated threshold weight-on-cutter (WOCt) to study the interaction of the bit with the rock surface. The models, which couple the drill stem axial and torsional motions, are solved numerically using the fourth-order Runge-Kutta method and compared with recorded downhole drilling data from the Chocolate Mountain Aerial Gunnery Range (CMAGR) geothermal well located in California. An 8–½" PDC bit with 8 blades was modeled and vibration simulation was performed to investigate stick-slip vibrations at 1400 ft. depth. Simulation results using field data indicate that Model-II encounters a low range of stick-slip severity (SSV) as compared to Model-I, which is in the moderate range. Comparison with the field value for SSV shows Model-II is the best representative of the field case for this depth. The sensitivity analysis shows that results are sensitive to model constants making prediction of SSV from models uncertain.

15 GEOTHERMAL ENERGY↗
DOE OSTI2022

Entropy–Preserving and Entropy–Stable Relaxation IMEX and Multirate Time–Stepping Methods

In this work, we propose entropy-preserving and entropy-stable partitioned Runge–Kutta (RK) methods. In particular, we extend the explicit relaxation Runge–Kutta methods to IMEX–RK methods and a class of explicit second-order multirate methods for stiff problems arising from scale-separable or grid-induced stiffness in a system. The proposed approaches not only mitigate system stiffness but also fully support entropy-preserving and entropy-stability properties at a discrete level. The key idea of the relaxation approach is to adjust the step completion with a relaxation parameter so that the time-adjusted solution satisfies the entropy condition at a discrete level. The relaxation parameter is computed by solving a scalar nonlinear equation at each timestep in general; however, as for a quadratic entropy function, we theoretically derive the explicit form of the relaxation parameter and numerically confirm that the relaxation parameter works the Burgers equation. Several numerical results for ordinary differential equations and the Burgers equation are presented to demonstrate the entropy-conserving/stable behavior of these methods. We also compare the relaxation approach and the incremental direction technique for the Burgers equation with and without a limiter in the presence of shocks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A High-Order Eulerian–Lagrangian Runge–Kutta Finite Volume (EL–RK–FV) Method for Scalar Nonlinear Conservation Laws

Abstract We present a class of high-order Eulerian–Lagrangian Runge–Kutta finite volume methods that can numerically solve Burgers’ equation with shock formations, which could be extended to general scalar conservation laws. Eulerian–Lagrangian (EL) and semi-Lagrangian (SL) methods have recently seen increased development and have become a staple for allowing large time-stepping sizes. Yet, maintaining relatively large time-stepping sizes post shock formation remains quite challenging. Our proposed scheme integrates the partial differential equation on a space-time region partitioned by linear approximations to the characteristics determined by the Rankine–Hugoniot jump condition. We trace the characteristics forward in time and present a merging procedure for the mesh cells to handle intersecting characteristics due to shocks. Following this partitioning, we write the equation in a time-differential form and evolve with Runge–Kutta methods in a method-of-lines fashion. High-resolution methods such as ENO and WENO-AO schemes are used for spatial reconstruction. Extension to higher dimensions is done via dimensional splitting. Numerical experiments demonstrate our scheme’s high-order accuracy and ability to sharply capture post-shock solutions with large time-stepping sizes.

Chen, Jiajie↗
DOE OSTI2021

A unified formulation of splitting-based implicit time integration schemes

Splitting-based time integration approaches such as fractional step, alternating direction implicit, operator splitting, and locally one dimensional methods partition the system of interest into components, and solve individual components implicitly in a cost-effective way. Here this work proposes a unified formulation of splitting time integration schemes in the framework of general-structure additive Runge–Kutta (GARK) methods. Specifically, we develop implicit-implicit (IMIM) GARK schemes, provide the order conditions for this class, and explain their application to partitioned systems of ordinary differential equations. We show that classical splitting methods belong to the IMIM GARK family, and therefore can be studied in this unified framework. New IMIM-GARK splitting methods are developed and tested using parabolic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Spatially Quasi-Periodic Water Waves of Infinite Depth

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.

Wilkening, Jon (ORCID:0000000327827596)↗
DOE OSTI2026

New Time Integrators and Capabilities in SUNDIALS Versions 6.2.0-7.4.0

SUNDIALS is a well-established numerical library that provides robust and efficient time integrators and nonlinear solvers. This article overviews several significant improvements and new features added over the last 3 years to support scientific simulations run on high-performance computing systems. Notably, three new classes of one-step methods have been implemented: low storage Runge–Kutta, symplectic partitioned Runge–Kutta, and operator splitting. In addition, we describe new timestep adaptivity support for multirate methods, adjoint sensitivity analysis capabilities for explicit Runge–Kutta methods, additional options for Anderson acceleration in nonlinear solvers, and improved error handling and logging.

Computer science↗
DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Efficient and flexible multirate temporal adaptivity

In this work we present two new families of multirate time step adaptivity controllers, that are designed to work with embedded multirate infinitesimal (MRI) time integration methods for adapting time steps when solving problems with multiple time scales. We compare these controllers against competing approaches on two benchmark problems, showing that the proposed methods offer dramatically improved performance and flexibility. The combination of embedded MRI methods and the proposed controllers enable adaptive simulations of problems with a potentially arbitrary number of time scales, achieving high accuracy while maintaining low computational cost. Additionally, we introduce a new set of embeddings for the family of explicit multirate exponential Runge–Kutta (MERK) methods of orders 2 through 5, resulting in the first-ever fifth-order embedded MRI method. Finally, we compare the performance of a wide range of embedded MRI methods on our benchmark problems to provide guidance on how to select an appropriate MRI method and multirate controller.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Numerical methods and hypoexponential approximations for gamma distributed delay differential equations

Abstract Gamma distributed delay differential equations (DDEs) arise naturally in many modelling applications. However, appropriate numerical methods for generic gamma distributed DDEs have not previously been implemented. Modellers have therefore resorted to approximating the gamma distribution with an Erlang distribution and using the linear chain technique to derive an equivalent system of ordinary differential equations (ODEs). In this work, we address the lack of appropriate numerical tools for gamma distributed DDEs in two ways. First, we develop a functional continuous Runge–Kutta (FCRK) method to numerically integrate the gamma distributed DDE without resorting to Erlang approximation. We prove the fourth-order convergence of the FCRK method and perform numerical tests to demonstrate the accuracy of the new numerical method. Nevertheless, FCRK methods for infinite delay DDEs are not widely available in existing scientific software packages. As an alternative approach to solving gamma distributed DDEs, we also derive a hypoexponential approximation of the gamma distributed DDE. This hypoexponential approach is a more accurate approximation of the true gamma distributed DDE than the common Erlang approximation but, like the Erlang approximation, can be formulated as a system of ODEs and solved numerically using standard ODE software. Using our FCRK method to provide reference solutions, we show that the common Erlang approximation may produce solutions that are qualitatively different from the underlying gamma distributed DDE. However, the proposed hypoexponential approximations do not have this limitation. Finally, we apply our hypoexponential approximations to perform statistical inference on synthetic epidemiological data to illustrate the utility of the hypoexponential approximation.

97 MATHEMATICS AND COMPUTING↗