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,693 records · Page 94

Control system estimation and design for aerospace vehicles with time delay

The problems of estimation and control of discrete, linear, time-varying systems are considered. Previous solutions to these problems involved either approximate techniques, open-loop control solutions, or results which required excessive computation. The estimation problem is solved by two different methods, both of which yield the identical algorithm for determining the optimal filter. The partitioned results achieve a substantial reduction in computation time and storage requirements over the expanded solution, however. The results reduce to the Kalman filter when no delays are present in the system. The control problem is also solved by two different methods, both of which yield identical algorithms for determining the optimal control gains. The stochastic control is shown to be identical to the deterministic control, thus extending the separation principle to time delay systems. The results obtained reduce to the familiar optimal control solution when no time delays are present in the system.

Allgaier, G. R.↗

On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane

Recognition of underlying straight lines and quadratic arcs in line drawings, and approximation of very noisy data by such line/curve segments, is addressed as a subproblem of the more general problem of optimum recognition of complicated line/curve drawings. Some specific algorithms are presented with extensions and interpretations for more complicated applications, and a data generation model is developed for the problem. Data are generated as a perturbation of a single underlying straight line or an elliptic or hyperbolic arc. Recursive estimation techniques, minimization of central processing unit time, decision making with controlled error probabilities, and modeling and recognition of pictures consisting of noisy curves are dealt with. Applications envisaged include: picture data compression, contour line representation in maps, intelligent data searches, and ballistic missile decoy tracking.

Cooper, D. B.↗

Approximate factorization with an elliptic pressure solver for incompressible flow

Two-dimensional curvilinear coordinates are used to solve the incompressible Navier-Stokes equations, in conjunction with approximate factorization for the solution of the momentum equation and the successive overrelaxation by lines method for the solution of a Poisson equation for the pressure. The combined algorithm, although not fully explicit, is marginally stable at Reynolds numbers lower than 10,000 and time increments of 0.01. Pressure distributions calculated for attack angles of zero and 6 deg are of the same shape as the experimental curves, but are shifted to one side.

Bernard, R. S.↗

Solution algorithms for nonlinear transient heat conduction analysis employing element-by-element iterative strategies

The particular problems investigated in the present study arise from nonlinear transient heat conduction. One of two types of nonlinearities considered is related to a material temperature dependence which is frequently needed to accurately model behavior over the range of temperature of engineering interest. The second nonlinearity is introduced by radiation boundary conditions. The finite element equations arising from the solution of nonlinear transient heat conduction problems are formulated. The finite element matrix equations are temporally discretized, and a nonlinear iterative solution algorithm is proposed. Algorithms for solving the linear problem are discussed, taking into account the form of the matrix equations, Gaussian elimination, cost, and iterative techniques. Attention is also given to approximate factorization, implementational aspects, and numerical results.

Winget, J. M.↗

Leapfrog variants of iterative methods for linear algebra equations

Two iterative methods are considered, Richardson's method and a general second order method. For both methods, a variant of the method is derived for which only even numbered iterates are computed. The variant is called a leapfrog method. Comparisons between the conventional form of the methods and the leapfrog form are made under the assumption that the number of unknowns is large. In the case of Richardson's method, it is possible to express the final iterate in terms of only the initial approximation, a variant of the iteration called the grand-leap method. In the case of the grand-leap variant, a set of parameters is required. An algorithm is presented to compute these parameters that is related to algorithms to compute the weights and abscissas for Gaussian quadrature. General algorithms to implement the leapfrog and grand-leap methods are presented. Algorithms for the important special case of the Chebyshev method are also given.

Saylor, Paul E.↗

Matrix elements in the coupled-cluster approach - With application to low-lying states in Li

A procedure is suggested for evaluating matrix elements of an operator between wavefunctions in the coupled-cluster form. The use of the exponential ansatz leads to compact exponential expressions also for matrix elements. Algorithms are developed for summing all effects of one-particle clusters and certain chains of two-particle clusters (containing the well-known random-phase approximation as a subset). The treatment of one-particle perturbations in single valence states is investigated in detail. As examples the oscillator strength for the 2s-2p transition in Li as well as the hyperfine structure for the two states are studied and compared to earlier work.

Martensson-Pendrill, Ann-Marie↗

On three dimensional object recognition and pose-determination: An abstraction based approach

A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximation of surfaces was demonstrated. Such descriptors which are invariant under perspective variation are suitable for hypothesis generation. A means for determining the pose of constructed geometric forms whose algebraic surface descriptors are nonlinear in terms of their orienting parameters was developed. This was done by means of linear functions which are capable of approximating nonlinear forms and determining their parameters. It was shown that biquadratic surfaces are suitable companion linear forms for cylindrical approximation and parameter estimation. The estimates provided the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data. A hypothesis-based split-merge algorithm for extraction and pose determination of cylinders and planes which merge smoothly into other surfaces was developed. It was shown that all split-merge algorithms are hypothesis-based. A finite-state algorithm for the extraction of the boundaries of run-length regions was developed. The computation takes advantage of the run list topology and boundary direction constraints implicit in the run-length encoding.

Quek, Kok How Francis↗

Proceedings of the Second Joint Technology Workshop on Neural Networks and Fuzzy Logic, volume 2

Documented here are papers presented at the Neural Networks and Fuzzy Logic Workshop sponsored by NASA and the University of Texas, Houston. Topics addressed included adaptive systems, learning algorithms, network architectures, vision, robotics, neurobiological connections, speech recognition and synthesis, fuzzy set theory and application, control and dynamics processing, space applications, fuzzy logic and neural network computers, approximate reasoning, and multiobject decision making.

Lea, Robert N.↗

Proceedings of the Second Joint Technology Workshop on Neural Networks and Fuzzy Logic, volume 1

Documented here are papers presented at the Neural Networks and Fuzzy Logic Workshop sponsored by NASA and the University of Houston, Clear Lake. The workshop was held April 11 to 13 at the Johnson Space Flight Center. Technical topics addressed included adaptive systems, learning algorithms, network architectures, vision, robotics, neurobiological connections, speech recognition and synthesis, fuzzy set theory and application, control and dynamics processing, space applications, fuzzy logic and neural network computers, approximate reasoning, and multiobject decision making.

Lea, Robert N.↗

Algorithmic improvements for simulator motion drive

Contemporary simulator motion drive algorithms typically are designed in an analog (continuous) environment, but are implemented in a digital (discrete) environment. The intended continuous system, specified as frequency domain (Laplace transform) transfer functions, may not be represented properly by the algorithms used for digital implementation. The motion drive software in use with the Vertical Motion Simulator at Ames Research Center was investigated recently; the original algorithms (Euler) were changed to a state transition method. Comparison of the frequency responses of the original and new implementations showed that the state transition method more closely approximates the desired analog responses. In addition, test pilots who evaluated both implementations preferred the motions generated with the state transition method over those generated with the Euler integration method.

Laforce, Soren↗

Automated propellant leak detection

An automated hydrogen leak detection system is being developed for earth-to-orbit rocket engine applications. The system consists of three elements, a sensor array, a signal processing unit, and a diagnostic processor. The sensor array consists of discrete solid state sensors which are located at specific potential leak sites and in potential leak zones. The signal processing unit provides excitations power for the sensors and provides analog to digital data conversion of the sensor signals. The diagnostic computer analyzes the sensor outputs to determine leak sources and magnitude. Leak data from the sensor network is interpreted using knowledge based software and displayed on-line through a graphical user interface including 3-D leak visualization. The system requirements have been developed assuming eventual application to the Space Shuttle Main Engine which requires approximately 72 measurement locations. A prototype system has been constructed to demonstrate the operational features of the system. This system includes both prototype electronics and data processing software algorithms. Experiments are in progress to evaluate system operation at conditions which simulate prelaunch and flight. The prototype system consists of a network using 16 sensors within a testbed which simulates engine components. Sensor response, orientation, and data analysis algorithms are being evaluated using calibrated leaks produced within the testbed. A prototype flight system is also under development consisting of 8 sensors and flight capable electronics with autonomous control and data recording.

Makel, D. B.↗

Time integration algorithms for the two-dimensional Euler equations on unstructured meshes

Explicit and implicit time integration algorithms for the two-dimensional Euler equations on unstructured grids are presented. Both cell-centered and cell-vertex finite volume upwind schemes utilizing Roe's approximate Riemann solver are developed. For the cell-vertex scheme, a four-stage Runge-Kutta time integration, a fourstage Runge-Kutta time integration with implicit residual averaging, a point Jacobi method, a symmetric point Gauss-Seidel method and two methods utilizing preconditioned sparse matrix solvers are presented. For the cell-centered scheme, a Runge-Kutta scheme, an implicit tridiagonal relaxation scheme modeled after line Gauss-Seidel, a fully implicit lower-upper (LU) decomposition, and a hybrid scheme utilizing both Runge-Kutta and LU methods are presented. A reverse Cuthill-McKee renumbering scheme is employed for the direct solver to decrease CPU time by reducing the fill of the Jacobian matrix. A comparison of the various time integration schemes is made for both first-order and higher order accurate solutions using several mesh sizes, higher order accuracy is achieved by using multidimensional monotone linear reconstruction procedures. The results obtained for a transonic flow over a circular arc suggest that the preconditioned sparse matrix solvers perform better than the other methods as the number of elements in the mesh increases.

Slack, David C.↗

Three-Dimensional High-Lift Analysis Using a Parallel Unstructured Multigrid Solver

A directional implicit unstructured agglomeration multigrid solver is ported to shared and distributed memory massively parallel machines using the explicit domain-decomposition and message-passing approach. Because the algorithm operates on local implicit lines in the unstructured mesh, special care is required in partitioning the problem for parallel computing. A weighted partitioning strategy is described which avoids breaking the implicit lines across processor boundaries, while incurring minimal additional communication overhead. Good scalability is demonstrated on a 128 processor SGI Origin 2000 machine and on a 512 processor CRAY T3E machine for reasonably fine grids. The feasibility of performing large-scale unstructured grid calculations with the parallel multigrid algorithm is demonstrated by computing the flow over a partial-span flap wing high-lift geometry on a highly resolved grid of 13.5 million points in approximately 4 hours of wall clock time on the CRAY T3E.

Mavriplis, Dimitri J.↗

Nondestructive Determination of Bond Strength

Although many nondestructive techniques have been applied to detect disbonds in adhesive joints, no absolutely reliable nondestructive method has been developed to detect poor adhesion and evaluate the strength of bonded joints prior to the present work which used nonlinear ultrasonic methods to investigate adhesive bond cure conditions. Previously, a variety of linear and nonlinear ultrasonic methods with water coupling had been used to study aluminum-adhesive-aluminum laminates, prepared under different adhesive curing conditions, for possible bond strength determination. Therefore, in the course of this research effort, a variety of finite-amplitude experimental methods which could possibly differentiate various cure conditions were investigated, including normal and oblique incidence approaches based on nonlinear harmonic generation as well as several non-collinear two-wave interaction approaches. Test samples were mechanically scanned in various ways with respect to the focus of a transmitting transducer operated at several variable excitation frequencies and excitation levels. Even when powerful sample-related resonances were exploited by means of a frequency scanning approach, it was very difficult to isolate the nonlinear characteristics of adhesive bonds. However, a multi-frequency multi-power approach was quite successful and reliable. Ultrasonic tone burst signals at increasing power levels, over a wide frequency range, were transmitted through each bond specimen to determine its excitation dependent nonlinear harmonic resonance behavior. Relative amplitude changes were observed particularly in the higher harmonic spectral data and analyzed using a local displacement and strain analysis in the linear approximation. Two analysis approaches of the excitation-dependent data at specific resonances were found to be quite promising. One of these approaches may represent a very robust algorithm for classifying an adhesive bond as being properly cured or not. Another approach, in addition to differentiation between various cure conditions, may even provide information with respect to the bond strength. Several technical papers were published during the course of this research and a summary is presented in the Ph.D. dissertation of Tobias P. Berndt, a graduate student financially supported by this NASA Grant.

Source record↗

Global Aerosol Remote Sensing from MODIS

The physical characteristics, composition, abundance, spatial distribution and dynamics of global aerosols are still very poorly known, and new data from satellite sensors have long been awaited to improve current understanding and to give a boost to the effort in future climate predictions. The derivation of aerosol parameters from the MODerate resolution Imaging Spectro-radiometer (MODIS) sensors aboard the Earth Observing System (EOS) Terra and Aqua polar-orbiting satellites ushers in a new era in aerosol remote sensing from space. Terra and Aqua were launched on December 18, 1999 and May 4, 2002 respectively, with daytime equator crossing times of approximately 10:30 am and 1:30 pm respectively. Several aerosol parameters are retrieved at 10-km spatial resolution (level 2) from MODIS daytime data. The MODIS aerosol algorithm employs different approaches to retrieve parameters over land and ocean surfaces, because of the inherent differences in the solar spectral radiance interaction with these surfaces. The parameters retrieved include: aerosol optical thickness (AOT) at 0.47, 0.55 and 0.66 micron wavelengths over land, and at 0.47, 0.55, 0.66, 0.87, 1.2, 1.6, and 2.1 micron over ocean; Angstrom exponent over land and ocean; and effective radii, and the proportion of AOT contributed by the small mode aerosols over ocean. To ensure the quality of these parameters, a substantial part of the Terra-MODIS aerosol products were validated globally and regionally, based on cross correlation with corresponding parameters derived from ground-based measurements from AERONET (AErosol RObotic NETwork) sun photometers. Similar validation efforts are planned for the Aqua-MODIS aerosol products. The MODIS level 2 aerosol products are operationally aggregated to generate global daily, eight-day (weekly), and monthly products at one-degree spatial resolution (level 3). MODIS aerosol data are used for the detailed study of local, regional, and global aerosol concentration, distribution, and temporal dynamics, as well as for radiative forcing calculations. We show several examples of these results and comparisons with model output.

Ichoku, Charles↗

Improving Total Column Ozone Retrievals by Using Cloud Pressures Derived from Raman Scattering in the UV

The higher spectral resolution, coverage, and sampling of the Aura satellite ozone monitoring instrument (OMI), as compared with the total ozone mapping spectrometer (TOMS) should allow for improved ozone retrievals, including estimates of tropospheric ozone. By default, the TOMS-like OMI total column ozone algorithm uses climatological cloud-top pressures based on infrared (IR) measurements to estimate the column ozone below the clouds. Alternatively, cloud pressure can be retrieved using atmospheric rotational Raman scattering with OMI. The retrieved cloud pressures should be more consistent with assumptions made in the total ozone algorithm. Here, we use data from the global ozone monitoring experiment (GOME) to estimate total ozone using both the IR-climatological and retrieved cloud pressures. The exceed approximately 15 DU. Use of the UV cloud pressure retrievals leads to a smoother distribution of ozone along a satellite track by reducing small spatial irregularities presumably caused by errors in the climatological cloud pressures.

Vasilkov, A.↗

Implicit/Multigrid Algorithms for Incompressible Turbulent Flows on Unstructured Grids

An implicit code for computing inviscid and viscous incompressible flows on unstructured grids is described. The foundation of the code is a backward Euler time discretization for which the linear system is approximately solved at each time step with either a point implicit method or a preconditioned Generalized Minimal Residual (GMRES) technique. For the GMRES calculations, several techniques are investigated for forming the matrix-vector product. Convergence acceleration is achieved through a multigrid scheme that uses non-nested coarse grids that are generated using a technique described in the present paper. Convergence characteristics are investigated and results are compared with an exact solution for the inviscid flow over a four-element airfoil. Viscous results, which are compared with experimental data, include the turbulent flow over a NACA 4412 airfoil, a three-element airfoil for which Mach number effects are investigated, and three-dimensional flow over a wing with a partial-span flap.

Anderson, W. Kyle↗

Data Mining Methods Applied to Flight Operations Quality Assurance Data: A Comparison to Standard Statistical Methods

In a previous study, multiple regression techniques were applied to Flight Operations Quality Assurance-derived data to develop parsimonious model(s) for fuel consumption on the Boeing 757 airplane. The present study examined several data mining algorithms, including neural networks, on the fuel consumption problem and compared them to the multiple regression results obtained earlier. Using regression methods, parsimonious models were obtained that explained approximately 85% of the variation in fuel flow. In general data mining methods were more effective in predicting fuel consumption. Classification and Regression Tree methods reported correlation coefficients of .91 to .92, and General Linear Models and Multilayer Perceptron neural networks reported correlation coefficients of about .99. These data mining models show great promise for use in further examining large FOQA databases for operational and safety improvements.

Stolzer, Alan J.↗