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,531 records · Page 85

An algorithm for optimal single linear feature extraction from several Gaussian pattern classes

A computational algorithm is presented for the extraction of an optimal single linear feature from several Gaussian pattern classes. The algorithm minimizes the increase in the probability of misclassification in the transformed (feature) space. Numerical results on the application of this procedure to the remotely sensed data from the Purdue Cl flight line as well as LANDSAT data are presented. It was found that classification using the optimal single linear feature yielded a value for the probability of misclassification on the order of 30% less than that obtained by using the best single untransformed feature. Also, the optimal single linear feature gave performance results comparable to those obtained by using the two features which maximized the average divergence.

Starks, S. A.↗

Computation of the inviscid supersonic flow over an external axial corner

A second-order finite-difference procedure is used to evaluate the inviscid supersonic flowfield surrounding an external axial corner composed of swept planar compression surfaces and representing the inlets on existing high-speed aircraft. The governing partial differential equations in conservation-law form are hyperbolic with respect to the axial coordinate and are solved iteratively by means of MacCormack's algorithm. The procedure treats both the peripheral shock wave and vortical singularities as discontinuities. Numerical results are presented for two parametric studies regarding the effects on the flowfield of varying the free-stream Mach number and the leading edge sweep of the horizontal wedge. Results of parametric Mach number study agree with the Mach number independence principle in that as the Mach number increases, such characteristics as shock shape, cross-flow sonic line location, and vortical singularity position approach an asymptote.

Kutler, P.↗

Optimal analytic rendezvous using Clohessy-Wiltshire equations

The optimal solution time that minimizes the sum of the two applied impulses necessary to rendezvous is obtained analytically for the Clohessy-Wiltshire equations with a linear gravity model assumption. A plume impingement inequality constraint on the solution is examined, and an optimal policy is developed. Numerical tests are conducted to verify the analysis and to illustrate the optimal solution algorithm.

Jezewski, D. J.↗

An analytic approach to optimal rendezvous using Clohessy-Wiltshire equations

An analytic approach is used to obtain the optimal solution time that minimizes the sum of the two applied impulses necessary to rendezvous for the Clohessy-Wiltshire equations. A plume impingement inequality constraint on the solution is examined, and an optimal policy is developed. Numerical tests are conducted to verify the analysis and to illustrate the optimal solution algorithm.

Jezewski, D. J.↗

A numerical simulation of hypersonic viscous flow over arbitrary geometries at angle of attack

An implicit conservative, noniterative, finite-difference algorithm that predicts the supersonic, laminar or turbulent viscous flow about arbitrary geometries at large angles of attack is presented. The three-dimensional parabolized form of the thin-layer Navier-Stokes equations are written in generalized coordinates. These equations are solved using the delta form of the Beam-Warming implicit algorithm. Flow field simulations have been obtained for a blunt biconic with windward and leeward cuts and an X-24C lifting body for both laminar and turbulent flow at various Mach numbers and angles of attack. When compared with experiment or with previous theories, these computational predictions show good agreement.

Chaussee, D. S.↗

Numerical simulation of wall-bounded turbulent shear flows

Developments in three dimensional, time dependent numerical simulation of turbulent flows bounded by a wall are reviewed. Both direct and large eddy simulation techniques are considered within the same computational framework. The computational spatial grid requirements as dictated by the known structure of turbulent boundary layers are presented. The numerical methods currently in use are reviewed and some of the features of these algorithms, including spatial differencing and accuracy, time advancement, and data management are discussed. A selection of the results of the recent calculations of turbulent channel flow, including the effects of system rotation and transpiration on the flow are included.

Moin, P.↗

Shock diffraction computations over complex structures

This work contains the results of a study aimed at the development of two- and three-dimensional numerical procedures for computing the flowfield generated by the interaction of a blast wave and a rigid body. A number of numerical procedures were applied to two-dimensional problems including both implicit and explicit algorithms. Each was tried on the blast wave-cylinder interaction problem. MacCormack's (1969) method with added fourth-order dissipation yielded the best results and was then applied to the blast wave-truck interaction problems in two dimensions. MacCormack's method was also used in three dimensions to determine the flowfield that results when a blast wave strikes a rectangular parallelepiped at an arbitrary angle. Both the twoand three-dimensional computations were compared with experiments in a number of ways. Two dimensional density contours show qualitative agreement for shock front location and Mach stem formation with spark shadowgraphs taken in a shock tube. Pressure-time histories indicate good quantitative agreement between theory and experiment both in two- and three-dimensions.

Mark, A.↗

Application of improved numerical schemes

Two approaches which accelerate the solution of the steady state Navier-Stokes equations are discussed. The SIMPLER algorithm, a revised version of SIMPLE, provides a more accurate pressure field for each iteration through the momentum equations, thereby speeding convergence. PISO (Pressure Implicit Split Operator), performs a secondary correction of the velocity and pressure fields (after the typical pressure correction) which enhances convergence. Both schemes account for terms neglected in the SIMPLE approach, but do so in slightly different ways. Two dimensional driven cavity flow and flow over a step were calculated to examine the effect of geometry on the performance of these schemes. Computations were carried out on a series of progressively finer grids. The effect of relaxation number on convergence rate was analyzed, using results from SIMPLE as criteria for performance correlation. Results show: (1) the improved schemes promoted convergence by up to 60% for the driven cavity and 40% for flow over a step; (2) for the driven cavity problem, the efficiency of PISO and SIMPLER increased as the number of nodes increased; and (3) to ensure faster convergence, higher relaxation numbers must be applied.

Neely, G. H.↗

Estimation of coefficients and boundary parameters in hyperbolic systems

Semi-discrete Galerkin approximation schemes are considered in connection with inverse problems for the estimation of spatially varying coefficients and boundary condition parameters in second order hyperbolic systems typical of those arising in 1-D surface seismic problems. Spline based algorithms are proposed for which theoretical convergence results along with a representative sample of numerical findings are given.

Banks, H. T.↗

Formation and inflammation of a turbulent jet

The formation and inflammation of a planar, turbulent jet in an incompressible medium is modeled numerically by the use of the random vortex method amended by a flame propagation algorithm. The results demonstrate the dominant influence of turbulent eddies and their interactions upon the development of the jet. Its growth is shown to consist of three stages: formation of small eddies, pairing of eddies with the same sign of circulation, and pairing of eddies of opposite signs. On this basis a number of features of the jet mechanism are revealed, namely penetration, engulfment, entrainment, and intermittency. Two cases of inflammation are considered. In one, the jet is ignited at the center of the orifice, the solution tracing its own inflammation. In the other, combustion is initiated across its full cross section, the results modeling the action of a turbulent torch as it spreads the flame into the combustible surroundings. In both cases the flow field is still dominated by the turbulent eddies and their interactions. However, the coherence among them is encumbered as a consequence of expansion due to the exothermicity of the combustion process.

Ghoniem, A. F.↗

Numerical simulation of wall-bounded turbulent shear flows

Developments in three dimensional, time dependent numerical simulation of turbulent flows bounded by a wall are reviewed. Both direct and large eddy simulation techniques are considered within the same computational framework. The computational spatial grid requirements as dictated by the known structure of turbulent boundary layers are presented. The numerical methods currently in use are reviewed and some of the features of these algorithms, including spatial differencing and accuracy, time advancement, and data management are discussed. A selection of the results of the recent calculations of turbulent channel flow, including the effects of system rotation and transpiration on the flow are included. Previously announced in STAR as N82-28577

Moin, P.↗

On realizations of least-squares estimation and Kalman filtering by systolic arrays

Least-squares (LS) estimation is a basic operation in many signal processing problems. Given y = Ax + v, where A is a m x n coefficient matrix, y is a m x 1 observation vector, and v is a m x 1 zero mean white noise vector, a simple least-squares solution is finding the estimated vector x which minimizes the norm of /Ax-y/. It is well known that for an ill-conditioned matrix A, solving least-squares problems by orthogonal triangular (QR) decomposition and back substitution has robust numerical properties under finite word length effect since 2-norm is preserved. Many fast algorithms have been proposed and applied to systolic arrays. Gentleman-Kung (1981) first presented the trianglular systolic array for a basic Givens reduction. McWhirter (1983) used this array structure to find the least-squares estimation errors. Then by geometric approach, several different systolic array realizations of the recursive least-squares estimation algorithms of Lee et al (1981) were derived by Kalson-Yao (1985). Basic QR decomposition algorithms are considered in this paper and it is found that under a one-row time updating situation, the Householder transformation degenerates to a simple Givens reduction. Next, an improved least-squares estimation algorithm is derived by considering a modified version of fast Givens reduction. From this approach, the basic relationship between Givens reduction and Modified-Gram-Schmidt transformation can easily be understood. This improved algorithm also has simpler computational and inter-cell connection complexities while compared with other known least-squares algorithms and is more realistic for systolic array implementation.

Chen, M. J.↗

On the construction of the Voronoi mesh on a sphere

The primary feature of the novel construction of the Voronoi (1908) mesh presented is the algorithm's adding of points one-at-a-time, until the final mesh is achieved. The addition of one point to an existing Voronoi mesh of K points means that only local changes are needed to construct a mesh of K + 1 points; this construction is especially suited to time-dependent problems in virtue of the ability to reduce the construction to O(N) operations when configurations are close, while the algorithm does not break down in cases of configurations that are far apart. Illustrative numerical experiments substantiate the O(N) operation count for a typical case.

Augenbaum, J. M.↗

Numerical difficulties associated with using equality constraints to achieve multi-level decomposition in structural optimization

There has been recent interest in multidisciplinary multilevel optimization applied to large engineering systems. The usual approach is to divide the system into a hierarchy of subsystems with ever increasing detail in the analysis focus. Equality constraints are usually placed on various design quantities at every successive level to ensure consistency between levels. In many previous applications these equality constraints were eliminated by reducing the number of design variables. In complex systems this may not be possible and these equality constraints may have to be retained in the optimization process. In this paper the impact of such a retention is examined for a simple portal frame problem. It is shown that the equality constraints introduce numerical difficulties, and that the numerical solution becomes very sensitive to optimization parameters for a wide range of optimization algorithms.

Thareja, R.↗

Predicting False Lock in Phase-Locked Loops

Theoretical paper discusses advances in mathematical analysis of phase-locked loops. Presents new results in prediction of false locking. Interest to users of phase-lock circuits and to researchers seeking ways to detect or avoid false lock. Equations solved numerically by Newton-Raphson technique, with Jacobian computed by finite-difference scheme. Algorithm produces results limited only by precision of computer on which executed.

Reed, Bill↗

Dual structural-control optimization of large space structures

A new approach is proposed for solving dual structural-control optimization problems for high-order flexible space structures where reduced-order structural models are employed. For a given initial structural dessign, a quadratic control cost is minimized subject to a constant-mass constraint. The sensitivity of the optimal control cost with respect to the stuctural design variables is then determined and used to obtain successive structural redesigns using a contrained gradient optimization algorithm. This process is repeated until the constrained control cost sensitivity becomes negligible. A numerical example is presented which demonstrates that this new approach effectively addresses the problem of dual optimization for potentially very high-order structures.

Messac, A.↗

Shape design sensitivity analysis and optimization of three dimensional elastic solids using geometric modeling and automatic regridding

An automatic regridding method and a three dimensional shape design parameterization technique were constructed and integrated into a unified theory of shape design sensitivity analysis. An algorithm was developed for general shape design sensitivity analysis of three dimensional eleastic solids. Numerical implementation of this shape design sensitivity analysis method was carried out using the finite element code ANSYS. The unified theory of shape design sensitivity analysis uses the material derivative of continuum mechanics with a design velocity field that represents shape change effects over the structural design. Automatic regridding methods were developed by generating a domain velocity field with boundary displacement method. Shape design parameterization for three dimensional surface design problems was illustrated using a Bezier surface with boundary perturbations that depend linearly on the perturbation of design parameters. A linearization method of optimization, LINRM, was used to obtain optimum shapes. Three examples from different engineering disciplines were investigated to demonstrate the accuracy and versatility of this shape design sensitivity analysis method.

Yao, Tse-Min↗

Estimation of coefficients and boundary parameters in hyperbolic systems

Semi-discrete Galerkin approximation schemes in connection with inverse problems for the estimation of spatially varying coefficients and boundary condition parameters in second order hyperbolic systems typical of those arising in 1-D surface seismic problems are considered. Spline based algorithms are proposed for which theoretical convergence results along with a representative sample of numerical findings are given.

Banks, H. T.↗