Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm”

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 217 records · Page 12

Numerical Simulations of Homogeneous Turbulence Using Lagrangian-Averaged Navier-Stokes Equations

The Lagrangian-averaged Navier-Stokes (LANS) equations are numerically evaluated as a turbulence closure. They are derived from a novel Lagrangian averaging procedure on the space of all volume-preserving maps and can be viewed as a numerical algorithm which removes the energy content from the small scales (smaller than some a priori fixed spatial scale alpha) using a dispersive rather than dissipative mechanism, thus maintaining the crucial features of the large scale flow. We examine the modeling capabilities of the LANS equations for decaying homogeneous turbulence, ascertain their ability to track the energy spectrum of fully resolved direct numerical simulations (DNS), compare the relative energy decay rates, and compare LANS with well-accepted large eddy simulation (LES) models.

Mohseni, Kamran↗

Evaluation of numerical schemes for the analysis of sound generation by blade-gust interaction

In this investigation three different numerical algorithms have been utilized to compute the flow about a flat plate in the presence of a transverse gust described by a sinusoidal disturbance. The three schemes include the MacCormack explicit finite difference scheme which is second order accurate in both time and space, the Gottlieb and Turkel modification of MacCormack's scheme which is fourth order accurate in space and second order accurate in time, (referred to as the 2-4 scheme), and a two step scheme developed by Bayliss et al. which has second order temporal accuracy and sixth order spatial accuracy (a 2-6 scheme). The flow field results are obtained with these schemes by using the same code with the only difference being the implementation of the respective solution algorithms. The problem is set up so that the sinusoidal disturbance is imposed at the surface of the flat plate as a surface boundary condition. Thus the problem is treated as scattering problem. The computed results include the time average of the acoustic pressure squared along grid lines five points away from the boundaries; distribution throughout the computational domain is monitored at various times. The numerical results are compared with an exact solution obtained by Atassi, Dusey, and Davis.

Scott, J. N.↗

A numerical simulation of vortex breakdown

A numerical simulation of vortex breakdown using the time-dependent Navier-Stokes equations is performed. Unlike previous studies, the numerical algorithm, formulated in terms of the velocity and vorticity, is not restricted by axisymmetry conditions. The vortex is parameterized in terms of the Reynolds number and Rossby number. The resulting breakdown structure is analyzed using contour plots of velocity, vorticity and pressure as well as axial, radial, and swirl velocity profiles at various streamwise locations. The relationship of these results to experimentally observed structures and previous numerical results is discussed.

Spall, R. E.↗

Formulation of numerical procedures for dynamic analysis of spinning structures

The paper presents the descriptions of recently developed numerical algorithms that prove to be useful for the solution of the free vibration problem of spinning structures. First, a generalized procedure for the computation of nodal centrifugal forces in a finite element owing to any specified spin rate is derived in detail. This is followed by a description of an improved eigenproblem solution procedure that proves to be economical for the free vibration analysis of spinning structures. Numerical results are also presented which indicate the efficacy of the currently developed procedures.

Gupta, K. K.↗

DFT algorithms for bit-serial GaAs array processor architectures

Systems and Processes Engineering Corporation (SPEC) has developed an innovative array processor architecture for computing Fourier transforms and other commonly used signal processing algorithms. This architecture is designed to extract the highest possible array performance from state-of-the-art GaAs technology. SPEC's architectural design includes a high performance RISC processor implemented in GaAs, along with a Floating Point Coprocessor and a unique Array Communications Coprocessor, also implemented in GaAs technology. Together, these data processors represent the latest in technology, both from an architectural and implementation viewpoint. SPEC has examined numerous algorithms and parallel processing architectures to determine the optimum array processor architecture. SPEC has developed an array processor architecture with integral communications ability to provide maximum node connectivity. The Array Communications Coprocessor embeds communications operations directly in the core of the processor architecture. A Floating Point Coprocessor architecture has been defined that utilizes Bit-Serial arithmetic units, operating at very high frequency, to perform floating point operations. These Bit-Serial devices reduce the device integration level and complexity to a level compatible with state-of-the-art GaAs device technology.

Mcmillan, Gary B.↗

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.↗

Computation of nonstationary strong shock diffraction by curved surfaces

A two-dimensional, high resolution shock-capturing algorithm was used on a supercomputer to solve Eulerian gasdynamic equations in order to simulate nonstationary strong shock diffraction by a circular arc model in a shock tube. The hypersonic Mach shock wave was assumed to arrive at a high angle of incidence, and attention was given to the effect of varying values of the ratio of specific heats on the shock diffraction process. Details of the conservation equations of the numerical algorithm, written in curvilinear coordinates, are provided, and model output is illustrated with the results generated for a Mach shock encountering a 15 deg circular arc. The sample graphics include isopycnics, a shock surface density profile, and pressure and Mach number contours.

Yang, J. Y.↗

Development of an upwind, finite-volume code with finite-rate chemistry

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques, and a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical, and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data.

Molvik, Gregory A.↗

Development of an upwind, finite-volume code with finite-rate chemistry

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques and of a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data. This report summarizes the research that took place from August 1,1994 to January 1, 1995.

Molvik, Gregory A.↗

The determination of the core mass at the helium flash in globular cluster stars

Evolutionary sequences for the red giant branch (RGB) phase of a representative globular cluster star have been computed in order to investigate the reliability of the current canonical values of the core mass M(sub c) at the helium flash. These computations were motivated by recent suggestions that the canonical values of M(sub c) may be systematically too small due to the numerical algorithms for shifting the hydrogen shell and advancing the chemical composition during the RGB phase. Our results show that these algorithms do not, in fact, introduce a significant error in the values of M(sub c). Moreover, we demonstrate that a procedure for advancing the chemical composition which is implicit only in the hydrogen abundance will systematically underestimate the amount of hydrogen fuel consumption between RGB models and therefore should not be used in RGB computations. Overall we estimate the uncertainty in the core masses of Sweigart & Gross (1978) due to numerical effects to be approximately equals 0.003 solar mass. From a consideration of the available canonical models we conclude that a change in the canonical values of M(sub c) by a few 10(exp -2) solar mass would require either a substantial change in the canonical input physics or some noncanonical effect such as rotation. Finally our models show that the use of short time steps can significantly increase the extent of the inner tail of the hydrogen shell. This effect may enhance the likelihood of hydrogen mixing following a helium shell flash in an asymptotic giant branch star.

Sweigart, Allen V.↗

Numerical studies of the thermal design sensitivity calculation for a reaction-diffusion system with discontinuous derivatives

The aim of this study is to find a reliable numerical algorithm to calculate thermal design sensitivities of a transient problem with discontinuous derivatives. The thermal system of interest is a transient heat conduction problem related to the curing process of a composite laminate. A logical function which can smoothly approximate the discontinuity is introduced to modify the system equation. Two commonly used methods, the adjoint variable method and the direct differentiation method, are then applied to find the design derivatives of the modified system. The comparisons of numerical results obtained by these two methods demonstrate that the direct differentiation method is a better choice to be used in calculating thermal design sensitivity.

Hou, Jean W.↗

Extension of a System Level Tool for Component Level Analysis

This paper presents an extension of a numerical algorithm for network flow analysis code to perform multi-dimensional flow calculation. The one dimensional momentum equation in network flow analysis code has been extended to include momentum transport due to shear stress and transverse component of velocity. Both laminar and turbulent flows are considered. Turbulence is represented by Prandtl's mixing length hypothesis. Three classical examples (Poiseuille flow, Couette flow, and shear driven flow in a rectangular cavity) are presented as benchmark for the verification of the numerical scheme.

Majumdar, Alok↗

Extension of a System Level Tool for Component Level Analysis

This paper presents an extension of a numerical algorithm for network flow analysis code to perform multi-dimensional flow calculation. The one dimensional momentum equation in network flow analysis code has been extended to include momentum transport due to shear stress and transverse component of velocity. Both laminar and turbulent flows are considered. Turbulence is represented by Prandtl's mixing length hypothesis. Three classical examples (Poiseuille flow, Couette flow and shear driven flow in a rectangular cavity) are presented as benchmark for the verification of the numerical scheme.

Majumdar, Alok↗

Computer program for solving laminar, transitional, or turbulent compressible boundary-layer equations for two-dimensional and axisymmetric flow

A numerical algorithm and computer program are presented for solving the laminar, transitional, or turbulent two dimensional or axisymmetric compressible boundary-layer equations for perfect-gas flows. The governing equations are solved by an iterative three-point implicit finite-difference procedure. The software, program VGBLP, is a modification of the approach presented in NASA TR R-368 and NASA TM X-2458, respectively. The major modifications are: (1) replacement of the fourth-order Runge-Kutta integration technique with a finite-difference procedure for numerically solving the equations required to initiate the parabolic marching procedure; (2) introduction of the Blottner variable-grid scheme; (3) implementation of an iteration scheme allowing the coupled system of equations to be converged to a specified accuracy level; and (4) inclusion of an iteration scheme for variable-entropy calculations. These modifications to the approach presented in NASA TR R-368 and NASA TM X-2458 yield a software package with high computational efficiency and flexibility. Turbulence-closure options include either two-layer eddy-viscosity or mixing-length models. Eddy conductivity is modeled as a function of eddy viscosity through a static turbulent Prandtl number formulation. Several options are provided for specifying the static turbulent Prandtl number. The transitional boundary layer is treated through a streamwise intermittency function which modifies the turbulence-closure model. This model is based on the probability distribution of turbulent spots and ranges from zero to unity for laminar and turbulent flow, respectively. Several test cases are presented as guides for potential users of the software.

Harris, J. E.↗

Entropy Stable Nonconforming Discretizations with the Summation-By-Parts Property for Curvilinear Coordinates

The entropy conservative/stable algorithm of Friedrichet al.(2018) for hyperbolic conservation laws on nonconforming p-refined/coarsened Cartesian grids, is extended to curvilinear grids for the compressible Euler equations. The primary focus is on constructing appropriate coupling procedures across the curvilinear nonconforming interfaces. A simple and flexible approach is proposed that uses interpolation operators from one element to the other. On the element faces,the analytic metrics are used to construct coupling terms, while metric terms in the volume are approximated to satisfy a discretization of the geometric conservation laws. The resulting scheme is entropy conservative/stable, elementwise conservative, and freestream preserving. The accuracy and stability properties of the resulting numerical algorithm are shown to be comparable to those ofthe original conforming scheme (∼p+ 1 convergence) in the context of the isentropic Euler vortex and the inviscid Taylor–Green vortex problems on manufactured high order grids.

David Del Rey Fernandez↗

A numerical technique for the calculation of cloud optical extinction from lidar

A simple numerical algorithm which calculates optical extinction from cloud lidar data is presented. The method assumes a two-component atmosphere consisting of 'clear air' and cloud particulates. 'Clear air' may consist of either molecules only or a mix of molecules and atmospheric aerosols. For certain clouds, the method may be utilized to provide an estimate of the cloud-atmospheric parameter defined as the ratio of the cloud volume backscatter coefficient to the cloud extinction coefficient divided by the atmospheric volume backscatter coefficient at a given altitude. The cloud-atmospheric parameter may be estimated only from cloud data from which the optical thickness may reliably be used as a constraint on the numerical solution. This constraint provides the additional information necessary to obtain the cloud-atmospheric parameter. Conversely, the method may be applied to obtain cloud extinction and optical thickness from lidar cloud soundings if an estimate of the cloud-atmospheric parameter is available.

Alvarez, J. M.↗

Solving modal equations of motion with initial conditions using MSC/NASTRAN DMAP. Part 1: Implementing exact mode superposition

Within the MSC/NASTRAN DMAP (Direct Matrix Abstraction Program) module TRD1, solving physical (coupled) or modal (uncoupled) transient equations of motion is performed using the Newmark-Beta or mode superposition algorithms, respectively. For equations of motion with initial conditions, only the Newmark-Beta integration routine has been available in MSC/NASTRAN solution sequences for solving physical systems and in custom DMAP sequences or alters for solving modal systems. In some cases, one difficulty with using the Newmark-Beta method is that the process of selecting suitable integration time steps for obtaining acceptable results is lengthy. In addition, when very small step sizes are required, a large amount of time can be spent integrating the equations of motion. For certain aerospace applications, a significant time savings can be realized when the equations of motion are solved using an exact integration routine instead of the Newmark-Beta numerical algorithm. In order to solve modal equations of motion with initial conditions and take advantage of efficiencies gained when using uncoupled solution algorithms (like that within TRD1), an exact mode superposition method using MSC/NASTRAN DMAP has been developed and successfully implemented as an enhancement to an existing coupled loads methodology at the NASA Lewis Research Center.

Abdallah, Ayman A.↗

Total Variation Majorization Minimization (TV-MM) Approach to Radiometer Brightness Temperature Gridding and Reconstruction

This paper presents the implementation of an algorithm to enhance the image resolution of the Earth's surface brightness temperature (T B ) data measured by radiometers such as the one onboard of the Soil Moisture Active Passive (SMAP) mission. A key step in radiometer T B processing is the conversion of the swath-based calibrated antenna temperature (T A ) measurements to the Level 3 Earth-centered grid. The simplest algorithm to transform this data from swath to gridded format is called drop-in-the-bucket which simply averages surrounding noisy T A samples to form a T B value at the gridded location. This method reduces noise, however produces low resolution products. To obtain a higher resolution product, SMAP uses other techniques such the Backus-Gilbert (BG) algorithm, which is the conventional method used in microwave radiometry. Although this method performs the required interpolation, it is not effective in denoising and removing blurring effects due to antenna filtering of the radiometer image data. Our motivation for this development is to further improve the resolution through post-processing of the radiometer T B image, a highly cost-effective method of image enhancement. The approach adapted in this work is based on the minimization of the Total Variation (TV) regularized objective function that is used extensively in solving general ill-posed linear inverse problems in image processing. Since the TV-based objective function is convex but not everywhere differentiable, there exists many numerical algorithms that can estimate the solution and the one selected for this work is called Majorization- Minimization (MM). By applying this algorithm, simulation experiments were performed based on synthetic data from the Geophysical model as well as real SMAP data to demonstrate the effectiveness of the technique. Results were then compared against the BG method.

Wing Lee↗