Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithms optimization”

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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Terrain-Following/Terrain-Avoidance System For Helicopters

Report describes early stages of development of control system enabling helicopter to follow automatically contours of terrain below and avoid collisions with terrain. Focuses on optimization of algorithm for generation of flightpath with respect to several variables, development of controller to position helicopter precisely along terrain-following/terrain-avoidance (TF/TA) flightpath, and integration of flightpath-trajectory software with flightpath-control software.

Dorr, Dan W.↗
NASA NTRS1989

A practical approach for minimum time control of the Spacecraft Control Laboratory Experiment (SCOLE), appendix A

The Space COntrol Laboratory Experiment (SCOLE) is a challenge for control engineering applications. This is a result of the system dynamics, the available measurement information, the actuator capabilities and finally the specified performance requirements set. Results on the use of Model Reference Adaptive Control were reported. In view of the necessity for rapid response, this work deals with an optimal control formulation, with a minimum time requirement and constrained input. A mathematical statement of the problem is presented. The time optimal control formulation is presented and the reasons that make such an approach not promising are discussed. As a result, a pseudo time-optimal control algorithm is discussed. The proposed approach is tested to see if it satisfies the design specifications, and finally a discussion and suggestions for further research are provided.

Kaufman, H.↗
NASA NTRS1989

Algorithms for computing the multivariable stability margin

Stability margin for multiloop flight control systems has become a critical issue, especially in highly maneuverable aircraft designs where there are inherent strong cross-couplings between the various feedback control loops. To cope with this issue, we have developed computer algorithms based on non-differentiable optimization theory. These algorithms have been developed for computing the Multivariable Stability Margin (MSM). The MSM of a dynamical system is the size of the smallest structured perturbation in component dynamics that will destabilize the system. These algorithms have been coded and appear to be reliable. As illustrated by examples, they provide the basis for evaluating the robustness and performance of flight control systems.

Tekawy, Jonathan A.↗
NASA NTRS1990

High order sensitivity analysis of complex, coupled systems

The Sobieszczanski-Sobieski (1988) algorithm is extended to include second- and higher-order derivatives while retaining the obviation of finite-differencing of the system analysis. This is accomplished by means of a recursive application of the same implicit function theorem as in the original algorithm. In optimization, the computational cost of the higher-order derivatives is relative to the aggregate cost of analysis together with a repetition of the first-order sensitivity analysis as often as is required to produce the equivalent information by successive linearizations within move limits.

Sobieszczanski-Sobieski, Jaroslaw↗
NASA NTRS1989

Space Shuttle Main Engine component assembly, assignment, and scheduling expert system

The SSME's Component Assembly and Life Management Expert System (CALMES) assists the engine assembly and scheduling process, ensuring that these activities utilize available resources with the greatest possible efficiency. On the basis of parts inventories and a proposed flight schedule, CALMES (1) determined how components may be optimally assembled from the parts inventory, (2) assigns components to flights, (3) schedules component testing, and (4) schedules component assembly. A graph-theoretical optimal matching algorithm, based on a modified simplex method, is applied to the major functions required by the SSME component assembly and scheduling processes.

Dietz, W. E.↗
NASA NTRS1991

Aerodynamic shape optimization using sensitivity analysis on third-order Euler equations

Two major advancements of an aerodynamic optimization method with two design variables are described. The first is represnted by an improved flow prediction method that uses the third-order accurate discretization of the Euler equations. This method makes it possible to predict the flowfield of a perturbed shape which generates shocks and other large gradients without intermediate CFD analysis. The second advancement is the use of every surface grid point as a design variable in the aerodynamic shape optimization problem. The improved algorithm is demonstrated by optimizing the ramp shape of a scramjet-afterbody configuration for maximum axial thrust. It is concluded that the improved flow-field prediction method eliminates most of the flow analysis and a priori guessing of all possible shapes from which the optimum is to be selected.

Baysal, Oktay↗
NASA NTRS1992

Efficient Computation Of Confidence Intervals Of Parameters

Study focuses on obtaining efficient algorithm for estimation of confidence intervals of ML estimates. Four algorithms selected to solve associated constrained optimization problem. Hybrid algorithms, following search and gradient approaches, prove best.

Murphy, Patrick C.↗
NASA NTRS1991

A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems

The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non-Hermitian matrices, the classical Lanczos algorithm is susceptible to breakdowns and potential instabilities. In addition, the biconjugate gradient (BCG) algorithm, which is the natural generalization of the conjugate gradient algorithm to non-Hermitian linear systems, has a second source of breakdowns, independent of the Lanczos breakdowns. Here, we present two new results. We propose an implementation of a look-ahead variant of the Lanczos algorithm which overcomes the breakdowns by skipping over those steps where a breakdown or a near-breakdown would occur. The new algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products per step as the classical Lanczos algorithm without look-ahead. Based on the proposed look-ahead Lanczos algorithm, we then present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which avoids the second source of breakdowns in the BCG algorithm. We present details of the new method and discuss some of its properties. In particular, we discuss the relationship between QMR and BCG, showing how one can recover the BCG iterates, when they exist, from the QMR iterates. We also present convergence results for QMR, showing the connection between QMR and the generalized minimal residual (GMRES) algorithm, the optimal method in this class of methods. Finally, we give some numerical examples, both for eigenvalue computations and for non-Hermitian linear systems.

Nachtigal, Noel M.↗
NASA NTRS1991

Dynamics and control of a tumbling satellite retrieval device

The problem of capturing a satellite in an uncontrolled three-axis tumble is addressed. The proposed solution is a truss which opens and engulfs the satellite, resulting in coincident centers of mass. Torques are then applied to the truss so that it matches the tumble rates of the satellite and remains motionless in the satellite's reference frame. Equations are derived which show how to vary the mass distribution to match any set of inertia moment ratios. The physical system is shown to be controllable. An optimal control algorithm for tumble matching is then derived and a computer simulation is developed.

Neff, J. M.↗
NASA NTRS1993

IUEAGN: A database of ultraviolet spectra of active galactic nuclei

In 13 years of operation, IUE has gathered approximately 5000 spectra of almost 600 Active Galactic Nuclei (AGN). In order to undertake AGN studies which require large amounts of data, we are consistently reducing this entire archive and creating a homogeneous, easy-to-use database. First, the spectra are extracted using the Optimal extraction algorithm. Continuum fluxes are then measured across predefined bands, and line fluxes are measured with a multi-component fit. These results, along with source information such as redshifts and positions, are placed in the IUEAGN relational database. Analysis algorithms, statistical tests, and plotting packages run within the structure, and this flexible database can accommodate future data when they are released. This archival approach has already been used to survey line and continuum variability in six bright Seyfert 1s and rapid continuum variability in 14 blazars. Among the results that could only be obtained using a large archival study is evidence that blazars show a positive correlation between degree of variability and apparent luminosity, while Seyfert 1s show an anti-correlation. This suggests that beaming dominates the ultraviolet properties for blazars, while thermal emission from an accretion disk dominates for Seyfert 1s. Our future plans include a survey of line ratios in Seyfert 1s, to be fitted with photoionization models to test the models and determine the range of temperatures, densities and ionization parameters. We will also include data from IRAS, Einstein, EXOSAT, and ground-based telescopes to measure multi-wavelength correlations and broadband spectral energy distributions.

Pike, G.↗
NASA NTRS1993

Genetic algorithms - What fitness scaling is optimal?

A problem of choosing the best scaling function as a mathematical optimization problem is formulated and solved under different optimality criteria. A list of functions which are optimal under different criteria is presented which includes both the best functions empirically proved and new functions that may be worth trying.

Kreinovich, Vladik↗
NASA NTRS1996

A New Coarsening Operator for the Optimal Preconditioning of the Dual and Primal Domain Decomposition Methods: Application to Problems with Severe Coefficient Jumps

We present an optimal preconditioning algorithm that is equally applicable to the dual (FETI) and primal (Balancing) Schur complement domain decomposition methods, and which successfully addresses the problems of subdomain heterogeneities including the effects of large jumps of coefficients. The proposed preconditioner is derived from energy principles and embeds a new coarsening operator that propagates the error globally and accelerates convergence. The resulting iterative solver is illustrated with the solution of highly heterogeneous elasticity problems.

Farhat, Charbel↗
NASA NTRS1997

Three-Dimensional Viscous Alternating Direction Implicit Algorithm and Strategies for Shape Optimization

A gradient-based shape optimization based on quasi-analytical sensitivities has been extended for practical three-dimensional aerodynamic applications. The flow analysis has been rendered by a fully implicit, finite-volume formulation of the Euler and Thin-Layer Navier-Stokes (TLNS) equations. Initially, the viscous laminar flow analysis for a wing has been compared with an independent computational fluid dynamics (CFD) code which has been extensively validated. The new procedure has been demonstrated in the design of a cranked arrow wing at Mach 2.4 with coarse- and fine-grid based computations performed with Euler and TLNS equations. The influence of the initial constraints on the geometry and aerodynamics of the optimized shape has been explored. Various final shapes generated for an identical initial problem formulation but with different optimization path options (coarse or fine grid, Euler or TLNS), have been aerodynamically evaluated via a common fine-grid TLNS-based analysis. The initial constraint conditions show significant bearing on the optimization results. Also, the results demonstrate that to produce an aerodynamically efficient design, it is imperative to include the viscous physics in the optimization procedure with the proper resolution. Based upon the present results, to better utilize the scarce computational resources, it is recommended that, a number of viscous coarse grid cases using either a preconditioned bi-conjugate gradient (PbCG) or an alternating-direction-implicit (ADI) method, should initially be employed to improve the optimization problem definition, the design space and initial shape. Optimized shapes should subsequently be analyzed using a high fidelity (viscous with fine-grid resolution) flow analysis to evaluate their true performance potential. Finally, a viscous fine-grid-based shape optimization should be conducted, using an ADI method, to accurately obtain the final optimized shape.

Pandya, Mohagna J.↗
NASA NTRS1996

Stochastic Filtering of Rain Profiles Using Radar, Surface-Referenced Radar, or Combined Radar-Radiometer Measurements

This paper describes a computationally efficient nearly optimal Bayesian algorithm to estimate rain (and drop size distribution) profiles, given a radar reflectivity profile at a single attenuating wavelength. In addition to estimating the averages of all the mutually ambiguous combinations of rain parameters that can produce the data observed, the approach also calculates the n-ns uncertainty in its estimates (this uncertainty thus quantifies "the amount of ambiguity" in the "solution"). The paper also describes a more general approach that can make estimates based on a radar reflectivity profile together with an approximate measurement of the path-integrated attenuation, or a radar reflectivity profile and a set of passive microwave brightness temperatures. This more general "combined" algorithm is currently being adapted for the Tropical Rainfall Measuring Mission.

Haddad, Ziad S.↗
NASA NTRS1998

A Self-Tuning Kalman Filter for Autonomous Spacecraft Navigation

Most navigation systems currently operated by NASA are ground-based, and require extensive support to produce accurate results. Recently developed systems that use Kalman Filter and Global Positioning System (GPS) data for orbit determination greatly reduce dependency on ground support, and have potential to provide significant economies for NASA spacecraft navigation. Current techniques of Kalman filtering, however, still rely on manual tuning from analysts, and cannot help in optimizing autonomy without compromising accuracy and performance. This paper presents an approach to produce a high accuracy autonomous navigation system fully integrated with the flight system. The resulting system performs real-time state estimation by using an Extended Kalman Filter (EKF) implemented with high-fidelity state dynamics model, as does the GPS Enhanced Orbit Determination Experiment (GEODE) system developed by the NASA Goddard Space Flight Center. Augmented to the EKF is a sophisticated neural-fuzzy system, which combines the explicit knowledge representation of fuzzy logic with the learning power of neural networks. The fuzzy-neural system performs most of the self-tuning capability and helps the navigation system recover from estimation errors. The core requirement is a method of state estimation that handles uncertainties robustly, capable of identifying estimation problems, flexible enough to make decisions and adjustments to recover from these problems, and compact enough to run on flight hardware. The resulting system can be extended to support geosynchronous spacecraft and high-eccentricity orbits. Mathematical methodology, systems and operations concepts, and implementation of a system prototype are presented in this paper. Results from the use of the prototype to evaluate optimal control algorithms implemented are discussed. Test data and major control issues (e.g., how to define specific roles for fuzzy logic to support the self-learning capability) are also discussed. In addition, architecture of a complete end-to-end candidate flight system that provides navigation with highly autonomous control using data from GPS is presented.

Truong, Son H.↗
NASA NTRS2000

TRMM Microwave Radiometer Rain Rate Estimation Method with Convective and Stratiform Discrimination

Tropical Rainfall Measuring Mission (TRMM) Microwave Imager (TMI) radiometer brightness temperature data in the 85 GHz channel (T85) reveal distinct local minima (T85min) in a regional map containing a Mesoscale Convective System (MCS). A map of surface rain rate for that region, deduced from simultaneous measurements made by the Precipitation Radar (PR) on board the TRMM satellite, reveals that these T85min, produced by scattering, correspond to local PR rain maxima. Utilizing the PR rain rate map as a guide, we have developed a TMI algorithm to retrieve convective and stratiform rain. In this algorithm, two parameters are used to classify three kinds of thunderstorms (Cbs) based on the T85 data: a) the magnitude of scattering depression deduced from local T85mi, and b) the mean horizontal gradient of T85 around such minima. Initially, the algorithm is optimized or tuned utilizing the PR and TMI data of a few MCS events. The areal distribution of light (1-10 mm/hr), moderate (10-20 mm/hr), and intense (greater than or equal to 20 mm/hr) rain rates are retrieved on the average with an accuracy of about 15%. Taking advantage of this ability of our retrieval method, one could derive the latent heat input into the atmosphere over the 760 km wide swath of the TMI radiometer in the tropics.

Prabhakara, Cuddapah↗
NASA NTRS1998

Congruence Approximations for Entrophy Endowed Hyperbolic Systems

Building upon the standard symmetrization theory for hyperbolic systems of conservation laws, congruence properties of the symmetrized system are explored. These congruence properties suggest variants of several stabilized numerical discretization procedures for hyperbolic equations (upwind finite-volume, Galerkin least-squares, discontinuous Galerkin) that benefit computationally from congruence approximation. Specifically, it becomes straightforward to construct the spatial discretization and Jacobian linearization for these schemes (given a small amount of derivative information) for possible use in Newton's method, discrete optimization, homotopy algorithms, etc. Some examples will be given for the compressible Euler equations and the nonrelativistic MHD equations using linear and quadratic spatial approximation.

Barth, Timothy J.↗