Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Local time stepping”

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
NASA NTRS2002

On the Numerical Convergence to Steady State of Hypersonic Flows Over Bodies with Concavities

Two recent numerical studies of hypersonic flows over bodies with concavities revealed problems with convergence to a steady state with an oft-used application of local-time-stepping. Both simulated flows showed a time-like, periodic shedding of vortices in a subsonic domain bounded by supersonic external flow although the simulations, using local-time-stepping, were not time accurate. Simple modifications to the numerical algorithm were implemented to enable implicit, first-order accurate in time simulations. Subsequent time-accurate simulations of the two test problems converged to a steady state. The baseline algorithm and modifications for temporal accuracy are described. The requirement for sub-iterations to achieve convergence is demonstrated. Failure to achieve convergence without time accuracy is conjectured to arise from temporal errors being continuously refocused into a subsonic domain.

Gnoffo, Peter A.↗
NASA NTRS1994

Multigrid solution of compressible turbulent flow on unstructured meshes using a two-equation model

The steady state solution of the system of equations consisting of the full Navier-Stokes equations and two turbulence equations has been obtained using a multigrid strategy of unstructured meshes. The flow equations and turbulence equations are solved in a loosely coupled manner. The flow equations are advanced in time using a multistage Runge-Kutta time-stepping scheme with a stability-bound local time step, while turbulence equations are advanced in a point-implicit scheme with a time step which guarantees stability and positivity. Low-Reynolds-number modifications to the original two-equation model are incorporated in a manner which results in well-behaved equations for arbitrarily small wall distances. A variety of aerodynamic flows are solved, initializing all quantities with uniform freestream values. Rapid and uniform convergence rates for the flow and turbulence equations are observed.

MULTIGRID SOLUTION↗
NASA NTRS1991

Characteristic time-stepping or local preconditioning of the Euler equations

A derivation is presented of a local preconditioning matrix for multidimensional Euler equations, that reduces the spread of the characteristic speeds to the lowest attainable value. Numerical experiments with this preconditioning matrix are applied to an explicit upwind discretization of the two-dimensional Euler equations, showing that this matrix significantly increases the rate of convergence to a steady solution. It is predicted that local preconditioning will also simplify convergence-acceleration boundary procedures such as the Karni (1991) procedure for the far field and the Mazaheri and Roe (1991) procedure for a solid wall.

Van Leer, Bram↗
NASA NTRS1993

Reliability enhancement of Navier-Stokes codes through convergence enhancement

Reduction of total computing time required by an iterative algorithm for solving Navier-Stokes equations is an important aspect of making the existing and future analysis codes more cost effective. Several attempts have been made to accelerate the convergence of an explicit Runge-Kutta time-stepping algorithm. These acceleration methods are based on local time stepping, implicit residual smoothing, enthalpy damping, and multigrid techniques. Also, an extrapolation procedure based on the power method and the Minimal Residual Method (MRM) were applied to the Jameson's multigrid algorithm. The MRM uses same values of optimal weights for the corrections to every equation in a system and has not been shown to accelerate the scheme without multigriding. Our Distributed Minimal Residual (DMR) method based on our General Nonlinear Minimal Residual (GNLMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. The DMR method was found capable of reducing the computation time by 10-75 percent depending on the test case and grid used. Recently, we have developed and tested a new method termed Sensitivity Based DMR or SBMR method that is easier to implement in different codes and is even more robust and computationally efficient than our DMR method.

Choi, K.-Y.↗
NASA NTRS1991

A fast upwind solver for the Euler equations on three-dimensional unstructured meshes

An upwind scheme is presented for solving the three-dimensional Euler equations on unstructured tetrahedral meshes. Spatial discretization is accomplished by a cell-centered finite-volume formulation using flux-difference splitting. Higher-order differences are formed by a novel cell reconstruction process which results in computational times per cell comparable to those of structured codes. The approach yields highly resolved solutions in regions of smooth flow while avoiding oscillations across shocks without explicit limiting. Solutions are advanced in time by a 3-stage Runge-Kutta time-stepping scheme with convergence accelerated to steady state by local time stepping and implicit residual smoothing. Solutions are presented for a range of configurations in the transonic speed regime to demonstrate code accuracy, speed, and robustness. The results include an assessment of grid sensitivity and convergence acceleration by mesh sequencing.

Frink, Neal T.↗
NASA NTRS1992

Upwind scheme for solving the Euler equations on unstructured tetrahedral meshes

An upwind scheme is presented for solving the three-dimensional Euler equations on unstructured tetrahedral meshes. Spatial discretization is accomplished by a cell-centered finite-volume formulation using flux-difference splitting. Higher-order differences are formed by a multidimensional linear reconstruction process. The solution gradients required for the higher-order differenes are computed by a novel approach that yields highly resolved solutions in regions of smooth flow while avoiding oscillations across shocks without explicitly applying a limiter. Solutions are advanced in time by a three-stage Runge-Kutta time-stepping scheme with convergence accelerated to steady state by local time stepping and implicit residual smoothing. Transonic solutions are presented for two meshes around the ONERA M6 wing and demonstrate substantial accuracy and insensitivity to mesh size.

Frink, Neal T.↗
NASA NTRS2004

A Fast Upwind Solver for the Euler Equations on Three-Dimensional Unstructured Meshes

An upwind scheme is presented for solving the three-dimensional Euler equations on unstructured tetrahedral meshes. Spatial discretization is accomplished by a cell-centered finite-volume formulation using flux-difference splitting. Higher-order differences are formed by a novel cell reconstruction process which results in computational times per cell comparable to those of structured codes. The approach yields highly resolved solutions in regions of smooth flow while avoiding oscillations across shocks without explicit limiting. Solutions are advanced in time by a 3-stage Runge-Kutta time-stepping scheme with convergence accelerated to steady state by local time stepping and implicit residual smoothing. Solutions are presented for a range of configurations in the transonic speed regime to demonstrate code accuracy, speed, and robustness. The results include an assessment of grid sensitivity and convergence acceleration by mesh sequencing.

Frink, Neal T.↗
DOE OSTI2021

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗
NASA NTRS1986

A multistage time-stepping scheme for the thin-layer Navier-Stokes equations

A finite-volume scheme for numerical integration of the Euler equations was extended to allow solution of the thin-layer Navier-Stokes equations in two and three dimensions. The extended algorithm, which is based on a class of four-stage Runge-Kutta time-stepping schemes, was made numerically efficient through the following convergence acceleration technique: (1) local time stepping, (2) enthalpy damping, and (3) residual smoothing. Also, the high degree of vectorization possible with the algorithm has yielded an efficient program for vector processors. The scheme was evaluated by solving laminar and turbulent flows. Numerical results have compared well with either theoretical or other numerical solutions and/or experimental data.

Swanson, R. C., Jr.↗
NASA NTRS1988

Convergence speeding up in the calculation of the viscous flow about an airfoil

A finite volume method to solve the three dimensional Navier-Stokes equations was developed. It is based on a cell-vertex scheme with central differences and explicit Runge-Kutta time steps. A good convergence for a stationary solution was obtained by the use of local time steps, implicit smoothing of the residues, a multigrid algorithm, and a carefully controlled artificial dissipative term. The method is illustrated by results for transonic profiles and airfoils. The method allows a routine solution of the Navier-Stokes equations.

Radespiel, R.↗
NASA NTRS1992

Spatial and temporal adaptive procedures for the unsteady aerodynamic analysis of airfoils using unstructured meshes

An algorithm which combines spatial and temporal adaption for the time integration of the two dimensional Euler equations on unstructured meshes of triangles is presented. Spatial adaption involves mesh enrichment to add elements in high gradient regions of the flow and mesh coarsening to remove elements where they are no longer needed. Temporal adaption is a time accurate, local time stepping procedure which integrates the flow equations in each cell according to the local numerical stability constraint. The flow solver utilizes a four stage Runge-Kutta time integration scheme with an upwind flux-split spatial discretization. Results obtained using spatial and temporal adaption indicate that highly accurate solutions can be obtained with a significant savings of computing time over global time stepping.

Hooker, John R.↗
NASA NTRS1992

Spatial and temporal adaptive procedures for the unsteady aerodynamic analysis of airfoils using unstructured meshes

An algorithm which combines spatial and temporal adaption for the time integration of the two-dimensional Euler equations on unstructured meshes of triangles is presented. Spatial adaption involves mesh enrichment to add elements in high gradient regions of the flow and mesh coarsening to remove elements where they are no longer needed. Temporal adaption is a time accurate, local time stepping procedure which integrates the flow equations in each cell according to the local numerical stability constraint. The flow solver utilizes a four-stage Runge-Kutta time integration scheme with an upwind flux-split spatial discretization. Results obtained using spatial and temporal adaption indicate that highly accurate solutions can be obtained with a significant savings of computing time over global time stepping.

Hooker, John R.↗
NASA NTRS1993

Three-dimensional unstructured grid Euler computations using a fully-implicit, upwind method

A method has been developed to solve the Euler equations on a three-dimensional unstructured grid composed of tetrahedra. The method uses an upwind flow solver with a linearized, backward-Euler time integration scheme. Each time step results in a sparse linear system of equations which is solved by an iterative, sparse matrix solver. Local-time stepping, switched evolution relaxation (SER), preconditioning and reuse of the Jacobian are employed to accelerate the convergence rate. Implicit boundary conditions were found to be extremely important for fast convergence. Numerical experiments have shown that convergence rates comparable to that of a multigrid, central-difference scheme are achievable on the same mesh. Results are presented for several grids about an ONERA M6 wing.

Whitaker, David L.↗
NASA NTRS1984

Flux-vector splitting and Runge-Kutta methods for the Euler equations

Runge-Kutta schemes have been used as a method of solving the Euler equations exterior to an airfoil. In the past this has been coupled with central differences and an artificial vesocity in space. In this study the Runge-Kutta time-stepping scheme is coupled with an upwinded space approximation based on flux-vector splitting. Several acceleration techniques are also considered including a local time step, residual smoothing and multigrid.

Turkel, E.↗
NASA NTRS1986

Influence of numerical dissipation in computing supersonic vortex-dominated flows

Steady supersonic vortex-dominated flows are solved using the unsteady Euler equations for conical and three-dimensional flows around sharp- and round-edged delta wings. The computational method is a finite-volume scheme which uses a four-stage Runge-Kutta time stepping with explicit second- and fourth-order dissipation terms. The grid is generated by a modified Joukowski transformation. The steady flow solution is obtained through time-stepping with initial conditions corresponding to the freestream conditions, and the bow shock is captured as a part of the solution. The scheme is applied to flat-plate and elliptic-section wings with a leading edge sweep of 70 deg at an angle of attack of 10 deg and a freestream Mach number of 2.0. Three grid sizes of 29 x 39, 65 x 65 and 100 x 100 have been used. The results for sharp-edged wings show that they are consistent with all grid sizes and variation of the artificial viscosity coefficients. The results for round-edged wings show that separated and attached flow solutions can be obtained by varying the artificial viscosity coefficients. They also show that the solutions are independent of the way time stepping is done. Local time-stepping and global minimum time-steeping produce same solutions.

Kandil, O. A.↗
NASA NTRS1994

Direct Replacement of Arbitrary Grid-Overlapping by Non-Structured Grid

A new approach that uses nonstructured mesh to replace the arbitrarily overlapped structured regions of embedded grids is presented. The present methodology uses the Chimera composite overlapping mesh system so that the physical domain of the flowfield is subdivided into regions which can accommodate easily-generated grid for complex configuration. In addition, a Delaunay triangulation technique generates nonstructured triangular mesh which wraps over the interconnecting region of embedded grids. It is designed that the present approach, termed DRAGON grid, has three important advantages: eliminating some difficulties of the Chimera scheme, such as the orphan points and/or bad quality of interpolation stencils; making grid communication in a fully conservative way; and implementation into three dimensions is straightforward. A computer code based on a time accurate, finite volume, high resolution scheme for solving the compressible Navier-Stokes equations has been further developed to include both the Chimera overset grid and the nonstructured mesh schemes. For steady state problems, the local time stepping accelerates convergence based on a Courant - Friedrichs - Leury (CFL) number near the local stability limit. Numerical tests on representative steady and unsteady supersonic inviscid flows with strong shock waves are demonstrated.

Kao, Kai-Hsiung↗
NASA NTRS1988

An explicit Runge-Kutta method for 3D turbulent incompressible flows

A computer code has been developed to solve for the steady-state solution of the 3D incompressible Reynolds-averaged Navier-Stokes equations. The approach is based on the cell-center, central-difference, finite-volume formulation and an explicit one-step, multistage Runge-Kutta time-stepping scheme. The Baldwin-Lomax turbulence model is used. Techniques to accelerate the rate of convergence to a steady-state solution include the preconditioned method, the local time stepping, and the implicit residual smoothing. Improvements in computational efficiency have been demonstrated in several areas. This numerical procedure has been used to simulate the turbulent horseshoe vortex flow around an airfoil/flat-plate juncture.

Sung, Chao-Ho↗