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,801 records · Page 100

A statistical model for radar images of agricultural scenes

The presently derived and validated statistical model for radar images containing many different homogeneous fields predicts the probability density functions of radar images of entire agricultural scenes, thereby allowing histograms of large scenes composed of a variety of crops to be described. Seasat-A SAR images of agricultural scenes are accurately predicted by the model on the basis of three assumptions: each field has the same SNR, all target classes cover approximately the same area, and the true reflectivity characterizing each individual target class is a uniformly distributed random variable. The model is expected to be useful in the design of data processing algorithms and for scene analysis using radar images.

Frost, V. S.↗

Maximum likelihood algorithm using an efficient scheme for computing sensitivities and parameter confidence intervals

Improved techniques for estimating airplane stability and control derivatives and their standard errors are presented. A maximum likelihood estimation algorithm is developed which relies on an optimization scheme referred to as a modified Newton-Raphson scheme with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort compared to integrating the analytically-determined sensitivity equations or using a finite difference scheme. An aircraft estimation problem is solved using real flight data to compare MNRES with the commonly used modified Newton-Raphson technique; MNRES is found to be faster and more generally applicable. Parameter standard errors are determined using a random search technique. The confidence intervals obtained are compared with Cramer-Rao lower bounds at the same confidence level. It is observed that the nonlinearity of the cost function is an important factor in the relationship between Cramer-Rao bounds and the error bounds determined by the search technique.

Murphy, P. C.↗

A parabolized Navier-Stokes algorithm for separated supersonic internal flows

A stable global-iteration procedure is applied to a fully implicit noniterative parabolized Navier-Stokes algorithm to improve the solutions of the single-sweep method as well as to resolve small separation bubbles due to shock-wave/boundary-layer interactions. A modified form of the FLARE approximation is employed in the separated regions and some requirements for stable iterations are discussed. The results of the global-iteration scheme for two test cases of supersonic internal flows are compared against the results of the single-sweep method as well as the results of the full Navier-Stokes solver.

Chitsomboon, T.↗

Transonic separated solutions for an augmentor-wing

The viscous transonic flow about a multielement airfoil (augmentor-wing) is simulated by coupling full-potential and direct/inverse differential boundary-layer algorithms. Solutions have been obtained for a variety of conditions and are in fair agreement with available experimental data. Typical results from this transonic augmentor-wing code (TAUG-V) require approximately three minutes of CRAY-XMP CPU time. Since this viscous transonic code accounts for most of the important flow physics, yet is still economical, it is a practical tool for the design aerodynamicist.

Flores, J.↗

Inverse kinematic solution for near-simple robots and its application to robot calibration

This paper provides an inverse kinematic solution for a class of robot manipulators called near-simple manipulators. The kinematics of these manipulators differ from those of simple-robots by small parameter variations. Although most robots are by design simple, in practice, due to manufacturing tolerances, every robot is near-simple. The method in this paper gives an approximate inverse kinematics solution for real time applications based on the nominal solution for these robots. The validity of the results are tested both by a simulation study and by applying the algorithm to a PUMA robot.

Hayati, Samad A.↗

A new method for recognizing quadric surfaces from range data and its application to telerobotics and automation

The problem of recognizing and positioning of objects in three-dimensional space is important for robotics and navigation applications. In recent years, digital range data, also referred to as range images or depth maps, have been available for the analysis of three-dimensional objects owing to the development of several active range finding techniques. The distinct advantage of range images is the explicitness of the surface information available. Many industrial and navigational robotics tasks will be more easily accomplished if such explicit information can be efficiently interpreted. In this research, a new technique based on analytic geometry for the recognition and description of three-dimensional quadric surfaces from range images is presented. Beginning with the explicit representation of quadrics, a set of ten coefficients are determined for various three-dimensional surfaces. For each quadric surface, a unique set of two-dimensional curves which serve as a feature set is obtained from the various angles at which the object is intersected with a plane. Based on a discriminant method, each of the curves is classified as a parabola, circle, ellipse, hyperbola, or a line. Each quadric surface is shown to be uniquely characterized by a set of these two-dimensional curves, thus allowing discrimination from the others. Before the recognition process can be implemented, the range data have to undergo a set of pre-processing operations, thereby making it more presentable to classification algorithms. One such pre-processing step is to study the effect of median filtering on raw range images. Utilizing a variety of surface curvature techniques, reliable sets of image data that approximate the shape of a quadric surface are determined. Since the initial orientation of the surfaces is unknown, a new technique is developed wherein all the rotation parameters are determined and subsequently eliminated. This approach enables us to position the quadric surfaces in a desired coordinate system. Experiments were conducted on raw range images of spheres, cylinders, and cones. Experiments were also performed on simulated data for surfaces such as hyperboloids of one and two sheets, elliptical and hyperbolic paraboloids, elliptical and hyperbolic cylinders, ellipsoids and the quadric cones. Both the real and simulated data yielded excellent results. Our approach is found to be more accurate and computationally inexpensive as compared to traditional approaches, such as the three-dimensional discriminant approach which involves evaluation of the rank of a matrix. Finally, we have proposed one other new approach, which involves the formulation of a mapping between the explicit and implicit forms of representing quadric surfaces. This approach, when fully realized, will yield a three-dimensional discriminant, which will recognize quadric surfaces based upon their component surfaces patches. This approach is faster than prior approaches and at the same time is invariant to pose and orientation of the surfaces in three-dimensional space.

Alvertos, Nicolas↗

Attitude and Trajectory Determination using Magnetometers and Estimated Rates

A simultaneous attitude and orbit determination algorithm which uses magnetometer measurements and estimated attitude rates is presented. This is an extension of an algorithm which uses magnetometer and rate gyro measurements. The new algorithm is intended for gyroless spacecraft, or in the case of gyro failures/saturation. Torque control input data is used in forming the rate estimates. Simulation tests of the algorithm are presented. First, tests were performed using the 'true' rate values at each time step. This simulated using accurate gyro measurements. Then, tests were performed estimating the rates. Using estimated rates rather than 'gyro measurements' did not significantly degrade the algorithm's performance if accurate estimates of the initial rates were available. An initial Root-Sum-Square (RSS) position error of 1,400 km was reduced to an average error of approximately 100 km within the first two minutes. The RSS attitude error converged to less than 1.5 degrees within three orbits.

Schierman, J. D.↗

Hard Constraints in Optimization Under Uncertainty

This paper proposes a methodology for the analysis and design of systems subject to parametric uncertainty where design requirements are specified via hard inequality constraints. Hard constraints are those that must be satisfied for all parameter realizations within a given uncertainty model. Uncertainty models given 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, are the focus of this paper. These models, which are also quite practical, allow for a rigorous mathematical treatment within the proposed framework. Hard constraint feasibility is determined by sizing the largest uncertainty set for which the design requirements are satisfied. Analytically verifiable assessments of robustness are attained by comparing this set with the actual uncertainty model. Strategies that enable the comparison of the robustness characteristics of competing design alternatives, the description and approximation of the robust design space, and the systematic search for designs with improved robustness are also proposed. Since the problem formulation is generic and the tools derived only require standard optimization algorithms for their implementation, this methodology is applicable to a broad range of engineering problems.

Crespo, Luis G.↗

Figures of Merit for Control Verification

This paper proposes a methodology for evaluating a controller's ability to satisfy a set of closed-loop specifications when the plant has an arbitrary functional dependency on uncertain parameters. Control verification metrics applicable to deterministic and probabilistic uncertainty models are proposed. These metrics, which result from sizing the largest uncertainty set of a given class for which the specifications are satisfied, enable systematic assessment of competing control alternatives regardless of the methods used to derive them. A particularly attractive feature of the tools derived is that their efficiency and accuracy do not depend on the robustness of the controller. This is in sharp contrast to Monte Carlo based methods where the number of simulations required to accurately approximate the failure probability grows exponentially with its closeness to zero. This framework allows for the integration of complex, high-fidelity simulations of the integrated system and only requires standard optimization algorithms for its implementation.

Crespo, Luis G.↗

Towards an Improved High Resolution Global Long-Term Solar Resource Database

This paper presents an overview of an ongoing project to develop and deliver a solar mapping processing system to the National Renewable Energy Laboratory (NREL) using the data sets that are planned for production at the National Climatic Data Center (NCDC). NCDC will be producing a long-term radiance and cloud property data set covering the globe every three hours at an approximate resolution of 10 x 10 km. NASA, the originators of the Surface meteorology and Solar Energy web portal are collaborating with SUNY-Albany to develop the production system and solar algorithms. The initial result will be a global long-term solar resource data set spanning over 25 years. The ultimate goal of the project is to also deliver this data set and production system to NREL for continual production. The project will also assess the impact of providing these new data to several NREL solar decision support tools.

Stackhouse, Paul W.↗

Optimization of Time-Dependent Particle Tracing Using Tetrahedral Decomposition

An efficient algorithm is presented for computing particle paths, streak lines and time lines in time-dependent flows with moving curvilinear grids. The integration, velocity interpolation and step-size control are all performed in physical space which avoids the need to transform the velocity field into computational space. This leads to higher accuracy because there are no Jacobian matrix approximations or expensive matrix inversions. Integration accuracy is maintained using an adaptive step-size control scheme which is regulated by the path line curvature. The problem of cell-searching, point location and interpolation in physical space is simplified by decomposing hexahedral cells into tetrahedral cells. This enables the point location to be done analytically and substantially faster than with a Newton-Raphson iterative method. Results presented show this algorithm is up to six times faster than particle tracers which operate on hexahedral cells yet produces almost identical particle trajectories.

Kenwright, David↗

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗

Parallel algorithm for dominant points correspondences in robot binocular stereo vision

This paper presents an algorithm to find the correspondences of points representing dominant feature in robot stereo vision. The algorithm consists of two main steps: dominant point extraction and dominant point matching. In the feature extraction phase, the algorithm utilizes the widely used Moravec Interest Operator and two other operators: the Prewitt Operator and a new operator called Gradient Angle Variance Operator. The Interest Operator in the Moravec algorithm was used to exclude featureless areas and simple edges which are oriented in the vertical, horizontal, and two diagonals. It was incorrectly detecting points on edges which are not on the four main directions (vertical, horizontal, and two diagonals). The new algorithm uses the Prewitt operator to exclude featureless areas, so that the Interest Operator is applied only on the edges to exclude simple edges and to leave interesting points. This modification speeds-up the extraction process by approximately 5 times. The Gradient Angle Variance (GAV), an operator which calculates the variance of the gradient angle in a window around the point under concern, is then applied on the interesting points to exclude the redundant ones and leave the actual dominant ones. The matching phase is performed after the extraction of the dominant points in both stereo images. The matching starts with dominant points in the left image and does a local search, looking for corresponding dominant points in the right image. The search is geometrically constrained the epipolar line of the parallel-axes stereo geometry and the maximum disparity of the application environment. If one dominant point in the right image lies in the search areas, then it is the corresponding point of the reference dominant point in the left image. A parameter provided by the GAV is thresholded and used as a rough similarity measure to select the corresponding dominant point if there is more than one point the search area. The correlation is used as a final decision tool when there is still more than one point in the search area. If there is no dominant point in the search area of if the points in the search area are below a correlation threshold, then the dominant point in the reference image is occluded and can not be corresponded. The algorithm has been modeled, implemented and shown to be fast, robust and parallel. The parallelism is created from three main features: locality of the operators; a memory optimization scheme; and the ability to fully parallelize the extraction phase which is the most computational intensive task in the algorithm. The last feature is achieved by performing the extraction phase on the two images simultaneously.

Al-Tammami, A.↗

Stability analysis of numerical boundary conditions and implicit difference approximations for hyperbolic equations

Implicit, noniterative, finite difference schemes were recently developed by several authors for multidimensional systems of nonlinear hyperbolic partial differential equations. When applied to linear model equations with periodic boundary conditions those schemes are unconditionally stable (A-stable). As applied in practice the algorithms often face a severe time step restriction. A major source of the difficulty is the treatment of the numerical boundary conditions. One conjecture was that unconditional stability requires implicit numerical boundary conditions. An apparent counter example was the space time extrapolation considered by Gustafsson, Kreiss, and Sunstrom. Spatial (implicit) and space time (explicit) extrapolation using normal mode analysis for a finite and infinite number of spatial mesh intervals are examined. The results indicate that for unconditional stability with a finite number of spatial mesh intervals, the numerical boundary conditions must be implicit.

Beam, R. M.↗

Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm

The disadvantages of numerical inversion of the Laplace transform via the conventional fast Fourier transform (FFT) are identified and an improved method is presented to remedy them. The improved method is based on introducing a new integration step length Delta(omega) = pi/mT for trapezoidal-rule approximation of the Bromwich integral, in which a new parameter, m, is introduced for controlling the accuracy of the numerical integration. Naturally, this method leads to multiple sets of complex FFT computations. A new inversion formula is derived such that N equally spaced samples of the inverse Laplace transform function can be obtained by (m/2) + 1 sets of N-point complex FFT computations or by m sets of real fast Hartley transform (FHT) computations.

Hwang, Chyi↗

Intensity changes in the UV spectrum of Beta Cephei

Fifty eight short wavelength International Ultraviolet Explorer spectra were taken over a 152 day period. Variations in the absorption lines of C IV (1550 A), Si IV (1393 and 1404 A) and N V (1239 and 1243 A) and a Cr III feature (1208 to 1211 A) were observed. A data reduction technique was developed in order to compare the changes in the equivalent widths of these absorption lines. Periods were determined by least squares fit to a sinusoid using several combinations of the data. In one case eighteen spectra for each ion taken at approximately one day intervals were used; in another, all 58 measurements of each were used; and in a third all measurements from all the ions wee combined. Using both variable metric and interactive algorithms it was determined that for all combinations mentioned a period of 6.10 + or - .06 days is the best fit to the vector of equivalent widths versus time. No other period, with or without the 6.10 day period removed from the data, was found. Analysis of the Cr III feature near 1210 A gives the same period as the others, but in antiphase.

Fahey, R. P.↗

A grid spacing control technique for algebraic grid generation methods

A technique which controls the spacing of grid points in algebraically defined coordinate transformations is described. The technique is based on the generation of control functions which map a uniformly distributed computational grid onto parametric variables defining the physical grid. The control functions are smoothed cubic splines. Sets of control points are input for each coordinate directions to outline the control functions. Smoothed cubic spline functions are then generated to approximate the input data. The technique works best in an interactive graphics environment where control inputs and grid displays are nearly instantaneous. The technique is illustrated with the two-boundary grid generation algorithm.

Smith, R. E.↗

Application of advanced reliability methods to local strain fatigue analysis

When design factors are considered as random variables and the failure condition cannot be expressed by a closed form algebraic inequality, computations of risk (or probability of failure) might become extremely difficult or very inefficient. This study suggests using a simple, and easily constructed, second degree polynomial to approximate the complicated limit state in the neighborhood of the design point; a computer analysis relates the design variables at selected points. Then a fast probability integration technique (i.e., the Rackwitz-Fiessler algorithm) can be used to estimate risk. The capability of the proposed method is demonstrated in an example of a low cycle fatigue problem for which a computer analysis is required to perform local strain analysis to relate the design variables. A comparison of the performance of this method is made with a far more costly Monte Carlo solution. Agreement of the proposed method with Monte Carlo is considered to be good.

Wu, T. T.↗

Refine your search to explore more results.