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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

A multiblock multigrid method for the solution of the three-dimensional Euler equations

A general multiblock, multigrid method for the solution of the Euler equations has been developed. Two types of numerical methods were investigated, van Leer's flux-vector-splitting and Roe's flux-difference-splitting, with MUSCL type differencing used in both methods. An explicit two-step method and a multi-stage Runge-Kutta method have been tested. Results are presented for test cases of a channel flow, nozzle exhaust flow, and a transonic wing.

Cannizzaro, Frank E.↗
DOE OSTI2021

Implicit Multirate GARK Methods

This article considers multirate generalized-structure additively partitioned Runge–Kutta methods for solving stiff systems of ordinary differential equations with multiple time scales. These methods treat different partitions of the system with different timesteps for a more targeted and efficient solution compared to monolithic single rate approaches. With implicit methods used across all partitions, methods must find a balance between stability and the cost of solving nonlinear equations for the stages. In order to characterize this important trade-off, we explore multirate coupling strategies, problems for assessing linear stability, and techniques to efficiently implement Newton iterations for stage equations. Unlike much of the existing multirate stability analysis which is limited in scope to particular methods, we present general statements on stability and describe fundamental limitations for certain types of multirate schemes. New implicit multirate methods up to fourth order are derived, and their accuracy and efficiency properties are verified with numerical tests.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Computational modeling of charge hopping dynamics along a disordered one-dimensional wire with energy gradients in quantum environments

This computational study investigates the effects of energy gradients on charge hopping dynamics along a one-dimensional chain of discrete sites coupled to quantum bath, which is modeled at the level of Pauli master equation (PME). This study also assesses the performance of different approximations for the hopping rates. Three different methods for solving the PME, a fourth order Runge–Kutta method, numerical diagonalization of the rate matrix followed by analytic propagation, and kinetic Monte Carlo simulation method, are tested and confirmed to produce virtually identical values of time dependent mean square displacement, diffusion constant, and mobility. Five different rate expressions, exact numerical evaluation of Fermi’s Golden Rule (FGR) rate, stationary phase interpolation (SPI) approximation, semiclassical approximation, classical Marcus rate, and Miller–Abrahams rate, are tested to help understand the effects of approximations in representing quantum environments in the presence of energy gradients. The results based on direct numerical evaluation of FGR rate exhibit transition from diffusive to non-diffusive behavior with the increase in the gradient and show that the charge transport in the quantum bath is more sensitive to the magnitude of the gradient and the disorder than in the classical bath. Among all the four approximations for the hopping rates, the SPI approximation is confirmed to work best overall. A comparison of two different methods to calculate the mobility identifies drift motion of the population distribution as the major source of non-diffusive behavior and provides more reliable information on the contribution of quantum bath.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1985

Recent advances in computational transonic aerodynamics

The near-term prospects are discussed for calculation of viscous transonic flow fields about realistic configurations at full-scale Reynolds numbers. Three basic algorithms are considered: The central-difference, three-factor ADI method; the central-difference, explicit, multistep Runge-Kutta method with multigrid acceleration; and the relaxation method for the upwind-differenced, flux-split equations. Each method has distinct advantages and disadvantages regarding stability, convergence rate, and vectorizability. It appears that computation times can be 15 to 60 hours on the latest super computers unless 3D algorithms are improved to perform as well as current 2D algorithms.

South, J. C., Jr.↗
NASA NTRS2000

A Very High Order, Adaptable MESA Implementation for Aeroacoustic Computations

Since computational efficiency and wave resolution scale with accuracy, the ideal would be infinitely high accuracy for problems with widely varying wavelength scales. Currently, many of the computational aeroacoustics methods are limited to 4th order accurate Runge-Kutta methods in time which limits their resolution and efficiency. However, a new procedure for implementing the Modified Expansion Solution Approximation (MESA) schemes, based upon Hermitian divided differences, is presented which extends the effective accuracy of the MESA schemes to 57th order in space and time when using 128 bit floating point precision. This new approach has the advantages of reducing round-off error, being easy to program. and is more computationally efficient when compared to previous approaches. Its accuracy is limited only by the floating point hardware. The advantages of this new approach are demonstrated by solving the linearized Euler equations in an open bi-periodic domain. A 500th order MESA scheme can now be created in seconds, making these schemes ideally suited for the next generation of high performance 256-bit (double quadruple) or higher precision computers. This ease of creation makes it possible to adapt the algorithm to the mesh in time instead of its converse: this is ideal for resolving varying wavelength scales which occur in noise generation simulations. And finally, the sources of round-off error which effect the very high order methods are examined and remedies provided that effectively increase the accuracy of the MESA schemes while using current computer technology.

Dydson, Roger W.↗
NASA NTRS1977

On the improvement of deconvolution with digitized data using a Runge-Kutta integration scheme

A relatively simple change in the treatment of the input function in numerical integration of high-order differential equations by Runge-Kutta methods provides substantial improvements in accuracy, particularly when the forcing function is in digitized form. The Runge-Kutta-Gill coefficients are modified to incorporate the changes; with pulse-type excitations, improvements on the order of 2 to 50 times greater accuracy are demonstrated.

Houghton, J. R.↗
NASA NTRS1975

SENS-5D trajectory and wind-sensitivity calculations for unguided rockets

A computational procedure is described which numerically integrates the equations of motion of an unguided rocket. Three translational and two angular (roll discarded) degrees of freedom are integrated through the final burnout; and then, through impact, only three translational motions are considered. Input to the routine is: initial time, altitude and velocity, vehicle characteristics, and other defined options. Input format has a wide range of flexibility for special calculations. Output is geared mainly to the wind-weighting procedure, and includes summary of trajectory at burnout, apogee and impact, summary of spent-stage trajectories, detailed position and vehicle data, unit-wind effects for head, tail and cross winds, coriolis deflections, range derivative, and the sensitivity curves (the so called F(Z) and DF(Z) curves). The numerical integration procedure is a fourth-order, modified Adams-Bashforth Predictor-Corrector method. This method is supplemented by a fourth-order Runge-Kutta method to start the integration at t=0 and whenever error criteria demand a change in step size.

Singh, R. P.↗
NASA NTRS1988

SIRTF controller simulation - Instability masked by numerical integration

In the course of a simulation study of a candidate design for the Space Infrared Telescope Facility (SIRTF), an unusual phenomenon was observed. The uncompensated control system was unstable, but a numerical simulation with the fixed-step-size classical fourth-order Runge-Kutta method gave a stable response. This phenomenon is described in the setting in which it occurred. The Runge-Kutta simulation model is analyzed as a discrete linear system and shown to be stable, thus corroborating the numerical results.

Rajan, N.↗
NASA NTRS1973

Behavior of nitric oxide formed by the space shuttle in the mesosphere

A numerical model of eddy diffusive transport of emitted gases from the space shuttle wake, including chemical reactions between the emitted constituents and the ambient atmosphere, has been constructed for 75 km altitude. The numerical methods involve explicit solution of the diffusion equation and Runge-Kutta method for the chemical reactions. The time required to reach background levels of nitric oxide concentration of 7 x 10 to the 7th power molecules/cc has been calculated. This relaxation time depends strongly on atmospheric conditions.

Eberstein, I. J.↗
DOE OSTI2025

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↗
NASA NTRS1990

Nonideal isentropic gas flow through converging-diverging nozzles

A method for treating nonideal gas flows through converging-diverging nozzles is described. The method incorporates the Redlich-Kwong equation of state. The Runge-Kutta method is used to obtain a solution. Numerical results were obtained for methane gas. Typical plots of pressure, temperature, and area ratios as functions of Mach number are given. From the plots, it can be seen that there exists a range of reservoir conditions that require the gas to be treated as nonideal if an accurate solution is to be obtained.

Bober, W.↗
NASA NTRS1985

Simulation and modeling of homogeneous, compressed turbulence

Low Reynolds number homogeneous turbulence undergoing low Mach number isotropic and one-dimensional compression was simulated by numerically solving the Navier-Stokes equations. The numerical simulations were performed on a CYBER 205 computer using a 64 x 64 x 64 mesh. A spectral method was used for spatial differencing and the second-order Runge-Kutta method for time advancement. A variety of statistical information was extracted from the computed flow fields. These include three-dimensional energy and dissipation spectra, two-point velocity correlations, one-dimensional energy spectra, turbulent kinetic energy and its dissipation rate, integral length scales, Taylor microscales, and Kolmogorov length scale. Results from the simulated flow fields were used to test one-point closure, two-equation models. A new one-point-closure, three-equation turbulence model which accounts for the effect of compression is proposed. The new model accurately calculates four types of flows (isotropic decay, isotropic compression, one-dimensional compression, and axisymmetric expansion flows) for a wide range of strain rates.

Wu, C. T.↗
NASA NTRS1988

Explicit and implicit solution of the Navier-Stokes equations on a massively parallel computer

The design, implementation, and performance of a two-dimensional time-accurate Navier-Stokes solver for the CM2 supercomputer are described. The program uses a single processor for each grid point. Two different time-stepping methods have so far been implemented: an explicit third-order Runge-Kutta method and an implicit approximation-factorization method. The CM2 results are checked against those of a mature well-vectorized Cray 2 program, both for correctness and performance. The code is found to be correct, and the performance in some cases is up to several times that of the Cray 2.

Levit, Creon↗
DOE OSTI2023

Efficient Multigrid Reduction-in-Time for Method-of-Lines Discretizations of Linear Advection

Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1994

Parallel, adaptive finite element methods for conservation laws

We construct parallel finite element methods for the solution of hyperbolic conservation laws in one and two dimensions. Spatial discretization is performed by a discontinuous Galerkin finite element method using a basis of piecewise Legendre polynomials. Temporal discretization utilizes a Runge-Kutta method. Dissipative fluxes and projection limiting prevent oscillations near solution discontinuities. A posteriori estimates of spatial errors are obtained by a p-refinement technique using superconvergence at Radau points. The resulting method is of high order and may be parallelized efficiently on MIMD computers. We compare results using different limiting schemes and demonstrate parallel efficiency through computations on an NCUBE/2 hypercube. We also present results using adaptive h- and p-refinement to reduce the computational cost of the method.

Biswas, Rupak↗
DOE OSTI2025

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗