Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational 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 451 records · Page 25

Rational computational design of optimal catalytic surfaces

Using calculations from first-principles based on density functional theory, we introduce an innovative concept for the design of catalysts based on the tuning of the surface properties by progressive layering of thin metal films on an oxide support, where the substrate is substantially exploited as an active design element for the tuning of the reactivity of the metallic surface. Here, we demonstrate this idea by studying the adsorption and activation properties of CO 2 on Pd and oxide-supported Pd thin films.

74 ATOMIC AND MOLECULAR PHYSICS↗

Muon track reconstruction in a segmented bolometric array using multi-objective optimization

Recent advances in segmented solid-state detector arrays for rare-event searches have allowed the technology to approach the ton-scale in detector mass and the scale of meters in size. Often focused around searches for neutrinoless double-beta decay or direct dark matter detection, such experiments also have the capability to search for exotic particles that leave track-like signatures across their volume. However, the segmented nature of such detector arrays often sets the spatial resolution and makes the problem of reconstructing track-like paths non-trivial. Here, in this paper, we present an algorithm that improves reconstruction of track-like events in segmented detectors using multi-objective optimization — a computational technique that optimizes more than one cost function at a time without specifying a quantitative weighting between them. Such a technique allows the reconstruction of tracks through a detector and the determination of path-lengths through individual elements. When combined with the reconstructed energy depositions in each element this allows for a calculation of the stopping power of track-like particles and opens the door to searches for particles with abnormal stopping power like monopoles or lightly-ionizing particles (LIPs). Results are presented which evaluate the precision of the reconstruction tools as they currently stand against Monte Carlo generated data. The algorithm is presented in the context of the CUORE experiment, but has applications to other segmented calorimeter detectors.

47 OTHER INSTRUMENTATION↗

Weighted greedy-optimal design of computer experiments for kernel-based and Gaussian process model emulation and calibration

This article is concerned with the approximation of high-dimensional functions by kernel-based methods. Motivated by uncertainty quantification, which often necessitates the construction of approximations that are accurate with respect to a probability density function of random variables, we aim at minimizing the approximation error with respect to a weighted $L^p$-norm. We present a greedy procedure for designing computer experiments based upon a weighted modification of the pivoted Cholesky factorization. The method successively generates nested samples with the goal of minimizing error in regions of high probability. Numerical experiments validate that this new importance sampling strategy is superior to other sampling approaches, especially when used with non-product probability density functions. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data.

97 MATHEMATICS AND COMPUTING↗

Control optimization, stabilization and computer algorithms for aircraft applications

Computationally useful algorithms are considered that can aid the control engineer in designing systems control in linear time invariant dynamics for aircraft applications. Structural aspects of system identification, matrix parameterization, and the effect of feedback on identifiability of systems. Adaptive and stochastic control model constructions are projected, and a method for approximate identification of aircraft characteristics and subsequent generation of control signals is outlined.

Mitter, S. K.↗

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗

Four-body trajectory optimization

A collection of typical three-body trajectories from the L1 libration point on the sun-earth line to the earth is presented. These trajectories in the sun-earth system are grouped into four distinct families which differ in transfer time and delta V requirements. Curves showing the variations of delta V with respect to transfer time, and typical two and three-impulse primer vector histories, are included. The development of a four-body trajectory optimization program to compute fuel optimal trajectories between the earth and a point in the sun-earth-moon system are also discussed. Methods for generating fuel optimal two-impulse trajectories which originate at the earth or a point in space, and fuel optimal three-impulse trajectories between two points in space, are presented. A brief qualitative comparison of these methods is given. An example of a four-body two-impulse transfer from the Li libration point to the earth is included.

Pu, C. L.↗

Probabilistic computer model of optimal runway turnoffs

Landing delays are currently a problem at major air carrier airports and many forecasters agree that airport congestion will get worse by the end of the century. It is anticipated that some types of delays can be reduced by an efficient optimal runway exist system allowing increased approach volumes necessary at congested airports. A computerized Probabilistic Runway Turnoff Model which locates exits and defines path geometry for a selected maximum occupancy time appropriate for each TERPS aircraft category is defined. The model includes an algorithm for lateral ride comfort limits.

Schoen, M. L.↗

Optimization of an interactive distributive computer network

The activities under a cooperative agreement for the development of a computer network are briefly summarized. Research activities covered are: computer operating systems optimization and integration; software development and implementation of the IRIS (Infrared Imaging of Shuttle) Experiment; and software design, development, and implementation of the APS (Aerosol Particle System) Experiment.

Frederick, V.↗

Reliable numerical computation in an optimal output-feedback design

A reliable algorithm is presented for the evaluation of a quadratic performance index and its gradients with respect to the controller design parameters. The algorithm is a part of a design algorithm for optimal linear dynamic output-feedback controller that minimizes a finite-time quadratic performance index. The numerical scheme is particularly robust when it is applied to the control-law synthesis for systems with densely packed modes and where there is a high likelihood of encountering degeneracies in the closed-loop eigensystem. This approach through the use of an accurate Pade series approximation does not require the closed-loop system matrix to be diagonalizable. The algorithm was included in a control design package for optimal robust low-order controllers. Usefulness of the proposed numerical algorithm was demonstrated using numerous practical design cases where degeneracies occur frequently in the closed-loop system under an arbitrary controller design initialization and during the numerical search.

Vansteenwyk, Brett↗