Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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 271 records · Page 15

Computational Considerations for the Simulation of Discontinuous Flows

The numerical study of aeroacoustic problems places stringent demands on the choice of a computational algorithm, because it requires the ability to propagate disturbances of small amplitude and short wavelength. The demands are particularly high when shock waves are involved, because the chosen algorithm must also resolve discontinuities in the solution. In a previous work the capabilities and deficiencies of shock-capturing methods for aeroacoustic problems were demonstrated using a high-order essentially nonoscillatory (ENO) numerical method. It was shown that first-order results are obtained when simulating time-dependent flows with discontinuities. The present study reaffirms this conclusion by comparing the ENO results with those obtained using a conventional linear scheme. A sixth-order-accurate compact implicit finite difference scheme is used to investigate various discontinuous flows. The design order of accuracy is achieved in the smooth regions of a steady-state, quasi-one-dimensional Euler test case, as well as in the time-dependent Burgers' equation. However, in the unsteady Euler sound-shock interaction, first-order results are obtained downstream of the shock. A comparison is made between the linear and nonlinear results, noting the advantages of each method. A discontinuous linear model problem is then used to identify the cause of the first-order results. Here, the nature of the solution error is quantified as being predominantly a numerical phase shift, and a post-processing procedure is demonstrated which increases the solution accuracy downstream of the discontinuity to second-order.

Carpenter Mark H.↗

Benchmark solutions for the galactic ion transport equations with spatial and energy coupling

In order to anticipate future space shielding requirements, NASA has initiated an effort to formulate computational methods to simulate radiation effects in space. As part of the program, numerical transport algorithms have been developed for the deterministic Boltzman equation describing galactic cosmic ray (GCR) interactions with matter. It thus becomes necessary to assess the accuracy of proposed deterministic algorithms. For this reason, analytical benchmark solutions to mathematically tractable galactic cosmic ray equations have recently been obtained. Even though these problems involve simplifying assumptions of the associated physics, they still contain the essential features of the basic transport processes. The solutions obtained are features of the basic transport processes. The solutions obtained are compared to results from numerical algorithms in order to ensure proper coding and to provide a measure of the accuracy of the numerical methods used in the algorithm. For the first time, mathematical methods have been applied to the galactic ion transport (GIT) equations in the straight ahead approximation with constant nuclear properties. The approach utilizes a Laplace transforms inversion yielding a closed form benchmark solution which is also computationally efficient.

Ganapol, Barry D.↗

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, Vadius↗

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, V. N.↗

Navier-Stokes Computations On Zonal Grids

Report describes numerical simulations of transonic flow of air about isolated wing and about wing and fuselage (not tail assembly) of F-16A aircraft. Fast, diagonalized Beam-Warming numerical-integration algorithm for solution of Euler and Navier-Stokes equations applied via Transonic Navier-Stokes computer program, using computational grids divided into zones of coarse and finer meshes.

Flores, Jolen↗

Grid-free simulation of diffusion using random walk methods

The simulation of the diffusion of a continuum field by the random walk (RW) displacement of a set of particles is considered. Elements of the gradients of the diffusive concentration are transported by computational particles. It is demonstrated that, by the use of concentration gradients in the RW process, statistical errors are reduced and each realization of the numerical solution is a representation of the exact solution. The algorithm is grid-free, and the computational elements move to follow the gradients; hence, the algorithm is self-adaptive, and uniform resolution is achieved for all times.

Ghoniem, A. F.↗

Acoustic analysis using numerical solutions of the Navier-Stokes equations

Numerical solutions of the time-dependent compressible Navier-Stokes equations are employed to analyze the unsteady features of jet flows which contribute to jet noise. The turbulent-mass flux spectra are examined in detail in the numerical analysis, and MacCormack's explicit finite difference algorithm is used to solve the governing equations. The computational grid is based on an axisymmetric jet with simple exponential stretching used to optimize the resolution of critical unsteady flow features. The time-varying numerical data are analyzed, and the time averages of the velocity and turbulence-intensity profiles are shown to agree with experimental data. Grid refinement and longer run times improved the prediction of the experimental mass-flux spectra. The numerical procedure can be extended to 3D jet-flow configurations to study the related 3D unsteady flow features.

Scott, James N.↗

Simulation of Propellant Loading System Senior Design Implement in Computer Algorithm

Propellant loading from the Storage Tank to the External Tank is one of the very important and time consuming pre-launch ground operations for the launch vehicle. The propellant loading system is a complex integrated system involving many physical components such as the storage tank filled with cryogenic fluid at a very low temperature, the long pipe line connecting the storage tank with the external tank, the external tank along with the flare stack, and vent systems for releasing the excess fuel. Some of the very important parameters useful for design purpose are the prediction of pre-chill time, loading time, amount of fuel lost, the maximum pressure rise etc. The physics involved for mathematical modeling is quite complex due to the fact the process is unsteady, there is phase change as some of the fuel changes from liquid to gas state, then conjugate heat transfer in the pipe walls as well as between solid-to-fluid region. The simulation is very tedious and time consuming too. So overall, this is a complex system and the objective of the work is student's involvement and work in the parametric study and optimization of numerical modeling towards the design of such system. The students have to first become familiar and understand the physical process, the related mathematics and the numerical algorithm. The work involves exploring (i) improved algorithm to make the transient simulation computationally effective (reduced CPU time) and (ii) Parametric study to evaluate design parameters by changing the operational conditions

Bandyopadhyay, Alak↗

Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations

One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. In the past, limited computer resources have motivated the development of efficient numerical schemes in computational fluid dynamics (CFD) utilizing structured meshes. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Unstructured grids on the other hand offer an alternative to modeling complex geometries. Unstructured meshes have irregular connectivity and usually contain combinations of triangles, quadrilaterals, tetrahedra, and hexahedra. The generation and use of unstructured grids poses new challenges in CFD. The purpose of this note is to present recent developments in the unstructured grid generation and flow solution technology.

Barth, Timothy J.↗

Recursive linearization of multibody dynamics equations of motion

The equations of motion of a multibody system are nonlinear in nature, and thus pose a difficult problem in linear control design. One approach is to have a first-order approximation through the numerical perturbations at a given configuration, and to design a control law based on the linearized model. Here, a linearized model is generated analytically by following the footsteps of the recursive derivation of the equations of motion. The equations of motion are first written in a Newton-Euler form, which is systematic and easy to construct; then, they are transformed into a relative coordinate representation, which is more efficient in computation. A new computational method for linearization is obtained by applying a series of first-order analytical approximations to the recursive kinematic relationships. The method has proved to be computationally more efficient because of its recursive nature. It has also turned out to be more accurate because of the fact that analytical perturbation circumvents numerical differentiation and other associated numerical operations that may accumulate computational error, thus requiring only analytical operations of matrices and vectors. The power of the proposed linearization algorithm is demonstrated, in comparison to a numerical perturbation method, with a two-link manipulator and a seven degrees of freedom robotic manipulator. Its application to control design is also demonstrated.

Lin, Tsung-Chieh↗

An application of the square-root information filter to large scale linear interconnected systems

The paper considers the use of numerically stable square-root information filter (SRIF) algorithms to reduce the computation and storage requirements of a certain class of large-scale linear interconnected systems (multistation satellite tracking is examined as an example). The reductions are in comparison with conventional sequential covariance type formulations. To illustrate the SRIF algorithm: a 40 subsystem, 10 state problem, for example, has its storage requirements reduced by a full order of magnitude (from 84255 to 8100).

Bierman, G. J.↗

Linearized form of implicit TVD schemes for the multidimensional Euler and Navier-Stokes equations

Linearized alternating direction implicit (ADI) forms of a class of total variation diminishing (TVD) schemes for the Euler and Navier-Stokes equations have been developed. These schemes are based on the second-order-accurate TVD schemes for hyperbolic conservation laws developed by Harten (1983, 1984). They have the property of not generating spurious oscillations across shocks and contact discontinuities. In general, shocks can be captured within 1-2 grid points. These schemes are relatively simple to understand and easy to implement into a new or existing computer code. One can modify a standard three-point central-difference code by simply changing the conventional numerical dissipation term into the one designed for the TVD scheme. For steady-state applications, the only difference in computation is that the current schemes require a more elaborate dissipation term for the explicit operator; no extra computation is required for the implicit operator. Numerical experiments with the proposed algorithms on a variety of steady-state airfoil problems illustrate the versatility of the schemes.

Yee, H. C.↗

Supersonic combustor modeling

The physical phenomena involved when a supersonic flow undergoes chemical reaction are discussed. Detailed physical models of convective and diffusive mixing, and finite rate chemical reaction in supersonic flow are presented. Numerical algorithms used to solve the equations governing these processes are introduced. Computer programs using these algorithms are used to analyze the structure of the reacting mixing layer. It is concluded that, as in subsonic flow, exothermic heat release in unconfined supersonic flows retards fuel/air mixing. Non mixing is shown to be a potential problem in reducing the efficiency of supersonic as well as subsonic combustion. Techniques for enhancing fuel/air mixing and combustion are described.

Riggins, David W.↗

A model for the analysis of fault-tolerant signal processing architectures

This paper develops a new model, using matrices, for the analysis of fault-tolerant multiprocessor systems. The relationship between processors computing useful data, the output data, and the check processors is defined in terms of matrix entries. Unlike the matrix-based models proposed previously for the analysis of digital systems, this model uses only numerical computations rather than logical operations for the analysis of a system. Algorithms to evaluate the fault detection and location capability of the system are proposed which are much less complex than the existing ones. The new model is used to analyze some fault-tolerant architectures proposed for signal-processing applications.

Nair, V. S. S.↗

Understanding transition and turbulence through direct simulations

Direct simulations consist in solving the full Navier-Stokes equations, without any turbulence model, and describing all the detailed features of the flow. Usually the flows are three-dimensional and time-dependent and contain both coarse and fine structures, which makes the numerical task very challenging in terms of both the algorithm and the computational effort. Most of the work until now has involved spectral methods, which are highly accurate but not very flexible in terms of geometry or complex equations. For that reason, future work will also rely on high-order finite-difference or other methods. Direct simulations complement experimental work, and both contribute to the theory and the empirical knowledge of turbulence. Once such a simulation has been shown to be accurate, the flow field is completely known in three dimensions and time, including the pressure, the vorticity and any other quantity. On the other hand, most simulations to date solved the incompressible equations in rather simple geometries, and direct simulations will always be limited to moderate Reynolds numbers. Extensive simulations have been conducted in homogeneous turbulence, channel flows, boundary layers, and mixing layers. Much effort is devoted to addressing flows with compressibility and chemical reactions, and to new geometries such as a backward-facing step.

Spalart, P. R.↗

The prediction of viscous hypersonic flows about complex configurations using an upwind parabolized Navier-Stokes code

A three-dimensional parabolized Navier-Stokes computer code which employs an upwind algorithm is used to conduct a numerical study of an advanced maneuvering reentry vehicle configuration. Comparisons between numerical solutions and experimental data are presented for surface pressure, wall heat flux, and overall forces and moments. The effects of angle of attack, angle of yaw, and surface mass injection are investigated. Good agreement is observed between the calculated and measured data. The results of this investigation demonstrate the accuracy and efficiency of an upwind scheme in predicting the hypersonic flow field characteristics about a complex configuration.

Narain, J. P.↗

Progress with multigrid schemes for hypersonic flow problems

Several multigrid schemes are considered for the numerical computation of viscous hypersonic flows. For each scheme, the basic solution algorithm uses upwind spatial discretization with explicit multistage time stepping. Two level versions of the various multigrid algorithms are applied to the two dimensional advection equation, and Fourier analysis is used to determine their damping properties. The capabilities of the multigrid methods are assessed by solving three different hypersonic flow problems. Some new multigrid schemes based on semicoarsening strategies are shown to be quite effective in relieving the stiffness caused by the high aspect ratio cells required to resolve high Reynolds number flows. These schemes exhibit good convergence rates for Reynolds numbers up to 200 x 10(exp 6) and Mach numbers up to 25.

Radespiel, R.↗

Multigrid schemes for viscous hypersonic flows

Several multigrid schemes are considered for the numerical computation of viscous hypersonic flows. For each scheme, the basic solution algorithm employs upwind spatial discretization with explicit multistage time stepping. Two-level versions of the various multigrid algorithms are applied to the two-dimensional advection equation, and Fourier analysis is used to determine their damping properties. The capabilities of the multigrid methods are assessed by solving two different hypersonic flow problems. Some new multigrid schemes, based on semicoarsening strategies, are shown to be quite effective in relieving the stiffness caused by the high-aspect-ratio cells required to resolve high Reynolds number flows. These schemes exhibit good convergence rates for Reynolds numbers up to 200 x 10(exp 6).

Swanson, R. C.↗