Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Numerical simulation of single and multiple jet interaction within a combustor

Single and multiple jet interaction in a combustor is simulated numerically to determine the effects of various k-epsilon models and boundary conditions as part of an attempt to understand the physics of the flow field inside the preburner of the Space Shuttle Main Engine. Due to the complexity of the physical and chemical phenomena involved, the model is simplified to two dimensions and a single-component nonreacting fluid. The computer code used is the modified TEACH code, which is a steady state isothermal fluid code using the SIMPLE algorithm. The physical validity and numerical accuracy of the model are established through comparisons with experimentally determined isothermal flow fields in a combustor.

Bai, S. Don↗
NASA NTRS1993

2D axisymmetric analysis of SRM ignition transient

To analyze ignition transient of Space Shuttle solid rocket motor, a transient two-dimensional numerical model based on turbulent compressible Navier-Stokes equations in a generalized coordinate system was developed. One-dimensional numerical models (Peretz et al., 1973; Han, 1992; Pardue and Han, 1992) with empirical correlations data obtained from steady turbulent boundary layer flows agrees reasonably well with test rocket data by adjusting a few parameters. However, a 1D model can not provide a physical insight into the complex multidimensional thermal fields and flowfields in the chamber and the converging-diverging rocket nozzle. As an interim step, a 2D model was developed and compared with test data. A modified version of SIMPLE algorithm was used for the numerical model, and the standard k-epsilon model with a wall function was used for turbulence closure. Transient flowfields and thermal fields in the combustion chamber and the attached nozzle were obtained for a selected rocket geometry and propellant. Transient behaviors of the flow and thermal fields were analyzed, and were found to be in good agreement with physical expectations.

Bai, S. D.↗
NASA NTRS1985

New results on the PLL false lock phenomenon

Conditions, based on the multipliers of a linear differential equation with periodic coefficients, for the occurrence of false lock in a phase lock loop (PLL) are presented. Two new and powerful algorithms are presented for computing the frequency difference between the reference and voltage controlled oscillator when the loop is false locked. The first algorithm expresses omega f sup -1 as a power series in the closed loop gain. The second algorithm expresses omega sup -1 as part of a solution to a nonlinear algebraic system of equations which can be solved by numerical methods. The power of both algorithms is illustrated by application and comparison.

Stensby, J. L.↗
NASA NTRS1989

A space-time discretization procedure for wave propagation problems

Higher order compact algorithms are developed for the numerical simulation of wave propagation by using the concept of a discrete dispersion relation. The dispersion relation is the imprint of any linear operator in space-time. The discrete dispersion relation is derived from the continuous dispersion relation by examining the process by which locally plane waves propagate through a chosen grid. The exponential structure of the discrete dispersion relation suggests an efficient splitting of convective and diffusive terms for dissipative waves. Fourth- and eighth-order convection schemes are examined that involve only three or five spatial grid points. These algorithms are subject to the same restrictions that govern the use of dispersion relations in the constructions of asymptotic expansions to nonlinear evolution equations. A new eighth-order scheme is developed that is exact for Courant numbers of 1, 2, 3, and 4. Examples are given of a pulse and step wave with a small amount of physical diffusion.

Davis, Sanford↗
NASA NTRS1988

An integrated approach to the synthesis of geometrically non-linear structures

An integrated approach to the minimum weight design of geometrically nonlinear three-dimensional truss structures with geometric imperfections, subject to inequality constraints on static displacements, stresses, local buckling and cross sectional areas, is investigated. The integrated structural synthesis problem involves design and response quantities as independent variables and equilibrium equations, describing the finite element model, as equality constraints. The nonlinear structural analysis and the optimization are thus merged together into a single process. A computer program developed to compute the constraint values and analytical gradients is coupled with a generalized reduced gradient algorithm to solve the integrated problem. Numerical results for a geometrically nonlinear shallow dome example problem are presented for various types of imperfections. Furthermore, it is found that the algorithm is capable of detecting and guarding against system as well as element elastic instability using equilibrium information only, that is, without imposing system and local buckling inequality constraints.

Smaoui, H.↗
NASA NTRS1992

A proposed study of multiple scattering through clouds up to 1 THz

A rigorous computation of the electromagnetic field scattered from an atmospheric liquid water cloud is proposed. The recent development of a fast recursive algorithm (Chew algorithm) for computing the fields scattered from numerous scatterers now makes a rigorous computation feasible. A method is presented for adapting this algorithm to a general case where there are an extremely large number of scatterers. It is also proposed to extend a new binary PAM channel coding technique (El-Khamy coding) to multiple levels with non-square pulse shapes. The Chew algorithm can be used to compute the transfer function of a cloud channel. Then the transfer function can be used to design an optimum El-Khamy code. In principle, these concepts can be applied directly to the realistic case of a time-varying cloud (adaptive channel coding and adaptive equalization). A brief review is included of some preliminary work on cloud dispersive effects on digital communication signals and on cloud liquid water spectra and correlations.

Gerace, G. C.↗
NASA NTRS1994

Model reduction of nonsquare linear MIMO systems using multipoint matrix continued-fraction expansions

This paper deals with the multipoint Cauer matrix continued-fraction expansion (MCFE) for model reduction of linear multi-input multi-output (MIMO) systems with various numbers of inputs and outputs. A salient feature of the proposed MCFE approach to model reduction of MIMO systems with square transfer matrices is its equivalence to the matrix Pade approximation approach. The Cauer second form of the ordinary MCFE for a square transfer function matrix is generalized in this paper to a multipoint and nonsquare-matrix version. An interesting connection of the multipoint Cauer MCFE method to the multipoint matrix Pade approximation method is established. Also, algorithms for obtaining the reduced-degree matrix-fraction descriptions and reduced-dimensional state-space models from a transfer function matrix via the multipoint Cauer MCFE algorithm are presented. Practical advantages of using the multipoint Cauer MCFE are discussed and a numerical example is provided to illustrate the algorithms.

Guo, Tong-Yi↗
NASA NTRS1985

Steady inviscid three-dimensional flows

The present analysis combines some of the theoretical concepts suggested by Hawthorne (1955) with a numerical integration procedure suggested by Martin (1978). The resulting algorithm is for inviscid subsonic flows. Thus, it is restricted to high Reynolds number flows. Chang and Adamczyk (1983) have provided a detailed derivation of the present algorithm along with a discussion of its stability bounds. The present paper represents a summary of this work. The integration of the continuity equation is considered along with an evaluation of the entropy, total temperature, and vorticity field. Attention is given to the shear-flow algorithm construction, and an application to a shear flow in a turning channel. A description of numerical results is also provided. The discussed algorithm represents a new procedure for solving inviscid subsonic three-dimensional rotational flows.

Adamczyk, J. J.↗
NASA NTRS1993

General-Purpose Time-Accurate Adaptive-Grid Method

Adaptive-grid method provides for generation of time-accurate grids used to solve wide variety of problems numerically. Intended use in computation of compressible flows. Part of solution method including algebraic grid-movement scheme; algorithm solving, by use of explicit numerical-integration scheme, Euler equations of unsteady flow; and temporal coupling routine utilizing grid-prediction/correction method to link dynamic grid with Euler-equation-solving algorithm. Improves ability to adapt grid to multiple features of solution and involves use of coarse grid in prediction stage of temporal coupling reducing central-processing-unit cost of obtaining new grid.

Bockelie, Michael J.↗
NASA NTRS1984

Improvements in the accuracy and stability of algorithms for the small-disturbance and full-potential equations applied to transonic flows

Numerical techniques that improve the accuracy and stability of algorithms for the small disturbance and full potential equations used to calculate transonic flows are described. For the small disturbance equation, the algorithm improvements are: (1) the use of monotone switches in the type dependent finite differencing, and (2) the use of stable and simple second order accurate spatial differencing; these improvements are for steady and unsteady transonic flows. For the steady full potential equation, the improvement is in the use of a monotone switch in the type dependent finite differencing of an approximate factorization (AF2) algorithm. All these improvements are implemented in present computer codes by making minor coding modifications.

Goorjian, P. M.↗
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗
NASA NTRS1996

Multigrid Methods for Fully Implicit Oil Reservoir Simulation

In this paper we consider the simultaneous flow of oil and water in reservoir rock. This displacement process is modeled by two basic equations: the material balance or continuity equations and the equation of motion (Darcy's law). For the numerical solution of this system of nonlinear partial differential equations there are two approaches: the fully implicit or simultaneous solution method and the sequential solution method. In the sequential solution method the system of partial differential equations is manipulated to give an elliptic pressure equation and a hyperbolic (or parabolic) saturation equation. In the IMPES approach the pressure equation is first solved, using values for the saturation from the previous time level. Next the saturations are updated by some explicit time stepping method; this implies that the method is only conditionally stable. For the numerical solution of the linear, elliptic pressure equation multigrid methods have become an accepted technique. On the other hand, the fully implicit method is unconditionally stable, but it has the disadvantage that in every time step a large system of nonlinear algebraic equations has to be solved. The most time-consuming part of any fully implicit reservoir simulator is the solution of this large system of equations. Usually this is done by Newton's method. The resulting systems of linear equations are then either solved by a direct method or by some conjugate gradient type method. In this paper we consider the possibility of applying multigrid methods for the iterative solution of the systems of nonlinear equations. There are two ways of using multigrid for this job: either we use a nonlinear multigrid method or we use a linear multigrid method to deal with the linear systems that arise in Newton's method. So far only a few authors have reported on the use of multigrid methods for fully implicit simulations. Two-level FAS algorithm is presented for the black-oil equations, and linear multigrid for two-phase flow problems with strong heterogeneities and anisotropies is studied. Here we consider both possibilities. Moreover we present a novel way for constructing the coarse grid correction operator in linear multigrid algorithms. This approach has the advantage in that it preserves the sparsity pattern of the fine grid matrix and it can be extended to systems of equations in a straightforward manner. We compare the linear and nonlinear multigrid algorithms by means of a numerical experiment.

Molenaar, J.↗
NASA NTRS2005

Continued Research into Characterizing the Preturbulence Environment for Sensor Development, New Hazard Algorithms and Experimental Flight Planning

The purpose of the research was to develop and test improved hazard algorithms that could result in the development of sensors that are better able to anticipate potentially severe atmospheric turbulence, which affects aircraft safety. The research focused on employing numerical simulation models to develop improved algorithms for the prediction of aviation turbulence. This involved producing both research simulations and real-time simulations of environments predisposed to moderate and severe aviation turbulence. The research resulted in the following fundamental advancements toward the aforementioned goal: 1) very high resolution simulations of turbulent environments indicated how predictive hazard indices could be improved resulting in a candidate hazard index that indicated the potential for improvement over existing operational indices, 2) a real-time turbulence hazard numerical modeling system was improved by correcting deficiencies in its simulation of moist convection and 3) the same real-time predictive system was tested by running the code twice daily and the hazard prediction indices updated and improved. Additionally, a simple validation study was undertaken to determine how well a real time hazard predictive index performed when compared to commercial pilot observations of aviation turbulence. Simple statistical analyses were performed in this validation study indicating potential skill in employing the hazard prediction index to predict regions of varying intensities of aviation turbulence. Data sets from a research numerical model where provided to NASA for use in a large eddy simulation numerical model. A NASA contractor report and several refereed journal articles where prepared and submitted for publication during the course of this research.

Kaplan, Michael L.↗
NASA NTRS1991

Transform methods for precision continuum and control models of flexible space structures

An open loop optimal control algorithm is developed for general flexible structures, based on Laplace transform methods. A distributed parameter model of the structure is first presented, followed by a derivation of the optimal control algorithm. The control inputs are expressed in terms of their Fourier series expansions, so that a numerical solution can be easily obtained. The algorithm deals directly with the transcendental transfer functions from control inputs to outputs of interest, and structural deformation penalties, as well as penalties on control effort, are included in the formulation. The algorithm is applied to several structures of increasing complexity to show its generality.

Lupi, Victor D.↗
NASA NTRS1999

Solving Upwind-Biased Discretizations: Defect-Correction Iterations

This paper considers defect-correction solvers for a second order upwind-biased discretization of the 2D convection equation. The following important features are reported: (1) The asymptotic convergence rate is about 0.5 per defect-correction iteration. (2) If the operators involved in defect-correction iterations have different approximation order, then the initial convergence rates may be very slow. The number of iterations required to get into the asymptotic convergence regime might grow on fine grids as a negative power of h. In the case of a second order target operator and a first order driver operator, this number of iterations is roughly proportional to h-1/3. (3) If both the operators have the second approximation order, the defect-correction solver demonstrates the asymptotic convergence rate after three iterations at most. The same three iterations are required to converge algebraic error below the truncation error level. A novel comprehensive half-space Fourier mode analysis (which, by the way, can take into account the influence of discretized outflow boundary conditions as well) for the defect-correction method is developed. This analysis explains many phenomena observed in solving non-elliptic equations and provides a close prediction of the actual solution behavior. It predicts the convergence rate for each iteration and the asymptotic convergence rate. As a result of this analysis, a new very efficient adaptive multigrid algorithm solving the discrete problem to within a given accuracy is proposed. Numerical simulations confirm the accuracy of the analysis and the efficiency of the proposed algorithm. The results of the numerical tests are reported.

Diskin, Boris↗
NASA NTRS1973

The calculation of efficient high precision orbits by optimum matching of the formulation and numerical integrator

The development of improved computer algorithms is considered for calculating earth satellite orbital trajectories by optimum selection of the analytical method that minimizes the number of perturbative acceleration computations for a given accuracy. A variation of parameter algorithm considering the equation of motion for a satellite proved superior for the geosynchronous orbit.

Velez, C. E.↗
NASA NTRS1977

An ILLIAC program for the numerical simulation of homogeneous incompressible turbulence

An algorithm and ILLIAC computer program, developed for the simulation of homogeneous incompressible turbulence in the presence of an applied mean strain, are described. The turbulence field is represented spatially by a truncated triple Fourier series (spectral method) and followed in time using a fourth-order Runge-Kutta algorithm. These include: (1) transformation of variables suggested by Taylor's sudden-distortion theory; (2) implicit viscous diffusion by use of an integrating factor; (3) implicit pressure calculation suggested by Taylor's sudden-distortion theory, and (4) inexpensive control of aliasing by random and phased coordinate shifts.

Rogallo, R. S.↗
NASA NTRS1983

Monotone implicit algorithms for the small-disturbance and full potential equations applied to transonic flows

Numerical calculations of transonic flows by potential equations typically use algorithms that change the method of calculation for regions of subsonic and supersonic flow. In this paper, implicit approximate-factorization algorithms are modified to use the monotonic switch in the type of finite-differencing that was developed by Godunov for the Euler equations. Calculations of flows over airfoils by these algorithms are compared with calculations by other methods that are in common usage. For the small-disturbance potential equation, comparisons are made with the Murman-Cole method and the monotone method of Engquist and Osher for both steady and unsteady flows. For the full potential equation, comparisons are made with the methods of Jameson and of Holst and Ballhaus for steady flows. The comparisons show that the monotone methods are more stable. For steady flows, solutions are obtained for cases where the Murman-Cole switch requires a time step over ten times smaller in order for the calculations to remain stable. These improvements are achieved with no increase in computer storage and only minor modifications in current codes.

Goorjian, P. M.↗