Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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,189 records · Page 66
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Development of advanced Navier-Stokes solver

The objective of research was to develop and validate new computational algorithms for solving the steady and unsteady Euler and Navier-Stokes equations. The end-products are new three-dimensional Euler and Navier-Stokes codes that are faster, more reliable, more accurate, and easier to use. The three-dimensional Euler and full/thin-layer Reynolds-averaged Navier-Stokes equations for compressible/incompressible flows are solved on structured hexahedral grids. The Baldwin-Lomax algebraic turbulence model is used for closure. The space discretization is based on a cell-centered finite-volume method augmented by a variety of numerical dissipation models with optional total variation diminishing limiters. The governing equations are integrated in time by an implicit method based on lower-upper factorization and symmetric Gauss-Seidel relaxation. The algorithm is vectorized on diagonal planes of sweep using two-dimensional indices in three dimensions. Convergence rates and the robustness of the codes are enhanced by the use of an implicit full approximation storage multigrid method.

Yoon, Seokkwan↗
NASA NTRS1996

Optimum Transonic Airfoils Based on the Euler Equations

We solve the problem of determining airfoils that approximate, in a least square sense, given surface pressure distributions in transonic flight regimes. The flow is modeled by means of the Euler equations and the solution procedure is an adjoint- based minimization algorithm that makes use of the inverse Theodorsen transform in order to parameterize the airfoil. Fast convergence to the optimal solution is obtained by means of the pseudo-time method. Results are obtained using three different pressure distributions for several free stream conditions. The airfoils obtained have given a trailing edge angle.

Iollo, Angelo↗
NASA NTRS2006

Strict Constraint Feasibility in Analysis and Design of Uncertain Systems

This paper proposes a methodology for the analysis and design optimization of models subject to parametric uncertainty, where hard inequality constraints are present. Hard constraints are those that must be satisfied for all parameter realizations prescribed by the uncertainty model. Emphasis is given to uncertainty models prescribed by norm-bounded perturbations from a nominal parameter value, i.e., hyper-spheres, and by sets of independently bounded uncertain variables, i.e., hyper-rectangles. These models make it possible to consider sets of parameters having comparable as well as dissimilar levels of uncertainty. Two alternative formulations for hyper-rectangular sets are proposed, one based on a transformation of variables and another based on an infinity norm approach. The suite of tools developed enable us to determine if the satisfaction of hard constraints is feasible by identifying critical combinations of uncertain parameters. Since this practice is performed without sampling or partitioning the parameter space, the resulting assessments of robustness are analytically verifiable. Strategies that enable the comparison of the robustness of competing design alternatives, the approximation of the robust design space, and the systematic search for designs with improved robustness characteristics are also proposed. Since the problem formulation is generic and the solution methods only require standard optimization algorithms for their implementation, the tools developed are applicable to a broad range of problems in several disciplines.

Crespo, Luis G.↗
NASA NTRS2012

Statistical Orbit Determination using the Particle Filter for Incorporating Non-Gaussian Uncertainties

The tracking of space objects requires frequent and accurate monitoring for collision avoidance. As even collision events with very low probability are important, accurate prediction of collisions require the representation of the full probability density function (PDF) of the random orbit state. Through representing the full PDF of the orbit state for orbit maintenance and collision avoidance, we can take advantage of the statistical information present in the heavy tailed distributions, more accurately representing the orbit states with low probability. The classical methods of orbit determination (i.e. Kalman Filter and its derivatives) provide state estimates based on only the second moments of the state and measurement errors that are captured by assuming a Gaussian distribution. Although the measurement errors can be accurately assumed to have a Gaussian distribution, errors with a non-Gaussian distribution could arise during propagation between observations. Moreover, unmodeled dynamics in the orbit model could introduce non-Gaussian errors into the process noise. A Particle Filter (PF) is proposed as a nonlinear filtering technique that is capable of propagating and estimating a more complete representation of the state distribution as an accurate approximation of a full PDF. The PF uses Monte Carlo runs to generate particles that approximate the full PDF representation. The PF is applied in the estimation and propagation of a highly eccentric orbit and the results are compared to the Extended Kalman Filter and Splitting Gaussian Mixture algorithms to demonstrate its proficiency.

Mashiku, Alinda↗
NASA NTRSDate not supplied

Automation of Geometric Accuracy Assessment Algorithm

When end-users are using multiple satellite images for a study the first step is often the assessment and rectification of geolocation offsets. We have developed an automated algorithm to calculate the geometric offsets between two satellite images. It splits both images into subset images (chips) and resamples them to a common resolution. Offsets are imposed on matching chips and the Pearson Cross Correlation (PCC) value calculated for each offset, where the best PCC gives the true offsets. With the true offsets corrected for, a quality of image registration is calculated, measurement uncertainty (MU). The MU threshold value is non-uniform across sensors because it depends on spectral characteristics of each sensor. Previously, the MU threshold was determined by manual inspection for each new sensor assessed. In this study, we automated MU threshold determination. 1/MU vs calculated offset approximates a Gaussian function in shape, see abstract image. A Gaussian function is fit to this dataset, and the root of the third derivative is calculated and applied as a quality threshold, removing the data of lower quality from the final assessment of image offsets. We apply this algorithm to commercial satellite data for proof of concept.

Alana Semple↗
NASA NTRS1987

An implicit flux-split algorithm for the compressible Navier-Stokes equations

An implicit upwind scheme for the compressible Navier-Stokes equations is described and applied to the internal flow in a dual-throat nozzle. The method is second-order accurate spatially and naturally dissipative. A spatially-split approximate factorization method is used to obtain efficient steady-state solutions on the NASA Langley VPS-32 (CYBER 205) supercomputer.

Thomas, James L.↗
NASA NTRS2013

Data Compression Algorithm Architecture for Large Depth-of-Field Particle Image Velocimeters

A large depth-of-field particle image velocimeter (PIV) is designed to characterize dynamic dust environments on planetary surfaces. This instrument detects lofted dust particles, and senses the number of particles per unit volume, measuring their sizes, velocities (both speed and direction), and shape factors when the particles are large. To measure these particle characteristics in-flight, the instrument gathers two-dimensional image data at a high frame rate, typically >4,000 Hz, generating large amounts of data for every second of operation, approximately 6 GB/s. To characterize a planetary dust environment that is dynamic, the instrument would have to operate for at least several minutes during an observation period, easily producing more than a terabyte of data per observation. Given current technology, this amount of data would be very difficult to store onboard a spacecraft, and downlink to Earth. Since 2007, innovators have been developing an autonomous image analysis algorithm architecture for the PIV instrument to greatly reduce the amount of data that it has to store and downlink. The algorithm analyzes PIV images and automatically reduces the image information down to only the particle measurement data that is of interest, reducing the amount of data that is handled by more than 10(exp 3). The state of development for this innovation is now fairly mature, with a functional algorithm architecture, along with several key pieces of algorithm logic, that has been proven through field test data acquired with a proof-of-concept PIV instrument.

Bos, Brent↗
NASA NTRS1984

Parameter estimation for the Euler-Bernoulli-beam

An approximation involving cubic spline functions for parameter estimation problems in the Euler-Bernoulli-beam equation (phrased as an optimization problem with respect to the parameters) is described and convergence is proved. The resulting algorithm was implemented and several of the test examples are documented. It is observed that the use of penalty terms in the cost functional can improve the rate of convergence.

Graif, E.↗
NASA NTRS1985

Implicit/explicit analysis of interactive phenomena in: supersonic, chemically-reacting, mixing and boundary layer problems

An efficient implicit/explicit procedure for solving the parabolized Navier-Stokes (PNS) equations to analyze supersonic, viscous, chemically-reacting flows is presented. The approach combines a fully-implicit algorithm for solving the parabolic mixing/boundary layer equations with an explicit algorithm for determining the hyperbolic pressure field. The unified model, SPLITP, contains provisions for treating bounding/embedded subsonic regions using a pressure-splitting procedure which suppresses elliptic (upstream influence) effects without recourse to sublayer approximations. Several two-equation turbulence models with compressibility and curvature-correction terms are incorporated into SPLITP. Applications to a variety of flow problems are presented which include: ducted supersonic mixing and combustion flowfields, free jets and plumes, and, curved boundary layers and wall jets.

Dash, S. M.↗
NASA NTRS1986

Comparison of Euler and full potential marching techniques for flows over complex configurations

Two recently developed aerodynamic prediction techniques based on the steady full potential equation and the unsteady Euler equations have been applied to a variety of three-dimensional supersonic flow problems exhibiting embedded subsonic regions. Both techniques utilize planar Gauss-Seidel relaxation in the marching direction and approximate factorization in the cross-flow plane. A conservative switching scheme and flux bias technique are employed in the full potential method to transition from the supersonic marching procedure to a subsonic relaxation algorithm and vice versa. A new unified approach with finite volume, high accuracy (up to third order) Total Variation Diminishing formulation (based on Roe's scheme) is used in the Euler solver. In the supersonic regions of the flow an 'infinitely large' time step is employed, and a finite time step is applied in the subsonic regions of the flow to reach the steady-state as a time-asymptote. Numerical solutions are obtained for a number of complex configurations, including: (1) an elliptic waverider, (2) a realistic fighter configuration, (3) the Space Shuttle, and (4) a Shuttle-like configuration. Both the Full Potential and Euler numerical results are in good agreement with available experimental data.

Szema, K. Y.↗
NASA NTRS1986

Navier-Stokes computations of lee-side flows over delta wings

Solutions to the Navier-Stokes equations for the flow over delta wings are computed with emphasis on the separated vortical flows developing on the lee side at high angles of attack. A recently developed implicit algorithm is used which employs upwind differencing for the pressure and convection terms and central differencing for the shear stress and heat transfer terms. Solutions to both the three-dimensional equations and the approximate conical flow equations are compared parametrically with an extensive experimental data base at supersonic speeds. The computations indicate that the conical flow approximation provides results in close agreement with the three-dimensional equations, even to angles of attack as high as 20 degrees. Good agreement with experimentally measured pressures and vapor screen photographs is obtained for the conditions investigated. The method predicts the classical pattern of vortical flow over a delta wing and transition to other flow patterns as the leading edge sweep angle and leading edge normal Mach number are varied.

Thomas, J. L.↗
NASA NTRS1986

Ground-based time-guidance algorithm for control of airplanes in a time-metered air traffic control environment: A piloted simulation study

The rapidly increasing costs of flight operations and the requirement for increased fuel conservation have made it necessary to develop more efficient ways to operate airplanes and to control air traffic for arrivals and departures to the terminal area. One concept of controlling arrival traffic through time metering has been jointly studied and evaluated by NASA and ONERA/CERT in piloted simulation tests. From time errors attained at checkpoints, airspeed and heading commands issued by air traffic control were computed by a time-guidance algorithm for the pilot to follow that would cause the airplane to cross a metering fix at a preassigned time. These tests resulted in the simulated airplane crossing a metering fix with a mean time error of 1.0 sec and a standard deviation of 16.7 sec when the time-metering algorithm was used. With mismodeled winds representing the unknown in wind-aloft forecasts and modeling form, the mean time error attained when crossing the metering fix was increased and the standard deviation remained approximately the same. The subject pilots reported that the airspeed and heading commands computed in the guidance concept were easy to follow and did not increase their work load above normal levels.

Knox, C. E.↗
NASA NTRS1989

Review of a code development and calibration program in support of the aeroassist flight experiment

The code development and calibration program for the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) is reviewed, with emphasis directed toward support of the Aeroassist Flight Experiment (AFE). The flight project is designed to obtain data which will be used in the validation of computational fluid dynamic approximation methods. Comparisons between experimental data and numerical simulation focus on perfect-gas tests over a scale model of the AFE and on flight and ground tests which challenge some aspect of the thermochemical nonequilibrium model. In the first case, the gas model is simple, but the grid-related problems of defining the real vehicle are present. In the second case, the vehicle geometries are simple, but thermochemical processes must be modeled correctly in order to compare with the experimental data. These comparisons are described as calibration runs because they test elements of the numerical simulation, but no single data set adequately simulates the full-scale AFE flight conditions. Comparisons between computation and experiment over a broad range of data sets show generally good agreement, though some aspects of the numerical model require further development.

Gnoffo, Peter A.↗
NASA NTRS1989

Globally convergent techniques in nonlinear Newton-Krylov

Some convergence theory is presented for nonlinear Krylov subspace methods. The basic idea of these methods is to use variants of Newton's iteration in conjunction with a Krylov subspace method for solving the Jacobian linear systems. These methods are variants of inexact Newton methods where the approximate Newton direction is taken from a subspace of small dimensions. The main focus is to analyze these methods when they are combined with global strategies such as linesearch techniques and model trust region algorithms. Most of the convergence results are formulated for projection onto general subspaces rather than just Krylov subspaces.

Brown, Peter N.↗
NASA NTRS1990

Pattern recognition with parallel associative memory

An examination is conducted of the feasibility of searching targets in aerial photographs by means of a parallel associative memory (PAM) that is based on the nearest-neighbor algorithm; the Hamming distance is used as a measure of closeness, in order to discriminate patterns. Attention has been given to targets typically used for ground-control points. The method developed sorts out approximate target positions where precise localizations are needed, in the course of the data-acquisition process. The majority of control points in different images were correctly identified.

Toth, Charles K.↗
NASA NTRS1993

GTARG - The TOPEX/Poseidon ground track maintenance maneuver targeting program

GTARG is a computer program used to design orbit maintenance maneuvers for the TOPEX/Poseidon satellite. These maneuvers ensure that the ground track is kept within +/-1 km with of an = 9.9 day exact repeat pattern. Maneuver parameters are determined using either of two targeting strategies: longitude targeting, which maximizes the time between maneuvers, and time targeting, in which maneuvers are targeted to occur at specific intervals. The GTARG algorithm propagates nonsingular mean elements, taking into account anticipated error sigma's in orbit determination, Delta v execution, drag prediction and Delta v quantization. A satellite unique drag model is used which incorporates an approximate mean orbital Jacchia-Roberts atmosphere and a variable mean area model. Maneuver Delta v magnitudes are targeted to precisely maintain either the unbiased ground track itself, or a comfortable (3 sigma) error envelope about the unbiased ground track.

Shapiro, Bruce E.↗
NASA NTRS2000

Timing analysis by model checking

The safety of modern avionics relies on high integrity software that can be verified to meet hard real-time requirements. The limits of verification technology therefore determine acceptable engineering practice. To simplify verification problems, safety-critical systems are commonly implemented under the severe constraints of a cyclic executive, which make design an expensive trial-and-error process highly intolerant of change. Important advances in analysis techniques, such as rate monotonic analysis (RMA), have provided a theoretical and practical basis for easing these onerous restrictions. But RMA and its kindred have two limitations: they apply only to verifying the requirement of schedulability (that tasks meet their deadlines) and they cannot be applied to many common programming paradigms. We address both these limitations by applying model checking, a technique with successful industrial applications in hardware design. Model checking algorithms analyze finite state machines, either by explicit state enumeration or by symbolic manipulation. Since quantitative timing properties involve a potentially unbounded state variable (a clock), our first problem is to construct a finite approximation that is conservative for the properties being analyzed-if the approximation satisfies the properties of interest, so does the infinite model. To reduce the potential for state space explosion we must further optimize this finite model. Experiments with some simple optimizations have yielded a hundred-fold efficiency improvement over published techniques.

Naydich, Dimitri↗
NASA NTRS2003

Sub-problem Optimization With Regression and Neural Network Approximators

Design optimization of large systems can be attempted through a sub-problem strategy. In this strategy, the original problem is divided into a number of smaller problems that are clustered together to obtain a sequence of sub-problems. Solution to the large problem is attempted iteratively through repeated solutions to the modest sub-problems. This strategy is applicable to structures and to multidisciplinary systems. For structures, clustering the substructures generates the sequence of sub-problems. For a multidisciplinary system, individual disciplines, accounting for coupling, can be considered as sub-problems. A sub-problem, if required, can be further broken down to accommodate sub-disciplines. The sub-problem strategy is being implemented into the NASA design optimization test bed, referred to as "CometBoards." Neural network and regression approximators are employed for reanalysis and sensitivity analysis calculations at the sub-problem level. The strategy has been implemented in sequential as well as parallel computational environments. This strategy, which attempts to alleviate algorithmic and reanalysis deficiencies, has the potential to become a powerful design tool. However, several issues have to be addressed before its full potential can be harnessed. This paper illustrates the strategy and addresses some issues.

Guptill, James D.↗