Intrastep, Stage-Value Predictors for Diagonally-Implicit Runge-Kutta Methods
Explore the source record for details and available documents.
Diagonally-Implicit Runge-Kutta↗
SEARCH · Search NASA
Results for “Diagonally-Implicit Runge-Kutta”
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.
Intrastep, Stage-Value Predictors for Diagonally-Implicit Runge-Kutta Methods
To better identify the necessary attributes of good stage-value predictors (SVPs), numerous SVPs are designed for an existing: ESDIRK4(3)7L[2]SA [26] and a new: ESDIRK4(3)8L[2]SA scheme.1 Both are stifflyaccurate, stage-order two, explicit, singly-diagonally implicit Runge–Kutta (ESDIRK) schemes. Tradeoffs are studied in the parameter spaces enforcing the constraints on accuracy, linear stability, nonlinear stability and coefficient size to determine which objectives correlate with effective predictors. The SVPs are tested on three challenging external aerodynamics problems [107 − 108 degrees of freedom (DoFs)], each with a different level of stiffness. The problems include two 3D airfoils simulations and one canonical turbulence simulation. All simulations use the compressible Navier-Stokes equations (CNSE). An entropy stable spectral collocation formulation is used for discretizing the spatial terms in the equations. Simulations are performed at a wide variety of temporal error tolerances. Problems that are sufficiently stiff (e.g., lax temporal error tolerances) benefit from SVPs designed with second-order accuracy and stability properties: A-stability, and L-stability, rather than high accuracy constraints. Simulations with modest stiffness (e.g., strict error tolerances) are better suited for SVPs designed using high accuracy constraints. Designing SVPs with enhanced stability properties is tedious but worthwhile. Simulation times are reduced with optimal SVPs by as much as 100% on some stages, with combined stepwise improvements of between 50 − 100% for both methods. A comparative study is performed with the two aforementioned methods as well as four other ESDIRKs. The newly designed ESDIRK4(3)8L[2]SA with γ ≈ 1/10, proves to be the most efficient of the six tested ESDIRK schemes simulating the CNSE.
Diagonally-Implicit Runge-Kutta↗
A Particle-in-cell Method for Plasmas with A Generalized Momentum Formulation, Part III: A family of Gauge Conserving Methods
In this paper, we introduce a new family of spatially co-located field solvers for particle-in-cell applications which evolve the potential formulation of Maxwell’s equations under the Lorenz gauge. Our recent work [2] introduced the concept of time-consistency, which connects charge conservation to the preservation of the gauge at the semi-discrete level. It will be shown that there exists a large family of time discretizations which satisfy this property. Additionally, it will be further shown that for large classes of time marching methods, the satisfaction of the gauge condition automatically implies the satisfaction of Gauss’s law for electricity, with the potential formulation ensuring that that Gauss’s law for magnetism is satisfied by definition. We focus on popular time marching methods including centered differences, backward differences, and diagonally-implicit Runge-Kutta methods, which are coupled to a spectral discretization in space. We demonstrate the theory by testing the methods on a relativistic Weibel instability and a drifting cloud of electrons.
97 MATHEMATICS AND COMPUTING↗
A high-order finite difference method for moving immersed domain boundaries and material interfaces
Here, we present a high-order sharp treatment of immersed moving domain boundaries and material interfaces, and apply it to the advection-diffusion equation in two and three dimensions. The spatial discretization combines dimension-split finite difference schemes with an immersed boundary treatment based on a weighted least-squares reconstruction of the solution, providing stable discretizations with up to sixth order accuracy for diffusion terms and third order accuracy for advection terms. The temporal discretization relies on a novel strategy for maintaining high-order temporal accuracy in problems with moving boundaries that minimizes implementation complexity and allows arbitrary explicit or diagonally-implicit Runge-Kutta schemes. The approach is broadly compatible with popular PDE-specialized Runge-Kutta time integrators, including low-storage, strong stability preserving, and diagonally implicit schemes. Through numerical experiments we demonstrate that the full discretization maintains high-order spatial and temporal accuracy in the presence of complex 3D geometries and for a range of boundary conditions, including Dirichlet, Neumann, and flux conditions with large jumps in coefficients.
97 MATHEMATICS AND COMPUTING↗