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 1,513 records · Page 84

Numerical analysis of bipropellant combustion in orbit maneuvering vehicle thrust chamber

The combustion and aerodynamic processes of liquid-liquid bipropellant; monomethylhydrazine and nitrogen tetroxide in the combustion chamber of a variable thrust engine (VTE) have been examined to assess the flow structure, combustion characteristics, and wall heat transfer under the simulated engine operations at two power levels. The Generalized Elliptic Multi-phase flow with Chemical reaction, Heat transfer and Interfacial Processes (GEM-CHIP) code and the Bipropellant Combustion (BICOMB) code, which is the GEMCHIP algorithm reformulated in the frame work of a body fitted coordinate system, have been used for the numerical study. Combustion flow structure with non-premixed type injection that simulates the impingement type injector is predicted and the results are compared with that of the premixed injector.

Chiu, H. H.↗

Numerical Methods for Classical Sampled-System Analysis

SAMSAN provides control-system analyst with self-consistent computer algorithms that support large-order control-system design and evaluation studies. Emphasizes sampled-system analysis. SAMSAN reduces burden on analyst by providing set of algorithms well tested and documented and readily integrated for solving control-system problems.

Frisch, H. P.↗

Numerical solution of the incompressible Navier-Stokes equations for steady-state and time-dependent problems

An algorithm for the solution of the incompressible Navier-Stokes equations in three-dimensional generalized curvilinear coordinates is presented. The algorithm can be used to compute both steady-state and time-dependent flow problems. The algorithm is based on the method of artificial compressibility and uses a higher-order flux-difference splitting technique for the convective terms and a second-order central difference for the viscous terms. The steady-state solution of flow through a square duct with a 90 deg bend is computed and the results are compared with experimental data. Good agreement is observed. A comparison with an analytically known exact solution is then performed to verify the time accuracy of the algorithm. Finally, the flow through an artificial heart configuration with moving boundaries is calculated and presented.

Rogers, Stuart E.↗

Numerical simulations of thermal detection of disbonds in lap joints

A 2D time-dependent FEM heat-transfer algorithm that is unconditionally stable and implicit is presently used to solve for the time-dependence of a structure's temperature. By examining data-reduction techniques in the framework of simulation data, the contrast enhancement afforded by a given technique can be evaluated without regard to experimental error. The present computational simulations demonstrate that the time-derivative technique can clearly delineate the substructure of lap-joint geometries; in addition, histograms of the front surface images are able to quantitatively measure contrast-enhancements for various inspection and data-reduction techniques.

Howell, P. A.↗

Snowfall Rate Retrieval using NPP ATMS Passive Microwave Measurements

Passive microwave measurements at certain high frequencies are sensitive to the scattering effect of snow particles and can be utilized to retrieve snowfall properties. Some of the microwave sensors with snowfall sensitive channels are Advanced Microwave Sounding Unit (AMSU), Microwave Humidity Sounder (MHS) and Advance Technology Microwave Sounder (ATMS). ATMS is the follow‐on sensor to AMSU and MHS. Currently, an AMSU and MHS based land snowfall rate (SFR) product is running operationally at NOAA/NESDIS. Based on the AMSU/MHS SFR, an ATMS SFR algorithm has been developed recently. The algorithm performs retrieval in three steps: snowfall detection, retrieval of cloud properties, and estimation of snow particle terminal velocity and snowfall rate. The snowfall detection component utilizes principal component analysis and a logistic regression model. The model employs a combination of temperature and water vapor sounding channels to detect the scattering signal from falling snow and derive the probability of snowfall (Kongoli et al., 2014). In addition, a set of NWP model based filters is also employed to improve the accuracy of snowfall detection. Cloud properties are retrieved using an inversion method with an iteration algorithm and a two‐stream radiative transfer model (Yan et al., 2008). A method developed by Heymsfield and Westbrook (2010) is adopted to calculate snow particle terminal velocity. Finally, snowfall rate is computed by numerically solving a complex integral. The ATMS SFR product is validated against radar and gauge snowfall data and shows that the ATMS algorithm outperforms the AMSU/MHS SFR.

Meng, Huan↗

Analysis of direct numerical simulation data of a Mach 4.5 transitional boundary-layer flow

This paper describes the creation, by temporal direct numerical simulation and the analysis based on the Reynolds stress transport equations, of a high-quality data set that represents the laminar-turbulent transition of a high-speed boundary-layer flow. Following Pruett and Zang (1992), and with the help of algorithmic refinements, the evolution of an axial, Mach 4.5 boundary-layer flow along a hollow cylinder is simulated numerically. Favre-averaged Reynolds stress transport equations are derived in generalized curvilinear coordinates and are then specialized to the cylindrical geometry at hand. Reynolds stresses and various turbulence quantities, such as turbulent kinetic energy and turbulent Mach number, are calculated from the numerical data at various stages of the transition process. The kinetic energy 'budgets' are constructed from the transport equations. Various contributing terms for the evolution of kinetic energy, like the rates of production and dissipation, transport, and diffusion, are presented. The compressible dissipation rate is small in comparison with the solenoidal dissipation rate for all times. The pressure-dilatation term is of the same order of magnitude as the compressible dissipation rate.

Dinavahi, Surya P. G.↗

Hidden Statistics Approach to Quantum Simulations

Recent advances in quantum information theory have inspired an explosion of interest in new quantum algorithms for solving hard computational (quantum and non-quantum) problems. The basic principle of quantum computation is that the quantum properties can be used to represent structure data, and that quantum mechanisms can be devised and built to perform operations with this data. Three basic non-classical properties of quantum mechanics superposition, entanglement, and direct-product decomposability were main reasons for optimism about capabilities of quantum computers that promised simultaneous processing of large massifs of highly correlated data. Unfortunately, these advantages of quantum mechanics came with a high price. One major problem is keeping the components of the computer in a coherent state, as the slightest interaction with the external world would cause the system to decohere. That is why the hardware implementation of a quantum computer is still unsolved. The basic idea of this work is to create a new kind of dynamical system that would preserve the main three properties of quantum physics superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. In other words, such a system would reinforce the advantages and minimize limitations of both quantum and classical aspects. Based upon a concept of hidden statistics, a new kind of dynamical system for simulation of Schroedinger equation is proposed. The system represents a modified Madelung version of Schroedinger equation. It preserves superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for simulating quantum systems. The model includes a transitional component of quantum potential (that has been overlooked in previous treatment of the Madelung equation). The role of the transitional potential is to provide a jump from a deterministic state to a random state with prescribed probability density. This jump is triggered by blowup instability due to violation of Lipschitz condition generated by the quantum potential. As a result, the dynamics attains quantum properties on a classical scale. The model can be implemented physically as an analog VLSI-based (very-large-scale integration-based) computer, or numerically on a digital computer. This work opens a way of developing fundamentally new algorithms for quantum simulations of exponentially complex problems that expand NASA capabilities in conducting space activities. It has been illustrated that the complexity of simulations of particle interaction can be reduced from an exponential one to a polynomial one.

Zak, Michail↗

Category 5 problem solution using an unstructured finite volume algorithm

For the simulation of flows with complex geometries, unstructured finite volume methods have proven to be very popular, and simulations of a large number of flows have been done with good results using this approach. Since most of the simulations to date were done for steady flows, it is not clear that present unstructured finite volume algorithms can accurately track the unsteady propagation of acoustic waves in a computation. Therefore, there is a need to assess the accuracy of these methods for acoustic calculations. In this paper, we perform the numerical simulation of a very small amplitude acoustic wave incident on the non-uniform steady flow in a quasi- 1 D convergent-divergent nozzle using an unstructured finite volume algorithm with piece-wise linear, least square reconstruction, Roe flux difference splitting, and second-order MacCormack time marching. First, the spatial accuracy of the algorithm is evaluated for the steady flow by running the simulation with a sequence of successively finer meshes. Then the unsteady numerical solution with the acoustic perturbation is presented.

Bui, Trong T.↗

On the spectral stability of time integration algorithms for a class of constrained dynamics problems

Incomplete field formulations have recently been the subject of intense research because of their potential in coupled analysis of independently modeled substructures, adaptive refinement, domain decomposition, and parallel processing. This paper discusses the design and analysis of time-integration algorithms for these formulations and emphasizes the treatment of their inter-subdomain constraint equations. These constraints are shown to introduce a destabilizing effect in the dynamic system that can be analyzed by investigating the behavior of the time-integration algorithm at infinite and zero frequencies. Three different approaches for constructing penalty-free unconditionally stable second-order accurate solution procedures for this class of hybrid formulations are presented, discussed and illustrated with numerical examples. The theoretical results presented in this paper also apply to a large family of nonlinear multibody dynamics formulations. Some of the algorithms outlined herein are important alternatives to the popular technique consisting of transforming differential/algebraic equations into ordinary differential equations via the introduction of a stabilization term that depends on arbitrary constants and that influences the computed so1ution.

Farhat, Charbel↗

Recursive form of the eigensystem realization algorithm for system identification

An algorithm is developed for recursively calculating the minimum realization of a linear system from sampled impulse response data. The Gram-Schmidt orthonormalization technique is used to generate an orthonormal basis for factorization of the data matrix. The system matrix thus identified is in upper Hessenberg form, which has advantages for the identification of modal parameters including damping coefficients, frequencies, mode shapes, and modal participation factors. It also has the property that once an element of the system matrix is computed, it is never altered as the dimension of the model is increased in the recursive process. Numerical examples are presented for comparison of the recursive and nonrecursive forms of the eigensystem realization algorithm.

Longman, Richard W.↗

Rapid Calculation of Spacecraft Trajectories Using Efficient Taylor Series Integration

A variable-order, variable-step Taylor series integration algorithm was implemented in NASA Glenn's SNAP (Spacecraft N-body Analysis Program) code. SNAP is a high-fidelity trajectory propagation program that can propagate the trajectory of a spacecraft about virtually any body in the solar system. The Taylor series algorithm's very high order accuracy and excellent stability properties lead to large reductions in computer time relative to the code's existing 8th order Runge-Kutta scheme. Head-to-head comparison on near-Earth, lunar, Mars, and Europa missions showed that Taylor series integration is 15.8 times faster than Runge- Kutta on average, and is more accurate. These speedups were obtained for calculations involving central body, other body, thrust, and drag forces. Similar speedups have been obtained for calculations that include J2 spherical harmonic for central body gravitation. The algorithm includes a step size selection method that directly calculates the step size and never requires a repeat step. High-order Taylor series integration algorithms have been shown to provide major reductions in computer time over conventional integration methods in numerous scientific applications. The objective here was to directly implement Taylor series integration in an existing trajectory analysis code and demonstrate that large reductions in computer time (order of magnitude) could be achieved while simultaneously maintaining high accuracy. This software greatly accelerates the calculation of spacecraft trajectories. At each time level, the spacecraft position, velocity, and mass are expanded in a high-order Taylor series whose coefficients are obtained through efficient differentiation arithmetic. This makes it possible to take very large time steps at minimal cost, resulting in large savings in computer time. The Taylor series algorithm is implemented primarily through three subroutines: (1) a driver routine that automatically introduces auxiliary variables and sets up initial conditions and integrates; (2) a routine that calculates system reduced derivatives using recurrence relations for quotients and products; and (3) a routine that determines the step size and sums the series. The order of accuracy used in a trajectory calculation is arbitrary and can be set by the user. The algorithm directly calculates the motion of other planetary bodies and does not require ephemeris files (except to start the calculation). The code also runs with Taylor series and Runge-Kutta used interchangeably for different phases of a mission.

Scott, James R.↗

Particle Swarm Optimization Toolbox

The Particle Swarm Optimization Toolbox is a library of evolutionary optimization tools developed in the MATLAB environment. The algorithms contained in the library include a genetic algorithm (GA), a single-objective particle swarm optimizer (SOPSO), and a multi-objective particle swarm optimizer (MOPSO). Development focused on both the SOPSO and MOPSO. A GA was included mainly for comparison purposes, and the particle swarm optimizers appeared to perform better for a wide variety of optimization problems. All algorithms are capable of performing unconstrained and constrained optimization. The particle swarm optimizers are capable of performing single and multi-objective optimization. The SOPSO and MOPSO algorithms are based on swarming theory and bird-flocking patterns to search the trade space for the optimal solution or optimal trade in competing objectives. The MOPSO generates Pareto fronts for objectives that are in competition. A GA, based on Darwin evolutionary theory, is also included in the library. The GA consists of individuals that form a population in the design space. The population mates to form offspring at new locations in the design space. These offspring contain traits from both of the parents. The algorithm is based on this combination of traits from parents to hopefully provide an improved solution than either of the original parents. As the algorithm progresses, individuals that hold these optimal traits will emerge as the optimal solutions. Due to the generic design of all optimization algorithms, each algorithm interfaces with a user-supplied objective function. This function serves as a "black-box" to the optimizers in which the only purpose of this function is to evaluate solutions provided by the optimizers. Hence, the user-supplied function can be numerical simulations, analytical functions, etc., since the specific detail of this function is of no concern to the optimizer. These algorithms were originally developed to support entry trajectory and guidance design for the Mars Science Laboratory mission but may be applied to any optimization problem.

Grant, Michael J.↗

Numerical recovery of material parameters in Euler-Bernoulli beam models

A fully Sinc-Galerkin method for recovering the spatially varying stiffness parameter in fourth-order time-dependence problems with fixed and cantilever boundary conditions is presented. The forward problems are discretized with a sinc basis in both the spatial and temporal domains. This yields an approximation solution which converges exponentially and is valid on the infinite time interval. When the forward methods are applied to parameter recovery problems, the resulting inverse problems are ill-posed. Tikhonov regularization is applied and the resulting minimization problems are solved via a quasi-Newton/trust region algorithm. The L-curve method is used to determine an appropriate value of the regularization parameter. Numerical results which highlight the method are given for problems with both fixed and cantilever boundary conditions.

Smith, R. C.↗

Reliability enhancement of Navier-Stokes codes through convergence acceleration

Methods for enhancing the reliability of Navier-Stokes computer codes through improving convergence characteristics are presented. The improving of these characteristics decreases the likelihood of code unreliability and user interventions in a design environment. The problem referred to as a 'stiffness' in the governing equations for propulsion-related flowfields is investigated, particularly in regard to common sources of equation stiffness that lead to convergence degradation of CFD algorithms. Von Neumann stability theory is employed as a tool to study the convergence difficulties involved. Based on the stability results, improved algorithms are devised to ensure efficient convergence in different situations. A number of test cases are considered to confirm a correlation between stability theory and numerical convergence. The examples of turbulent and reacting flow are presented, and a generalized form of the preconditioning matrix is derived to handle these problems, i.e., the problems involving additional differential equations for describing the transport of turbulent kinetic energy, dissipation rate and chemical species. Algorithms for unsteady computations are considered. The extension of the preconditioning techniques and algorithms derived for Navier-Stokes computations to three-dimensional flow problems is discussed. New methods to accelerate the convergence of iterative schemes for the numerical integration of systems of partial differential equtions are developed, with a special emphasis on the acceleration of convergence on highly clustered grids.

Merkle, Charles L.↗

Personal computer study of finite-difference methods for the transonic small disturbance equation

Calculation of unsteady flow phenomena requires careful attention to the numerical treatment of the governing partial differential equations. The personal computer provides a convenient and useful tool for the development of meshes, algorithms, and boundary conditions needed to provide time accurate solution of these equations. The one-dimensional equation considered provides a suitable model for the study of wave propagation in the equations of transonic small disturbance potential flow. Numerical results for effects of mesh size, extent, and stretching, time step size, and choice of far-field boundary conditions are presented. Analysis of the discretized model problem supports these numerical results. Guidelines for suitable mesh and time step choices are given.

Bland, Samuel R.↗

Personal computer study of finite-difference methods for the transonic small disturbance equation

Calculation of unsteady flow phenomena requires careful attention to the numerical treatment to the governing partial differential equations. The personal computer provides a convenient and useful tool for the development of meshes, algorithms, and boundary conditions needed to provide time accurate solution of these equations. The one-dimensional equation considered provides a suitable model for the study of wave propagation in the equations of transonic small disturbance potential flow. Numerical results for effects of mesh size, extent, and stretching, time step size, and choice of far-field boundary conditions are presented. Analysis of the discretized model problem supports these numerical results. Guidelines for suitable mesh and time step choices are given.

Bland, Samuel R.↗

Nonlinear estimation theory applied to the interplanetary orbit determination problem.

The performance of a second order filter which is identical to the algorithm developed by Athans et al. (1968) for the scalar case is evaluated through numerical simulation of a Jupiter flyby mission. The observations used in the simulation are on-board measurements of the angle between Jupiter and a fixed star taken at discrete time intervals. In the numerical study, the influence of each of the second order terms is evaluated.

Tapley, B. D.↗

Changing stepsize in the integration of differential equations using modified divided differences

Multistep methods for solving differential equations based on numerical integration formulas or numerical differentiation formulas (for stiff equations) require special provision for changing the stepsize. New algorithms are given which make the use of modified divided differences an attractive way to carry out the change in stepsize for such methods. Error estimation and some of the important factors in stepsize selection and the selection of integration order are also considered.

Krogh, F. T.↗