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 865 records · Page 48

Baseline mathematics and geodetics for tracking operations

Various geodetic and mapping algorithms are analyzed as they apply to radar tracking systems and tested in extended BASIC computer language for real time computer applications. Closed-form approaches to the solution of converting Earth centered coordinates to latitude, longitude, and altitude are compared with classical approximations. A simplified approach to atmospheric refractivity called gradient refraction is compared with conventional ray tracing processes. An extremely detailed set of documentation which provides the theory, derivations, and application of algorithms used in the programs is included. Validation methods are also presented for testing the accuracy of the algorithms.

James, R.↗

Comparison of polynomial approximations and artificial neural nets for response surfaces in engineering optimization

Engineering optimization problems involve minimizing some function subject to constraints. In areas such as aircraft optimization, the constraint equations may be from numerous disciplines such as transfer of information between these disciplines and the optimization algorithm. They are also suited to problems which may require numerous re-optimizations such as in multi-objective function optimization or to problems where the design space contains numerous local minima, thus requiring repeated optimizations from different initial designs. Their use has been limited, however, by the fact that development of response surfaces randomly selected or preselected points in the design space. Thus, they have been thought to be inefficient compared to algorithms to the optimum solution. A development has taken place in the last several years which may effect the desirability of using response surfaces. It may be possible that artificial neural nets are more efficient in developing response surfaces than polynomial approximations which have been used in the past. This development is the concern of the work.

Carpenter, William C.↗

The Microwave Radiative Properties of Falling Snow Derived from Nonspherical Ice Particle Models. Part II: Initial Testing Using Radar, Radiometer and In Situ Observations

In this study, two different particle models describing the structure and electromagnetic properties of snow are developed and evaluated for potential use in satellite combined radar-radiometer precipitation estimation algorithms. In the first model, snow particles are assumed to be homogeneous ice-air spheres with single-scattering properties derived from Mie theory. In the second model, snow particles are created by simulating the self-collection of pristine ice crystals into aggregate particles of different sizes, using different numbers and habits of the collected component crystals. Single-scattering properties of the resulting nonspherical snow particles are determined using the discrete dipole approximation. The size-distribution-integrated scattering properties of the spherical and nonspherical snow particles are incorporated into a dual-wavelength radar profiling algorithm that is applied to 14- and 34-GHz observations of stratiform precipitation from the ER-2 aircraft-borne High-Altitude Imaging Wind and Rain Airborne Profiler (HIWRAP) radar. The retrieved ice precipitation profiles are then input to a forward radiative transfer calculation in an attempt to simulate coincident radiance observations from the Conical Scanning Millimeter-Wave Imaging Radiometer (CoSMIR). Much greater consistency between the simulated and observed CoSMIR radiances is obtained using estimated profiles that are based upon the nonspherical crystal/aggregate snow particle model. Despite this greater consistency, there remain some discrepancies between the higher moments of the HIWRAP-retrieved precipitation size distributions and in situ distributions derived from microphysics probe observations obtained from Citation aircraft underflights of the ER-2. These discrepancies can only be eliminated if a subset of lower-density crystal/aggregate snow particles is assumed in the radar algorithm and in the interpretation of the in situ data.

Ice particles; Radiances; Radiative transfer; Airc↗

Atmospheric and surface temperatures and airborne dust amounts during late southern summer from Mariner 9 IRIS data

The temperature structure and dust loading of the Martian atmosphere are investigated using thermal emission spectra recorded in 1972 by the Mariner 9 infrared interferometer spectrometer (IRIS). The analysis focuses on a subset of data consisting of approximately 2400 spectra obtained near the end of the southern summer season (L(sub s) equal to 343 deg to 348 deg), after the global dust storm had largely abated and airborne dust amounts were subsiding to background values. Simultaneous retrieval of the vertical distribution of both atmospheric temperature and dust optical depth is accomplished through an iterative procedure which is performed on each individual spectrum. The atmospheric transmittances are calculated using a Voigt quasi-random band model, which includes absorption by CO2 and dust, but neglects the effects of multiple scattering. Vertical profiles of temperature and dust optical depth are obtained using modified algorithms. These profiles are used to construct global maps of temperature and dust optical depth as functions of latitude (+/- 90 deg), altitude (approximately 0-50 km), and local time of day.

Santee, M.↗

Constructing Simplified Plans via Truth Criteria Approximation

This paper has presented an approach to dealing with the complexity of explanation-based learning plans in complex domains. This approach uses a simplified algorithm to construct plans, and employs later refinements to repair bugs in constructed plans. This algorithm has the theoretical properties of completeness and convergence upon soundness. This incremental reasoning planning and learning algorithm has been implemented using a partial-order constraint posting planner and empirically compared to a conventional exhaustive reasoning partial-order constraint-posting planner and learning algorithm. This comparison showed that 1) incremental reasoning significantly reduced learning costs compared to exhaustive reasoning, 2) Explanation-based Learning (EBL) reduced failures from incremental reasoning, 3) EBL with incremental reasoning required less search to solve problems than EBL with exhaustive reasoning.

Explanation-based learning EBL incremental reasoni↗

On Managing the Use of Surrogates in General Nonlinear Optimization and MDO

This paper is concerned with a trust region approximation management framework (AMF) for solving the nonlinear programming problem in general and multidisciplinary optimization problems in particular The intent of the AMF methodology is to facilitate the solution of optimization problems with high-fidelity models. While such models are designed to approximate the physical phenomena they describe to a high degree of accuracy, their use in a repetitive procedure, for example, iterations of an optimization or a search algorithm, make such use prohibitively expensive. An improvement in design with lower-fidelity, cheaper models, however, does not guarantee a corresponding improvement for the higher-fidelity problem. The AMF methodology proposed here is based on a class of multilevel methods for constrained optimization and is designed to manage the use of variable-fidelity approximations or models in a systematic way that assures convergence to critical points of the original high-fidelity problem.

Alexandrov, Natalia M.↗

Cascade Optimization for Aircraft Engines With Regression and Neural Network Analysis - Approximators

The NASA Engine Performance Program (NEPP) can configure and analyze almost any type of gas turbine engine that can be generated through the interconnection of a set of standard physical components. In addition, the code can optimize engine performance by changing adjustable variables under a set of constraints. However, for engine cycle problems at certain operating points, the NEPP code can encounter difficulties: nonconvergence in the currently implemented Powell's optimization algorithm and deficiencies in the Newton-Raphson solver during engine balancing. A project was undertaken to correct these deficiencies. Nonconvergence was avoided through a cascade optimization strategy, and deficiencies associated with engine balancing were eliminated through neural network and linear regression methods. An approximation-interspersed cascade strategy was used to optimize the engine's operation over its flight envelope. Replacement of Powell's algorithm by the cascade strategy improved the optimization segment of the NEPP code. The performance of the linear regression and neural network methods as alternative engine analyzers was found to be satisfactory. This report considers two examples-a supersonic mixed-flow turbofan engine and a subsonic waverotor-topped engine-to illustrate the results, and it discusses insights gained from the improved version of the NEPP code.

Patnaik, Surya N.↗

The asymptotic spectra of banded Toeplitz and quasi-Toeplitz matrices

Toeplitz matrices occur in many mathematical, as well as, scientific and engineering investigations. This paper considers the spectra of banded Toeplitz and quasi-Toeplitz matrices with emphasis on non-normal matrices of arbitrarily large order and relatively small bandwidth. These are the type of matrices that appear in the investigation of stability and convergence of difference approximations to partial differential equations. Quasi-Toeplitz matrices are the result of non-Dirichlet boundary conditions for the difference approximations. The eigenvalue problem for a banded Toeplitz or quasi-Toeplitz matrix of large order is, in general, analytically intractable and (for non-normal matrices) numerically unreliable. An asymptotic (matrix order approaches infinity) approach partitions the eigenvalue analysis of a quasi-Toeplitz matrix into two parts, namely the analysis for the boundary condition independent spectrum and the analysis for the boundary condition dependent spectrum. The boundary condition independent spectrum is the same as the pure Toeplitz matrix spectrum. Algorithms for computing both parts of the spectrum are presented. Examples are used to demonstrate the utility of the algorithms, to present some interesting spectra, and to point out some of the numerical difficulties encountered when conventional matrix eigenvalue routines are employed for non-normal matrices of large order. The analysis for the Toeplitz spectrum also leads to a diagonal similarity transformation that improves conventional numerical eigenvalue computations. Finally, the algorithm for the asymptotic spectrum is extended to the Toeplitz generalized eigenvalue problem which occurs, for example, in the stability of Pade type difference approximations to differential equations.

Beam, Richard M.↗

Range data description based on multiple characteristics

An algorithm for describing range images based on Mean curvature (H) and Gaussian curvature (K) is presented. Range images are unique in that they directly approximate the physical surfaces of a real world 3-D scene. The curvature parameters are derived from the fundamental theorems of differential geometry and provides visible invariant pixel labels that can be used to characterize the scene. The sign of H and K can be used to classify each pixel into one of eight possible surface types. Due to the sensitivity of these parameters to noise the resulting HK-sing map does not directly identify surfaces in the range images and must be further processed. A region growing algorithm based on modeling the scene points with a Markov Random Field (MRF) of variable neighborhood size and edge models is suggested. This approach allows the integration of information from multiple characteristics in an efficient way. The performance of the proposed algorithm on a number of synthetic and real range images is discussed.

Al-Hujazi, Ezzet↗

An application of a linear programing technique to nonlinear minimax problems

A differential correction technique for solving nonlinear minimax problems is presented. The basis of the technique is a linear programing algorithm which solves the linear minimax problem. By linearizing the original nonlinear equations about a nominal solution, both nonlinear approximation and estimation problems using the minimax norm may be solved iteratively. Some consideration is also given to improving convergence and to the treatment of problems with more than one measured quantity. A sample problem is treated with this technique and with the least-squares differential correction method to illustrate the properties of the minimax solution. The results indicate that for the sample approximation problem, the minimax technique provides better estimates than the least-squares method if a sufficient amount of data is used. For the sample estimation problem, the minimax estimates are better if the mathematical model is incomplete.

Schiess, J. R.↗

Application of finite-element-techniques to the interaction of conduction and radiation in an absorbing, scattering and emitting medium

In this paper, the authors demonstrate that a Galerkin finite element method of analysis, utilizing isoparametric elements, offers a viable means of solving continuum thermal radiation problems with conduction in a participating medium. The participating medium was considered to be a gray radiation medium exhibiting isotropic absorption, emission, and scattering characteristics and optical properties that are independent of temperature. The medium was considered to be bounded by infinite parallel opaque, gray surfaces with diffuse emission and reflection characteristics. In solving this problem, a finite element formulation was developed to describe a system in radiative equilibrium. Then the results of this first analysis were linked with a second finite element model which incorporated conduction into the analysis. The results of this study were found to be in good agreement with existing published data. The model offers the following advantageous features: geometric generality, a computational algorithm which is 'convenient' and 'computable', and a functional basis for extension of the radiation model to higher order approximation.

Wu, S. T.↗

Structural optimization - Challenges and opportunities

A review of developments in structural optimization techniques and their interface with growing computer capabilities is presented. Structural design steps comprise functional definition of an object, an evaluation phase wherein external influences are quantified, selection of the design concept, material, object geometry, and the internal layout, and quantification of the physical characteristics. Optimization of a fully stressed design is facilitated by use of nonlinear mathematical programming which permits automated definition of the physics of a problem. Design iterations terminate when convergence is acquired between mathematical and physical criteria. A constrained minimum algorithm has been formulated using an Augmented Lagrangian approach and a generalized reduced gradient to obtain fast convergence. Various approximation techniques are mentioned. The synergistic application of all the methods surveyed requires multidisciplinary teamwork during a design effort.

Sobieszczanski-Sobieski, J.↗

Structural optimization: Challenges and opportunities

A review of developments in structural optimization techniques and their interface with growing computer capabilities is presented. Structural design steps comprise functional definition of an object, an evaluation phase wherein external influences are quantified, selection of the design concept, material, object geometry, and the internal layout, and quantification of the physical characteristics. Optimization of a fully stressed design is facilitated by use of nonlinear mathematical programming which permits automated definition of the physics of a problem. Design iterations terminate when convergence is acquired between mathematical and physical criteria. A constrained minimum algorithm has been formulated using an Augmented Lagrangian approach and a generalized reduced gradient to obtain fast convergence. Various approximation techniques are mentioned. The synergistic application of all the methods surveyed requires multidisciplinary teamwork during a design effort.

Sobieszczanski-Sobieski, J.↗

Infrared speckle observations of Io - An eruption in the Loki region

Speckle observations of Jupiter's satellite Io at a wavelength of 5 micrometers during July 1984 resolved the disk and showed emission from a hot spot in the Loki region. The hot spot contributed a flux approximately equal to 60 percent of that from the disk. Images reconstructed by means of the Knox-Thompson algorithm showed the spot moving across the disk as the satellite rotated. It was located at 301 deg + or - 6 deg west longitude, 10 deg + or - 6 deg north latitude, and had a radiance of (2.96 + or - 0.54) x 10 to the 22nd ergs/sec cm sr/A where A is the area of the spot. For an assumed temperature of 400 K, the area of the source would be 11,400 square kilometers. An active 'lava lake' similar to that seen by Voyager may be the source of the infrared emission.

Howell, R. R.↗

Computations of three-dimensional steady and unsteady viscous incompressible flows

The INS3D family of computational fluid dynamics computer codes is presented. These codes are used to as tools in developing and assessing algorithms for solving the incompressible Navier-Stokes equations for steady-state and unsteady flow problems. This work involves applying the codes to real-world problems involving complex three-dimensional geometries. The algorithms utilized include the method of pseudocompressibility including both central and upwind differencing, several types of artificial dissipation schemes, approximate factorization, and an implicit line-relaxation scheme. These codes have been validated using a wide range of problems including flow over a backward-facing step, driven cavity flow, flow through various types of ducts, and steady and unsteady flow over a circular cylinder. Many diverse flow applications have been solved using these codes including parts of the Space Shuttle Main Engine, problems in naval hydrodynamics, low-speed aerodynamics, and biomedical fluid flows. The presentation details several of these, including the flow through a Space Shuttle Main Engine inducer, vortex shedding behind a circular cylinder, and flow through an artificial heart.

Kwak, Dochan↗

Matrix-based, finite-difference algorithms for computational acoustics

A compact numerical algorithm is introduced for simulating multidimensional acoustic waves. The algorithm is expressed in terms of a set of matrix coefficients on a three-point spatial grid that approximates the acoustic wave equation with a discretization error of O(h exp 5). The method is based on tracking a local phase variable and its implementation suggests a convenient coordinate splitting along with natural intermediate boundary conditions. Results are presented for oblique plane waves and compared with other procedures. Preliminary computations of acoustic diffraction are also considered.

Davis, Sanford↗

Biological production models as elements of coupled, atmosphere-ocean models for climate research

Process models of phytoplankton production are discussed with respect to their suitability for incorporation into global-scale numerical ocean circulation models. Exact solutions are given for integrals over the mixed layer and the day of analytic, wavelength-independent models of primary production. Within this class of model, the bias incurred by using a triangular approximation (rather than a sinusoidal one) to the variation of surface irradiance through the day is computed. Efficient computation algorithms are given for the nonspectral models. More exact calculations require a spectrally sensitive treatment. Such models exist but must be integrated numerically over depth and time. For these integrations, resolution in wavelength, depth, and time are considered and recommendations made for efficient computation. The extrapolation of the one-(spatial)-dimension treatment to large horizontal scale is discussed.

Platt, Trevor↗

Adaptive methods in computational fluid dynamics

A review is conducted of the basic components of adaptive methods applicable to very complex problems in fluid dynamics. Attention is given to ways of changing the structure of an approximation to reduce error, techniques for estimating the evolution of error in a CFD calculation, and the range of algorithms that are currently available for mesh-changing functions. Available numerical results which demonstrate the viability of these approaches are discussed.

Oden, J. T.↗