SEARCH · Engineering Papers

Results for “CFL”

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.

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Central difference TVD and TVB schemes for time dependent and steady state problems

We use central differences to solve the time dependent Euler equations. The schemes are all advanced using a Runge-Kutta formula in time. Near shocks, a second difference is added as an artificial viscosity. This reduces the scheme to a first order upwind scheme at shocks. The switch that is used guarantees that the scheme is locally total variation diminishing (TVD). For steady state problems it is usually advantageous to relax this condition. Then small oscillations do not activate the switches and the convergence to a steady state is improved. To sharpen the shocks, different coefficients are needed for different equations and so a matrix valued dissipation is introduced and compared with the scalar viscosity. The connection between this artificial viscosity and flux limiters is shown. Any flux limiter can be used as the basis of a shock detector for an artificial viscosity. We compare the use of the van Leer, van Albada, mimmod, superbee, and the 'average' flux limiters for this central difference scheme. For time dependent problems, we need to use a small enough time step so that the CFL was less than one even though the scheme was linearly stable for larger time steps. Using a total variation bounded (TVB) Runge-Kutta scheme yields minor improvements in the accuracy.

Jorgenson, P.↗

NASA NTRS1992

Pressure wave propagation studies for oscillating cascades

The unsteady flow field around an oscillating cascade of flat plates is studied using a time marching Euler code. Exact solutions based on linear theory serve as model problems to study pressure wave propagation in the numerical solution. The importance of using proper unsteady boundary conditions, grid resolution, and time step is demonstrated. Results show that an approximate non-reflecting boundary condition based on linear theory does a good job of minimizing reflections from the inflow and outflow boundaries and allows the placement of the boundaries to be closer than cases using reflective boundary conditions. Stretching the boundary to dampen the unsteady waves is another way to minimize reflections. Grid clustering near the plates does a better job of capturing the unsteady flow field than cases using uniform grids as long as the CFL number is less than one for a sufficient portion of the grid. Results for various stagger angles and oscillation frequencies show good agreement with linear theory as long as the grid is properly resolved.

Huff, Dennis L.↗

NASA NTRS1992

Progress in unstructured-grid methods development for unsteady aerodynamic applications

The development of unstructured-grid methods for the solution of the equations of fluid flow and what was learned over the course of the research are summarized. The focus of the discussion is on the solution of the time-dependent Euler equations including spatial discretizations, temporal discretizations, and boundary conditions. An example calculation with an implicit upwind method using a CFL number of infinity is presented for the Boeing 747 aircraft. The results were obtained in less than one hour CPU time on a Cray-2 computer, thus, demonstrating the speed and robustness of the capability. Additional calculations for the ONERA M6 wing demonstrate the accuracy of the method through the good agreement between calculated results and experimental data for a standard transonic flow case.

Batina, John T.↗

NASA NTRS1992

Central difference TVD and TVB schemes for time dependent and steady state problems

Jorgenson, P.↗

NASA NTRS1992

Pressure wave propagation studies for oscillating cascades

The unsteady flowfield around an oscillating cascade of flat plates is studied using a time marching Euler code. Exact solutions based on linear theory serve as model problems to study pressure wave propagation in the numerical solution. The importance of using proper unsteady boundary conditions, grid resolution, and time step is demonstrated. Results show that an approximate non-reflecting boundary condition based on linear theory does a good job of minimizing reflections from the inflow and outflow boundaries and allows the placement of the boundaries to be closer than cases using reflective boundary conditions. Stretching the boundary to dampen the unsteady waves is another way to minimize reflections. Grid clustering near the plates does a better job of capturing the unsteady flowfield than cases using uniform grids as long as the CFL number is less than one for a sufficient portion of the grid. Results for various stagger angles and oscillation frequencies show good agreement with linear theory as long as the grid is properly resolved.

Huff, Dennis L.↗

NASA NTRS1992

Volume 2: Explicit, multistage upwind schemes for Euler and Navier-Stokes equations

The objective of this study was to develop a high-resolution-explicit-multi-block numerical algorithm, suitable for efficient computation of the three-dimensional, time-dependent Euler and Navier-Stokes equations. The resulting algorithm has employed a finite volume approach, using monotonic upstream schemes for conservation laws (MUSCL)-type differencing to obtain state variables at cell interface. Variable interpolations were written in the k-scheme formulation. Inviscid fluxes were calculated via Roe's flux-difference splitting, and van Leer's flux-vector splitting techniques, which are considered state of the art. The viscous terms were discretized using a second-order, central-difference operator. Two classes of explicit time integration has been investigated for solving the compressible inviscid/viscous flow problems--two-state predictor-corrector schemes, and multistage time-stepping schemes. The coefficients of the multistage time-stepping schemes have been modified successfully to achieve better performance with upwind differencing. A technique was developed to optimize the coefficients for good high-frequency damping at relatively high CFL numbers. Local time-stepping, implicit residual smoothing, and multigrid procedure were added to the explicit time stepping scheme to accelerate convergence to steady-state. The developed algorithm was implemented successfully in a multi-block code, which provides complete topological and geometric flexibility. The only requirement is C degree continuity of the grid across the block interface. The algorithm has been validated on a diverse set of three-dimensional test cases of increasing complexity. The cases studied were: (1) supersonic corner flow; (2) supersonic plume flow; (3) laminar and turbulent flow over a flat plate; (4) transonic flow over an ONERA M6 wing; and (5) unsteady flow of a compressible jet impinging on a ground plane (with and without cross flow). The emphasis of the test cases was validation of code, and assessment of performance, as well as demonstration of flexibility.

Elmiligui, Alaa↗

NASA NTRS1993

Fourier analysis of numerical algorithms for the Maxwell equations

The Fourier method is used to analyze the dispersive, dissipative, and isotropy errors of various spatial and time discretizations applied to the Maxwell equations on multi-dimensional grids. Both Cartesian grids and non-Cartesian grids based on hexagons and tetradecahedra are studied and compared. The numerical errors are quantitatively determined in terms of phase speed, wave number, propagation direction, gridspacings, and CFL number. The study shows that centered schemes are more efficient than upwind schemes. The non-Cartesian grids yield superior isotropy and higher accuracy than the Cartesian ones. For the centered schemes, the staggered grids produce less errors than the unstaggered ones. A new unstaggered scheme which has all the best properties is introduced. The study also demonstrates that a proper choice of time discretization can reduce the overall numerical errors due to the spatial discretization.

Liu, Yen↗

NASA NTRS1993

Dynamic-overlapped-grid simulation of aerodynamically determined relative motion

Currently, there is a need to develop a means of analyzing and studying unsteady flowfields which involve multiple component configurations with at least one of the components in relative motion with respect to the others. Two of the important phenomena that such analyses can help to understand are the unsteady aerodynamic interference and the boundary-induced component of the flowfield. With this motivation, a computational method is developed which couples the governing equations of the unsteady flowfield and the rigid-body dynamics in six degrees-of-freedom. These equations are solved on composite meshes of overlapped subdomain grids which can move with respect to each other. Initially, several measures that reduce the numerical error are studied and compared with the exact solution of a moving normal shock in a tube. It is concluded that a second-order accurate method, for spatial and temporal discretizations as well as for the moving subdomain interpolations, is needed as a minimum measure. Furthermore, the CFL numbers should be restricted to unity. Then, the method is used to simulate the flowfield history and predict the aerodynamically determined trajectory of a store dropped from its initial position under a wing.

Yen, Guan-Wei↗

NASA NTRS1993

New developments in the method of space-time conservation element and solution element: Applications to the Euler and Navier-Stokes equations

A new numerical framework for solving conservation laws is being developed. This new approach differs substantially in both concept and methodology from the well-established methods--i.e., finite difference, finite volume, finite element, and spectral methods. It is conceptually simple and designed to avoid several key limitations to the above traditional methods. An explicit model scheme for solving a simple 1-D unsteady convection-diffusion equation is constructed and used to illuminate major differences between the current method and those mentioned above. Unexpectedly, its amplification factors for the pure convection and pure diffusion cases are identical to those of the Leapfrog and the DuFort-Frankel schemes, respectively. Also, this explicit scheme and its Navier-Stokes extension have the unusual property that their stabilities are limited only by the CFL condition. Moreover, despite the fact that it does not use any flux-limiter or slope-limiter, the Navier-Stokes solver is capable of generating highly accurate shock tube solutions with shock discontinuities being resolved within one mesh interval. An accurate Euler solver also is constructed through another extension. It has many unusual properties, e.g., numerical diffusion at all mesh points can be controlled by a set of local parameters.

Chang, Sin-Chung↗

NASA NTRS1993

The theoretical accuracy of Runge-Kutta time discretizations for the initial boundary value problem: A careful study of the boundary error

The conventional method of imposing time dependent boundary conditions for Runge-Kutta (RK) time advancement reduces the formal accuracy of the space-time method to first order locally, and second order globally, independently of the spatial operator. This counter intuitive result is analyzed in this paper. Two methods of eliminating this problem are proposed for the linear constant coefficient case: (1) impose the exact boundary condition only at the end of the complete RK cycle, (2) impose consistent intermediate boundary conditions derived from the physical boundary condition and its derivatives. The first method, while retaining the RK accuracy in all cases, results in a scheme with much reduced CFL condition, rendering the RK scheme less attractive. The second method retains the same allowable time step as the periodic problem. However it is a general remedy only for the linear case. For non-linear hyperbolic equations the second method is effective only for for RK schemes of third order accuracy or less. Numerical studies are presented to verify the efficacy of each approach.

Carpenter, Mark H.↗

NASA NTRS1994

A Continuing Search for a Near-Perfect Numerical Flux Scheme

While enjoying demonstrated improvement in accuracy, efficiency, and robustness over existing schemes, the Advection Upstream Splitting Scheme (AUSM) was found to have some deficiencies in extreme cases. This recent progress towards improving the AUSM while retaining its advantageous features is described. The new scheme, termed AUSM+, features: unification of velocity and Mach number splitting; exact capture of a single stationary shock; and improvement in accuracy. A general construction of the AUSM+ scheme is layed out and then focus is on the analysis of the a scheme and its mathematical properties, heretofore unreported. Monotonicity and positivity are proved, and a CFL-like condition is given for first and second order schemes and for generalized curvilinear co-ordinates. Finally, results of numerical tests on many problems are given to confirm the capability and improvements on a variety of problems including those failed by prominent schemes.

Liou, Meng-Sing↗

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 NTRS1993

Convergence acceleration of implicit schemes in the presence of high aspect ratio grid cells

The performance of Navier-Stokes codes are influenced by several phenomena. For example, the robustness of the code may be compromised by the lack of grid resolution, by a need for more precise initial conditions or because all or part of the flowfield lies outside the flow regime in which the algorithm converges efficiently. A primary example of the latter effect is the presence of extended low Mach number and/or low Reynolds number regions which cause convergence deterioration of time marching algorithms. Recent research into this problem by several workers including the present authors has largely negated this difficulty through the introduction of time-derivative preconditioning. In the present paper, we employ the preconditioned algorithm to address convergence difficulties arising from sensitivity to grid stretching and high aspect ratio grid cells. Strong grid stretching is particularly characteristic of turbulent flow calculations where the grid must be refined very tightly in the dimension normal to the wall, without a similar refinement in the tangential direction. High aspect ratio grid cells also arise in problems that involve high aspect ratio domains such as combustor coolant channels. In both situations, the high aspect ratio cells can lead to extreme deterioration in convergence. It is the purpose of the present paper to address the reasons for this adverse response to grid stretching and to suggest methods for enhancing convergence under such circumstances. Numerical algorithms typically possess a maximum allowable or optimum value for the time step size, expressed in non-dimensional terms as a CFL number or vonNeumann number (VNN). In the presence of high aspect ratio cells, the smallest dimension of the grid cell controls the time step size causing it to be extremely small, which in turn results in the deterioration of convergence behavior. For explicit schemes, this time step limitation cannot be exceeded without violating stability restrictions of the scheme. On the other hand, for implicit schemes, which are typically unconditionally stable, there appears to be room for improvement through careful tailoring of the time step definition based on results of linear stability analyses. In the present paper, we focus on the central-differenced alternating direction implicit (ADI) scheme. The understanding garnered from this analyses can then be applied to other implicit schemes. In order to systematically study the effects of aspect ratio and the methods of mitigating the associated problems, we use a two pronged approach. We use stability analyses as a tool for predicting numerical convergence behavior and numerical experiments on simple model problems to verify predicted trends. Based on these analyses, we determine that efficient convergence may be obtained at all aspect ratios by getting a combination of things right. Primary among these are the proper definition of the time step size, proper selection of viscous preconditioner and the precise treatment of boundary conditions. These algorithmic improvements are then applied to a variety of test cases to demonstrate uniform convergence at all aspect ratios.

Buelow, B. E. O.↗

NASA NTRS1997

The Implicit and Explicit alpha-mu Schemes

Artificial numerical dissipation is an important issue in large Reynolds number computations. In such computations, the artificial dissipation inherent in traditional numerical schemes can overwhelm the physical dissipation and yield inaccurate results on meshes of practical size. In the present work, the space-time conservation element and solution element method is used to construct new and accurate numerical schemes such that artificial numerical dissipation will not overwhelm physical dissipation. Specifically, these schemes have the property that numerical dissipation vanishes when the physical viscosity goes to zero. These new schemes therefore accurately model the physical dissipation even when it is extremely small. The method of space-time conservation element and solution element, currently under development, is a nontraditional numerical method for solving conservation laws. The method is developed on the basis of local and global flux conservation in a space-time domain, in which space and time are treated in a unified manner. Explicit solvers for model and fluid dynamic conservation laws have previously been investigated. In this paper, we introduce a new concept in the design of implicit schemes, and use it to construct two highly accurate solvers for a convection-diffusion equation. The two schemes become identical in the pure convection case, and in the pure diffusion case. The implicit schemes are applicable over the whole Reynolds number range, from purely diffusive equations to purely inviscid (convective) equations. The stability and consistency of the schemes are analyzed, and some numerical results are presented. It is shown that, in the inviscid case, the new schemes become explicit and their amplification factors are identical to those of the Leapfrog scheme. On the other hand, in the pure diffusion case, their principal amplification factor becomes the amplification factor of the Crank-Nicolson scheme. We also construct an explicit solver with the treatment of diffusion being based on that in the implicit solvers. The explicit solver has only a CFL stability limitation on the Courant number, yet it retains the second-order spatial accuracy of the implicit schemes.

Chang, Sin-Chung↗

NASA NTRS1998

Numerical Procedures for Inlet/Diffuser/Nozzle Flows

Two primitive variable, pressure based, flux-split, RNS/NS solution procedures for viscous flows are presented. Both methods are uniformly valid across the full Mach number range, Le., from the incompressible limit to high supersonic speeds. The first method is an 'optimized' version of a previously developed global pressure relaxation RNS procedure. Considerable reduction in the number of relatively expensive matrix inversion, and thereby in the computational time, has been achieved with this procedure. CPU times are reduced by a factor of 15 for predominantly elliptic flows (incompressible and low subsonic). The second method is a time-marching, 'linearized' convection RNS/NS procedure. The key to the efficiency of this procedure is the reduction to a single LU inversion at the inflow cross-plane. The remainder of the algorithm simply requires back-substitution with this LU and the corresponding residual vector at any cross-plane location. This method is not time-consistent, but has a convective-type CFL stability limitation. Both formulations are robust and provide accurate solutions for a variety of internal viscous flows to be provided herein.

Rubin, Stanley G.↗

NASA NTRS1982

A Numerical Method for Solving the Equations of Compressible Viscous Flow

Although much progress has already been made In solving problems in aerodynamic design, many new developments are still needed before the equations for unsteady compressible viscous flow can be solved routinely. This paper describes one such development. A new method for solving these equations has been devised that 1) is second-order accurate in space and time, 2) is unconditionally stable, 3) preserves conservation form, 4) requires no block or scalar tridiagonal inversions, 5) is simple and straightforward to program (estimated 10% modification for the update of many existing programs), 6) is more efficient than present methods, and 7) should easily adapt to current and future computer architectures. Computational results for laminar and turbulent flows at Reynolds numbers from 3 x 10(exp 5) to 3 x 10(exp 7) and at CFL numbers as high as 10(exp 3) are compared with theory and experiment.

MacCormack, R. W.↗

NASA NTRS2001

A Global Magnetohydrodynamic Model of Jovian Magnetosphere

The goal of this project was to develop a new global magnetohydrodynamic model of the interaction of the Jovian magnetosphere with the solar wind. Observations from 28 orbits of Jupiter by Galileo along with those from previous spacecraft at Jupiter, Pioneer 10 and 11, Voyager I and 2 and Ulysses, have revealed that the Jovian magnetosphere is a vast, complicated system. The Jovian aurora also has been monitored for several years. Like auroral observations at Earth, these measurements provide us with a global picture of magnetospheric dynamics. Despite this wide range of observations, we have limited quantitative understanding of the Jovian magnetosphere and how it interacts with the solar wind. For the past several years we have been working toward a quantitative understanding of the Jovian magnetosphere and its interaction with the solar wind by employing global magnetohydrodynamic simulations to model the magnetosphere. Our model has been an explicit MHD code (previously used to model the Earth's magnetosphere) to study Jupiter's magnetosphere. We continue to obtain important insights with this code, but it suffers from some severe limitations. In particular with this code we are limited to considering the region outside of 15RJ, with cell sizes of about 1.5R(sub J). The problem arises because of the presence of widely separated time scales throughout the magnetosphere. The numerical stability criterion for explicit MHD codes is the CFL limit and is given by C(sub max)(Delta)t/(Delta)x less than 1 where C(sub max) is the maximum group velocity in a given cell, (Delta)x is the grid spacing and (Delta)t is the time step. If the maximum wave velocity is C(sub w) and the flow speed is C(sub f), C(sub max) = C(sub w) + C(sub f). Near Jupiter the Alfven wave speed becomes very large (it approaches the speed of light at one Jovian radius). Operating with this time step makes the calculation essentially intractable. Therefore under this funding we have been designing a new MHD model that will be able to compute solutions in the wide parameter regime of the Jovian magnetosphere.

Walker, Raymond J.↗

NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗