SEARCH · Engineering Papers

Results for “high-order 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

94 records · Page 6

All sources NASA NTRS DOE OSTI

NASA NTRS2019

High-Order Finite-Difference Nonlinear Filter Methods for Subsonic Turbulence Simulation with Stochastic Forcing

Numerical stability of high-order filter schemes developed by Yee & Sjogreen is tested on three-dimensional turbulence simulations with stochastic forcing and their performance is compared with that of TVD and WENO schemes. The best performing filter method employs an eighth-order central base scheme with the Kennedy & Gruber skew-symmetric splitting of the inviscid flux derivative, a wavelet-based local flow sensor, a nonlinear filter utilizing the dissipative portion of seventh-order \VENO scheme, and an explicit third - or fourth-order Runge-Kutta time integration. We show that the filter scheme is more computational]y efficient and provides a wider spectral bandwidth compared to the seventh-order WENO scheme. The method also demonstrates robust long-time integration for moderately compressible turbulence. In contrast, the fifth- and seventh order WENO schemes show non-trivial evolution of the velocity and density power spectra. over a. few dozen dynamical times, where both TVD and filter schemes recover a so lid statistically stationary turbulent state

Kritsuk, Alexei G.↗

NASA NTRSDate not supplied

Explicit Discontinuous Galerkin Methods for Conservation Laws

The two explicit DG methods in this study are based on a ‘predictor-corrector’ formulation, the first introduced by Lörcher, Gassner, and Munz (2007, 2008) called space–time expansion discontinuous Galerkin or STE-DG scheme, and the second, introduced independently by the author (Huynh 2006, 2013) called the upwind moment scheme. The predictor step of the two methods is essentially identical using a Cauchy-Kovalevsky (CK) procedure, which involves no interaction of the data among neighboring cells. The corrector step also shares the same space-time integration formulation and is where interaction of the data among neighboring cells takes place; the difference, however, is in how the resulting space-time volume integral is estimated. As a consequence of the different estimates, for the case of advection in one spatial dimension (1D), the moment scheme has a CFL (Courant-Friedrichs-Lewy) condition of 1 for all p and is accurate to order 2p+1, i.e., it possesses the super accuracy property, whereas the STE-DG method has a more restrictive CFL condition and is accurate to the expected order of p+1. For 1D advection, compared with the CFL conditions of 1/(2p+1) of standard RK-DG (Runge-Kutta) scheme where space and time discretization are of the same order, the moment scheme allows a significantly larger time step size. It also turns out that the scheme yields a result identical to Van Leer’s scheme III (1977), which amounts to shifting the data a distance of advection corresponding to the time step and projecting the result onto the space of polynomial solutions. Contrary to Van Leer’s approach, however, the space-time ‘predictor-corrector’ formulation facilitates extensions to the case of systems of equations. Concerning 2D extensions, in the case of advection, when the flow is along the diagonal direction, the CFL conditions for the moment schemes become restrictive as will be shown by Fourier (Von Neumann) stability and accuracy analyses. Since the moment scheme employs the right Radau points as collocation points in time, the method is closely related to the implicit Radau IIA scheme, which is stable for any time step size. The role of Radau IIA in relieving stability restriction for these explicit DG schemes remains to be explored

Discontinuous Galerkin↗

NASA NTRSDate not supplied

Scale-Resolving Simulations of a Supersonic Retro-Propulsion Concept For Mars Entry, Descent, and Landing

Supersonic retro-propulsion (SRP) is a deceleration technology that could enable largerpayloads and potentially humans to be brought from space to the surface of Mars safely.Accurate and reliable CFD predictions are needed to help design future Mars entry, descent,and landing (EDL) vehicles due to the cost and limitations of wind tunnel tests. TypicalCFD approaches struggle at points along the Mars EDL trajectory with high enough altitude(low enough ambient pressure) that the SRP motor plumes are over-expanded. This workdemonstrates how high-order scale-resolving simulations on Cartesian AMR grids can provideaccurate and reliable time-averaged aerodynamic loads on the vehicle for this challengingflow regime. Greater than second order convergence in the time-averaged integrated axialforce𝐶𝐴is obtained across the three finest mesh resolutions simulated, and the estimateduncertainty is smaller than the unsteady standard deviation – demonstrating the accuracy andreliability of the method. Although costly, this approach can yield higher confidence in𝐶𝐴thanpreviously obtained in a reasonable turnaround time and is within reach for a few points in thetrajectory (i.e. Mach 2.4, 2.52, and 2.78). Further computational performance and numericalmethods improvements are needed to reduce the cost enough to bring this method into the EDLengineering design cycle.

S&M↗

NASA NTRSDate not supplied

Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes

This work assesses the effectiveness of linearized implicit Euler preconditioning for multigrid solvers using an unpreconditioned, Jacobian-free Newton Krylov method to converge the linear system of equations. Multigrid convergence rates improve to approximately 0.75 across the cases tested including a Mach 2 supersonic wedge, transonic NACA 0012 airfoil, and ONERA M6 wing. While larger Krylov subspaces increase the convergence rate, they also increase the computational cost, such that 4-8 Krylov vectors often offers the fastest turnaround. Further reductions in computational cost are achieved with a sequential hybrid preconditioner that begins with the explicit multigrid solver before transitioning to the preconditioned algorithm later on. In addition, a novel implementation of dual time stepping is extended to include both common BDF methods as well as high-order implicit Runge-Kutta schemes. This particular formulation, which uses A −1 preconditioning, is amenable to matrix-free solvers, and the L-stable methods are especially suited for meshes with arbitrarily small cut-cells. Asymptotic order of convergence is demonstrated for BDF1, BDF2, SDIRK2, and 3rd-order Radau IIA time integration with unsteady 2D vortex simulations.

ARMD↗