Search NASA⌕ Search

SEARCH · Search NASA

Results for “CFL condition”

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 NTRS2013

High-Order Space-Time Methods for Conservation Laws

Current high-order methods such as discontinuous Galerkin and/or flux reconstruction can provide effective discretization for the spatial derivatives. Together with a time discretization, such methods result in either too small a time step size in the case of an explicit scheme or a very large system in the case of an implicit one. To tackle these problems, two new high-order space-time schemes for conservation laws are introduced: the first is explicit and the second, implicit. The explicit method here, also called the moment scheme, achieves a Courant-Friedrichs-Lewy (CFL) condition of 1 for the case of one-spatial dimension regardless of the degree of the polynomial approximation. (For standard explicit methods, if the spatial approximation is of degree p, then the time step sizes are typically proportional to 1/p(exp 2)). Fourier analyses for the one and two-dimensional cases are carried out. The property of super accuracy (or super convergence) is discussed. The implicit method is a simplified but optimal version of the discontinuous Galerkin scheme applied to time. It reduces to a collocation implicit Runge-Kutta (RK) method for ordinary differential equations (ODE) called Radau IIA. The explicit and implicit schemes are closely related since they employ the same intermediate time levels, and the former can serve as a key building block in an iterative procedure for the latter. A limiting technique for the piecewise linear scheme is also discussed. The technique can suppress oscillations near a discontinuity while preserving accuracy near extrema. Preliminary numerical results are shown

Huynh, H. T.↗
NASA NTRS2018

3D Simulations of Ion Thruster Accelerator Grid Erosion Accounting for Charge Exchange Ion Space Charge

Accelerator (accel) grid sputtering by ions formed through charge-exchange (CEX) reactions between beam ions and residual neutral gas is a critical life-limiting mechanism for gridded ion thrusters. The three-dimensional ion optics code CEX3D is designed to simulate this grid erosion for a single beamlet, with a particular emphasis on non-axisymmetric features such as the "pits and grooves" erosion commonly observed on the accel grid downstream face in two-grid thrusters. The treatment of CEX ions in the code was recently upgraded with a new particle-in-cell (PIC) module to account for the influence of these ions' space charge on the electrostatic potential downstream of the grids. In order to achieve reasonable computation times while resolving the Debye length near the grids and avoiding gross violations of the Courant-Friedrichs-Lewy (CFL) condition, macroparticle velocities in the PIC calculation are limited through a rescaling procedure that preserves ion trajectories and space charge density. The code accounts for beam divergence, finite momentum transfer in CEX collisions, and radial losses of CEX ions from the beam; these effects are important for determining the CEX ion flux to the accel grid because the calculated potential downstream of the grids can become very flat. The upgraded code has been used to simulate operation of NASA's Evolutionary Xenon Thruster (NEXT) during the 51 kHr Long Duration Test - a selection of results is presented and compared with experimental data.

Chaplin, Vernon H.↗
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↗
DOE OSTI2023

Ameliorating the Courant-Friedrichs-Lewy condition in spherical coordinates: A double FFT filter method for general relativistic MHD in dynamical spacetimes

Numerical simulations of merging compact objects and their remnants form the theoretical foundation for gravitational wave and multimessenger astronomy. While Cartesian-coordinate-based adaptive mesh refinement is commonly used for simulations, spherical-like coordinates are more suitable for nearly spherical remnants and azimuthal flows due to lower numerical dissipation in the evolution of fluid angular momentum, as well as requiring fewer numbers of computational cells. However, the use of spherical coordinates to numerically solve hyperbolic partial differential equations can result in severe Courant-Friedrichs-Lewy (CFL) stability condition time step limitations, which can make simulations prohibitively expensive. This paper addresses this issue for the numerical solution of coupled spacetime and general relativistic magnetohydrodynamics evolutions by introducing a double fast Fourier transform (FFT) filter and implementing it within the fully message passing interface (mpi)-parallelized sphericalnr framework in the einstein toolkit. In conclusion, we demonstrate the effectiveness and robustness of the filtering algorithm by applying it to a number of challenging code tests, and show that it passes these tests effectively, demonstrating convergence while also increasing the time step significantly compared to unfiltered simulations.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1988

Compact high order schemes for the Euler equations

An implicit approximate factorization (AF) algorithm is constructed which has the following characteistics. In 2-D: The scheme is unconditionally stable, has a 3 x 3 stencil and at steady state has a fourth order spatial accuracy. The temporal evolution is time accurate either to first or second order through choice of parameter. In 3-D: The scheme has almost the same properties as in 2-D except that it is now only conditionally stable, with the stability condition (the CFL number) being dependent on the cell aspect ratios, delta y/delta x and delta z/delta x. The stencil is still compact and fourth order accuracy at steady state is maintained. Numerical experiments on a 2-D shock-reflection problem show the expected improvement over lower order schemes, not only in accuracy (measured by the L sub 2 error) but also in the dispersion. It is also shown how the same technique is immediately extendable to Runge-Kutta type schemes resulting in improved stability in addition to the enhanced accuracy.

Abarbanel, Saul↗
NASA NTRS1988

Compact high-order schemes for the Euler equations

An implicit approximate factorization (AF) algorithm is constructed which has the following characteristics. In 2-D: the scheme is unconditionally stable, has a 3 x 3 stencil and at steady state has a fourth order spatial accuracy. The temporal evolution is time accurate either to first or second order through choice of parameter. In 3-D: the scheme has almost the same properties as in 2-D except that it is now only conditionally stable, with the stability condition (the CFL number) being dependent on the cell aspect ratios, delta y/delta x and delta z/delta x. The stencil is still compact and fourth order accuracy at steady state is maintained.

Abarbanel, Saul↗
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↗
DOE OSTI2023

Numerical Analysis of Regular Material Point Method and its Application to Multiphase Flows

The material point method (MPM) is gaining wide popularity in engineering research to model and simulate complex multiphase flow dynamics. The method relies on solving the governing equations of motion and transport in a Lagrangian framework using particles also known as material points. The fluid and kinematic properties are stored on the material points while the spatial gradient calculation and temporal integration are performed on a background grid. This Lagrangian framework allows for large deformations, easy integration of constitutive models, and direct import of complex geometries as particles. However, despite their increasing popularity, very few studies have addressed the issues of numerical resolution and stability of MPM techniques. The presence of additional factors such as the number of material points-per-cell, the location of the material points, the CFL-like condition used in time update, and the grid shape functions also increase the complexity of the error analysis when compared to other finite element methods. In this presentation, we analyze the various forms of error incurred in the application of MPM to continuum mechanics and multiphase flows. The effect of the previously mentioned factors on the error dynamics is studied. The application of these principles to canonical and industrial problems is also presented.

high pressure reverse osmosis↗
NASA NTRS1981

On a fourth order accurate implicit finite difference scheme for hyperbolic conservation laws. I - Nonstiff strongly dynamic problems

An implicit finite difference method of fourth order accuracy in space and time is introduced for the numerical solution of one-dimensional systems of hyperbolic conservation laws. The basic form of the method is a two-level scheme which is unconditionally stable and nondissipative. The scheme uses only three mesh points at level t and three mesh points at level t + delta t. The dissipative version of the basic method given is conditionally stable under the CFL (Courant-Friedrichs-Lewy) condition. This version is particularly useful for the numerical solution of problems with strong but nonstiff dynamic features, where the CFL restriction is reasonable on accuracy grounds. Numerical results are provided to illustrate properties of the proposed method.

Harten, A.↗
NASA NTRS1991

Unsteady-flow-field predictions for oscillating cascades

The unsteady flow field around an oscillating cascade of flat plates with zero stagger was studied by using a time marching Euler code. This case had an exact solution based on linear theory and served as a model problem for studying pressure wave propagation in the numerical solution. The importance of using proper unsteady boundary conditions, grid resolution, and time step size was shown for a moderate reduced frequency. Results show that an approximate nonreflecting 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 to the airfoils than when reflective boundaries are used. Stretching the boundary to dampen the unsteady waves is another way to minimize reflections. Grid clustering near the plates captures the unsteady flow field better than when uniform grids are used as long as the 'Courant Friedrichs Levy' (CFL) number is less than 1 for a sufficient portion of the grid. Finally, a solution based on an optimization of grid, CFL number, and boundary conditions shows good agreement with linear theory.

Huff, Dennis L.↗
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.↗
NASA NTRS1985

Three-dimensional unsteady Euler equations solutions on dynamic grids

A method is presented for solving the three-dimensional unsteady Euler equations on dynamic grids based on flux vector splitting. The equations are cast in curvilinear coordinates and a finite volume discretization is used for handling arbitrary geometries. The discretized equations are solved using an explicit upwind second-order predictor corrector scheme that is stable for a CFL of 2. Characteristic variable boundary conditions are developed and used for unsteady impermeable surfaces and for the far-field boundary. Dynamic-grid results are presented for an oscillating air-foil and for a store separating from a reflection plate. For the cases considered of stores separating from a reflection plate, the unsteady aerodynamic forces on the store are significantly different from forces obtained by steady-state aerodynamics with the body inclination angle changed to account for plunge velocity.

Belk, D. M.↗
NASA NTRSDate not supplied

Recent Progress in OVERFLOW Convergence Improvements

Improvements have been made to the implicit symmetric successive overrelaxation algorithm in the OVERFLOW 2.3 structured, overset grid, computational fluid dynamics flow solver. These improvements, consisting of implicit boundary conditions, improved flux Jacobian linearizations, and CFL number ramping, are a series of evolutionary changes to the linear solver that have resulted in increased nonlinear convergence rates and faster time to solution. A series of test cases are presented that demonstrate the effect of the changes through comparison with the original SSOR path and other linear solver implementations within OVERFLOW.

Joseph M Derlaga↗
NASA NTRS1991

Unstructured-grid methods development: Lessons le arned

The development is summarized of unstructured grid methods for the solution of the equations of fluid flow and some of the lessons learned are shared. The 3-D Euler equations are solved, including spatial discretizations, temporal discretizations, and boundary conditions. An example calculation with an upwind implicit method using a CFL (Courant Friedricks Lewy) number of infinity is presented for the Boeing 747 aircraft. The results obtained in less than one hour of CPU time on a Cray-2 computer, thus demonstrating the speed and robustness of the present capability.

Batina, John T.↗
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 NTRS1984

Calculation of quasi-one-dimensional flows with shocks

The two-point subsonic method of Wornom (1983) is modified to permit calculation of transonic flows with shocks using artificial density and/or artificial pressure. This method, which requires no numerical boundary conditions, is then used to calculate transonic flow for large and small CFL (Courant-Friedrichs-Lewy) numbers. Convergence acceleration is achieved for small CFL numbers by using multi-grid.

Wornom, S. F.↗
NASA NTRS2017

On High-Order Upwind Methods for Advection

In the fourth installment of the celebrated series of five papers entitled "Towards the ultimate conservative difference scheme", Van Leer (1977) introduced five schemes for advection, the first three are piecewise linear, and the last two, piecewise parabolic. Among the five, scheme I, which is the least accurate, extends with relative ease to systems of equations in multiple dimensions. As a result, it became the most popular and is widely known as the MUSCL scheme (monotone upstream-centered schemes for conservation laws). Schemes III and V have the same accuracy, are the most accurate, and are closely related to current high-order methods. Scheme III uses a piecewise linear approximation that is discontinuous across cells, and can be considered as a precursor of the discontinuous Galerkin methods. Scheme V employs a piecewise quadratic approximation that is, as opposed to the case of scheme III, continuous across cells. This method is the basis for the on-going "active flux scheme" developed by Roe and collaborators. Here, schemes III and V are shown to be equivalent in the sense that they yield identical (reconstructed) solutions, provided the initial condition for scheme III is defined from that of scheme V in a manner dependent on the CFL number. This equivalence is counter intuitive since it is generally believed that piecewise linear and piecewise parabolic methods cannot produce the same solutions due to their different degrees of approximation. The finding also shows a key connection between the approaches of discontinuous and continuous polynomial approximations. In addition to the discussed equivalence, a framework using both projection and interpolation that extends schemes III and V into a single family of high-order schemes is introduced. For these high-order extensions, it is demonstrated via Fourier analysis that schemes with the same number of degrees of freedom 𝐾 per cell, in spite of the different piecewise polynomial degrees, share the same sets of eigenvalues and thus, have the same stability and accuracy. Moreover, these schemes are accurate to order 2𝐾−1, which is higher than the expected order of 𝐾.

high-order methods↗