Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized 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 883 records · Page 49

Estimation of context for statistical classification of multispectral image data

Recent investigations have demonstrated the effectiveness of a contextual classifier that combines spatial and spectral information employing a general statistical approach. This statistical classification algorithm exploits the tendency of certain ground cover classes to occur more frequently in some spatial contexts than in others. Indeed, a key input to this algorithm is a statistical characterization of the context: the context function. An unbiased estimator of the context function is discussed which, besides having the advantage of statistical unbiasedness, has the additional advantage over other estimation techniques of being amenable to an adaptive implementation in which the context-function estimate varies according to local contextual information. Results from applying the unbiased estimator to the contextual classification of three real Landsat data sets are presented and contrasted with results from noncontextual classifications and from contextual classifications utilizing other context-function estimation techniques.

Tilton, J. C.↗

Projection filters for modal parameter estimate for flexible structures

Single-mode projection filters are developed for eigensystem parameter estimates from both analytical results and test data. Explicit formulations of these projection filters are derived using the pseudoinverse matrices of the controllability and observability matrices in general use. A global minimum optimization algorithm is developed to update the filter parameters by using interval analysis method. Modal parameters can be attracted and updated in the global sense within a specific region by passing the experimental data through the projection filters. For illustration of this method, a numerical example is shown by using a one-dimensional global optimization algorithm to estimate model frequencies and dampings.

Huang, Jen-Kuang↗

Single-mode projection filters for identification and state estimation of flexible structures

Single-mode projection filters are developed for eigensystem parameter identification and state estimation from both analytical results and test data. Explicit formulations of these projection filters are derived using the pseudoinverse matrices of the controllabilty and observability matrices in the general sense. A global minimum optimization algorithm is developed to update the filter parameters by using the interval analysis method. Modal parameters can be identified and updated in the global sense within a specified region of parameters by passing the experimental data through the projection filters. For illustration of this new approach, a numerical example is shown by using a one-dimensional global optimization algorithm to estimate modal frequencies and damping.

Huang, Jen-Kuang↗

Single-Mode Projection Filters for Modal Parameter Identification for Flexible Structures

Single-mode projection filters are developed for eigensystem parameter identification from both analytical results and test data. Explicit formulations of these projection filters are derived using the orthogonal matrices of the controllability and observability matrices in the general sense. A global minimum optimization algorithm is applied to update the filter parameters by using the interval analysis method. The updated modal parameters represent the characteristics of the test data. For illustration of this new approach, a numerical simulation for the MAST beam structure is shown by using a one-dimensional global optimization algorithm to identify modal frequencies and damping. Another numerical simulation of a ten-mode structure is also presented by using a two-dimensional global optimization algorithm to illustrate the feasibility of the new method. The projection filters are practical for parallel processing implementation.

Huang, Jen-Kuang↗

The creation of local clusters in arbitrarily given grids

A method is presented to smoothly insert pointwise clusters into any given grid regardless of its origin, its topology, or its dimensionality. The process amounts to a local movement of the given coordinate curves or surfaces to more highly resolve an object. The object about which clustering is created can be a point, a curve, a surface, or segments of a curve or surface. The basic clustering capability is established by forming a grid operator for a single cluster. With a view toward multiple clusters being created about various objects, the basic operator is seen as an elementary operator. An algorithm is presented to execute the general elementary operation in three dimensions. In FORTRAN, this assumes the form of a subroutine which is fully operational and is presented to serve as a basic model for any such elementary clustering operation.

Eiseman, Peter R.↗

Single-mode projection filters for modal parameter identification for flexible structures

Single-mode projection filters are developed for eigensystem parameter identification from both analytical results and test data. Explicit formulations of these projection filters are derived using the orthogonal matrices of the controllability and observability matrices in the general sense. A global minimum optimization algorithm is applied to update the filter parameters by using the interval analysis method. The updated modal parameters represent the characteristics of the test data. For illustration of this new approach, a numerical simulation for the MAST beam structure is shown by using a one-dimensional global optimization algorithm to identify modal frequencies and damping. The projection filters are practical for parallel processing implementation.

Huang, Jen-Kuang↗

Self-tuning Generalized Predictive Control applied to terrain following flight

Generalized Predictive Control (GPC) describes an algorithm for the control of dynamic systems in which a control input is generated which minimizes a quadratic cost function consisting of a weighted sum of errors between desired and predicted future system output and future predicted control increments. The output predictions are obtained from an internal model of the plant dynamics. Self-tuning GPC refers to an implementation of the GPC algorithm in which the parameters of the internal model(s) are estimated on-line and the predictive control law tuned to the parameters so identified. The self-tuning GPC algorithm is applied to a problem of rotorcraft longitudinal/vertical terrain-following flight. The ability of the algorithm to tune to the initial vehicle parameters and to successfully adapt to a stability augmentation failure is demonstrated. Flight path performance is compared to a conventional, classically designed flight path control system.

Hess, R. A.↗

Numerical algorithms for steady and unsteady incompressible Navier-Stokes equations

The numerical analysis of the incompressible Navier-Stokes equations are becoming important tools in the understanding of some fluid flow problems which are encountered in research as well as in industry. With the advent of the supercomputers, more realistic problems can be studied with a wider choice of numerical algorithms. An alternative formulation is presented for viscous incompressible flows. The incompressible Navier-Stokes equations are cast in a velocity/vorticity formulation. This formulation consists of solving the Poisson equations for the velocity components and the vorticity transport equation. Two numerical algorithms for the steady two-dimensional laminar flows are presented. The first method is based on the actual partial differential equations. This uses a finite-difference approximation of the governing equations on a staggered grid. The second method uses a finite element discretization with the vorticity transport equation approximated using a Galerkin approximation and the Poisson equations are obtained using a least squares method. The equations are solved efficiently using Newton's method and a banded direct matrix solver (LINPACK). The method is extended to steady three-dimensional laminar flows and applied to a cubic driven cavity using finite difference schemes and a staggered grid arrangement on a Cartesian mesh. The equations are solved iteratively using a plane zebra relaxation scheme. Currently, a two-dimensional, unsteady algorithm is being developed using a generalized coordinate system. The equations are discretized using a finite-volume approach. This work will then be extended to three-dimensional flows.

Hafez, Mohammed↗

An application of generalized predictive control to rotorcraft terrain-following flight

Generalized predictive control (GPC) describes an algorithm for the control of dynamic systems in which a control input is generated which minimizes a quadratic cost function consisting of a weighted sum of errors between desired and predicted future system output and future predicted control increments. The output predictions are obtained from an internal model of the plant dynamics. The GPC algorithm is first applied to a simplified rotorcraft terrain-following problem, and GPC performance is compared to that of a conventional compensatory automatic system in terms of flight-path following, control activity, and control law implementation. Next, more realistic vehicle dynamics are utilized, and the GPC algorithm is applied to simultaneous terrain following and velocity control in the presence of atmospheric disturbances and errors in the internal model of the vehicle. The online computational and sensing requirements for implementing the GPC algorithm are minimal. Its use for manual control models appears promising.

Hess, Ronald A.↗

Minimum-fuel rescue trajectories for the Extravehicular Excursion Unit

The problem of determining minimum-fuel trajectories for rescuing astronauts or equipment which become separated from a Space Station is addressed. Using the Clohessy-Wiltshire equations of relative motion and assuming impulsive Delta-Vs, the minimum-fuel rescue problem is shown to be a parameter optimization problem. Minimum-fuel rescue trajectories are found for seventeen test cases using a recursive quadratic programming algorithm. The results are analyzed and general rules for astronaut rescue and equipment retrieval are developed.

Fowler, W. T.↗

Numerical simulation of actively controlled space structures

The numerical simulation of large, actively controlled space structures is a problem that has received considerable attention. A new computational method is presented in this paper, which simulates the vibration suppression of a large space structure by a linear compensator. The structure is assumed to be modeled by a large linear finite element model. Nested circularly linked lists and the trapezoidal rule are key aspects of this algorithm. There is an emphasis on generality, while establishing an equivalence between numerical stability and system stability.

Quan, Ralph↗

The improved robustness of multigrid elliptic solvers based on multiple semicoarsened grids

Multigrid convergence rates degenerate on problems with stretched grids or anisotropic operators, unless one uses line or plane relaxation. For 3-D problems, only plane relaxation suffices, in general. While line and plane relaxation algorithms are efficient on sequential machines, they are quite awkward and inefficient on parallel machines. A new multigrid algorithm is presented based on the use of multiple coarse grids, that eliminates the need for line or plane relaxation in anisotropic problems. This algorithm was developed and the standard multigrid theory was extended to establish rapid convergence for this class of algorithms. The new algorithm uses only point relaxation, allowing easy and efficient parallel implementation, yet achieves robustness and convergence rates comparable to line and plane relaxation multigrid algorithms. The algorithm described is a variant of Mulder's multigrid algorithm for hyperbolic problems. The latter uses multiple coarse grids to achieve robustness, but is unsuitable for elliptic problems, since its V-cycle convergence rate goes to one as the number of levels increases. The new algorithm combines the contributions from the multiple coarse grid via a local switch, based on the strength of the discrete operator in each coordinate direction.

Naik, Naomi H.↗

Phasing of a space based segmented submillimeter wavelength telescope using focal plane measurements

As part of a technology development program for realizing a space based submillimeter telescope, two different approaches to the absolute phasing of a segmented primary mirror using focal plane measurements have been implemented for feasibility. The method of optimization by simulated annealing evaluates the image quality of a point spread function after all the telescope segments have been randomly moved. It accepts each iteration which improves the image quality, as well as a random number of iterations which do not, thus keeping the Strehl in the initialization procedure from falling into local maxima. Methods for determining the annealing schedule, and the step size for random segment movements are presented and discussed. Using phase diversity and a model for the telescope imaging system, a nonlinear least squares algorithm has also been implemented which parameterizes each of the segment actuator movements. Using multiple out of focus images, the segment actuator positions are estimated using an iterative procedure. Nonlinear least squares, although computationally intensive, offers a large savings in the actuator movements over simulated annealing and pairwise phasing methods for large numbers of segments. These algorithms have been integrated into a general simulation program which models the behavior of the telescope under anticipated space conditions.

Levine, B. M.↗

Application of a Monte Carlo accuracy assessment tool to TDRS and GPS

In support of a NASA study on the application of radio interferometry to satellite orbit determination, MITRE developed a simulation tool for assessing interferometric tracking accuracy. Initially, the tool was applied to the problem of determining optimal interferometric station siting for orbit determination of the Tracking and Data Relay Satellite (TDRS). Subsequently, the Orbit Determination Accuracy Estimator (ODAE) was expanded to model the general batch maximum likelihood orbit determination algorithms of the Goddard Trajectory Determination System (GTDS) with measurement types including not only group and phase delay from radio interferometry, but also range, range rate, angular measurements, and satellite-to-satellite measurements. The user of ODAE specifies the statistical properties of error sources, including inherent observable imprecision, atmospheric delays, station location uncertainty, and measurement biases. Upon Monte Carlo simulation of the orbit determination process, ODAE calculates the statistical properties of the error in the satellite state vector and any other parameters for which a solution was obtained in the orbit determination. This paper presents results from ODAE application to two different problems: (1)determination of optimal geometry for interferometirc tracking of TDRS, and (2) expected orbit determination accuracy for Global Positioning System (GPS) tracking of low-earth orbit (LEO) satellites. Conclusions about optimal ground station locations for TDRS orbit determination by radio interferometry are presented, and the feasibility of GPS-based tracking for IRIDIUM, a LEO mobile satellite communications (MOBILSATCOM) system, is demonstrated.

Pavloff, Michael S.↗

Development of an upwind, finite-volume code with finite-rate chemistry

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques, and a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical, and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data.

Molvik, Gregory A.↗

TDRS orbit determination by radio interferometry

In support of a NASA study on the application of radio interferometry to satellite orbit determination, MITRE developed a simulation tool for assessing interferometry tracking accuracy. The Orbit Determination Accuracy Estimator (ODAE) models the general batch maximum likelihood orbit determination algorithms of the Goddard Trajectory Determination System (GTDS) with the group and phase delay measurements from radio interferometry. ODAE models the statistical properties of tracking error sources, including inherent observable imprecision, atmospheric delays, clock offsets, station location uncertainty, and measurement biases, and through Monte Carlo simulation, ODAE calculates the statistical properties of errors in the predicted satellites state vector. This paper presents results from ODAE application to orbit determination of the Tracking and Data Relay Satellite (TDRS) by radio interferometry. Conclusions about optimal ground station locations for interferometric tracking of TDRS are presented, along with a discussion of operational advantages of radio interferometry.

Pavloff, Michael S.↗

Unstructured grids on SIMD torus machines

Unstructured grids lead to unstructured communication on distributed memory parallel computers, a problem that has been considered difficult. Here, we consider adaptive, offline communication routing for a SIMD processor grid. Our approach is empirical. We use large data sets drawn from supercomputing applications instead of an analytic model of communication load. The chief contribution of this paper is an experimental demonstration of the effectiveness of certain routing heuristics. Our routing algorithm is adaptive, nonminimal, and is generally designed to exploit locality. We have a parallel implementation of the router, and we report on its performance.

Bjorstad, Petter E.↗

Development of an upwind, finite-volume code with finite-rate chemistry

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques and of a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data. This report summarizes the research that took place from August 1,1994 to January 1, 1995.

Molvik, Gregory A.↗