Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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 685 records · Page 38

Optical Sensor/Actuator Locations for Active Structural Acoustic Control

Researchers at NASA Langley Research Center have extensive experience using active structural acoustic control (ASAC) for aircraft interior noise reduction. One aspect of ASAC involves the selection of optimum locations for microphone sensors and force actuators. This paper explains the importance of sensor/actuator selection, reviews optimization techniques, and summarizes experimental and numerical results. Three combinatorial optimization problems are described. Two involve the determination of the number and position of piezoelectric actuators, and the other involves the determination of the number and location of the sensors. For each case, a solution method is suggested, and typical results are examined. The first case, a simplified problem with simulated data, is used to illustrate the method. The second and third cases are more representative of the potential of the method and use measured data. The three case studies and laboratory test results establish the usefulness of the numerical methods.

Piezoelectric actuators↗

Parallelized POD-based suboptimal economic model predictive control of a state-constrained Boussinesq approximation

Motivated by an energy efficient building application, we want to optimize a quadratic cost functional subject to the Boussinesq approximation of the Navier-Stokes equations and to bilateral state and control constraints. Since the computation of such an optimal solution is numerically costly, we design an efficient strategy to compute a sub-optimal (but applicationally acceptable) solution with significantly reduced computational effort. We employ an economic Model Predictive Control (MPC) strategy to obtain a feedback control. The MPC sub-problems are based on a linear-quadratic optimal control problem subjected to mixed control and state constraints and a convection-diffusion equation, reduced with proper orthogonal decomposition. Finally, to solve each sub-problem, we apply a primal-dual active set strategy. The method can be fully parallelized, which enables the solution of large problems with real-world parameters.

97 MATHEMATICS AND COMPUTING↗

Search on a hypercubic lattice using a quantum random walk. I. d>2

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighboring locations. We construct a quantum random walk algorithm, based on discretization of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, that is, to find a marked vertex on a d-dimensional hypercubic lattice. The restriction on movement hardly matters for d>2, and scaling behavior close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimize the proportionality constants of the scaling behavior, and demonstrate the approach to that for Grover's algorithm (equivalent to the mean-field theory or the d{yields}{infinity} limit). In particular, the scaling behavior for d=3 is only about 25% higher than the optimal d{yields}{infinity} value.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal strategies for optical quantum memories using long-lived noble-gas spins

Nuclear spins of noble gases exhibit exceptionally long coherence times and can potentially serve as a long-lived storage medium for quantum information. We analyze and compare the performance of two mechanisms for mapping the quantum state of light onto the collective spin state of noble gases. The first mechanism utilizes collisional exchange with the electronic spin state of metastable noble-gas atoms, while the second relies on spin-exchange collisions with ground-state alkali-metal atoms. We describe the operation of an optical quantum memory relying on these two mechanisms using a compact model and study strategies that optimize the memory storage efficiency. Through numerical simulations, we identify optimal sequences for storing optical signals with different signal bandwidths and electronic spin relaxation rates. This work highlights the qualitative difference between the two approaches for using noble gases as long-lived quantum memories at noncryogenic conditions and outlines the regimes in which they are expected to be efficient.

atomic ensemble↗

Application of numerical methods to extend capabilities for optimal rocket guidance: report on reentry guidance of shuttle orbiter

Analytical models are presented for optimal trajectories and reentry guidance of the space shuttle orbiter. Major emphasis is placed on the development of a "footprint', which refers to a set of reachable destination positions attainable by the shuttle at a specified terminal altitude. An unconstrained reentry footprint was calculated for a shuttle vehicle which enters the earth's atmosphere at 93 km initial altitude after a deboost from a near earth orbit. The method of computation is briefly described, and graphs are presented which illustrate the footprint and the variation of state and control variables along it. The effects of constraints and of variations in initial state upon the footprint are discussed.

Source record↗

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗

An Efficient Numerical Algorithm for Solving Data Driven Feedback Control Problems

The goal of this paper is to solve a class of stochastic optimal control problems numerically, in which the state process is governed by an Itô type stochastic differential equation with control process entering both in the drift and the diffusion, and is observed partially. The optimal control of feedback form is determined based on the available observational data. In this work, we call this type of control problems the data driven feedback control. The computational framework that we introduce to solve such type of problems aims to find the best estimate for the optimal control as a conditional expectation given the observational information. To make our method feasible in providing timely feedback to the controlled system from data, we develop an efficient stochastic optimization algorithm to implement our computational framework.

97 MATHEMATICS AND COMPUTING↗

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

pLiner

Compiler optimizations can alter significantly the numerical results of scientific computing applications. When numerical results differ significantly between compilers, optimization levels, and floating-point hardware, these numerical inconsistencies can impact programming productivity. pLiner is a framework that helps programmers identify locations in the source code that are highly affected by compiler optimizations. pLiner uses a novel approach to identify such code locations by enhancing the floatingpoint precision of variables and expressions. Using a guided search to locate the most significant code regions, pLiner can report to users such locations at different granularities, file, function, and line of code.

Laguna Peralta, Ignacio↗

Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

Ito, K.↗

Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

Ito, Kazufumi↗

Automatic control

Numerical solution of optimal control and programming problems

FEEDBACK CONTROL SYSTEM↗

On the use of co-ordinate stretching in the numeral computation of high frequency scattering

The scattering of the sound of a jet engine by an airplane fuselage is modeled by solving the axially symmetric Helmholtz equation exterior to a long thin ellipsoid. The integral equation method based on the single layer potential formulation is used. A family of coordinate systems on the body is introduced and an algorithm is presented to determine the optimal coordinate system. Numerical results verify that the optimal choice enables the solution to be computed with a grid that is coarse relative to the wavelength.

Bayliss, A.↗

Multiabsorber Transition-Edge Sensors for X-Ray Astronomy

We are developing arrays of position-sensitive microcalorimeters for future x-ray astronomy applications. These position-sensitive devices commonly referred to as hydras consist of multiple x-ray absorbers, each with a different thermal coupling to a single-transition-edge sensor microcalorimeter. Their development is motivated by a desire to achieve very large pixel arrays with some modest compromise in performance. We report on the design, optimization, and first results from devices with small pitch pixels (<75 μm) being developed for a high-angular and energy resolution imaging spectrometer for Lynx. The Lynx x-ray space telescope is a flagship mission concept under study for the National Academy of Science 2020 decadal survey. Broadband full-width-half-maximum (FWHM) resolution measurements on a 9-pixel hydra have demonstrated ΔE(FWHM) = 2.23 ± 0.14 eV at Al-Kα, ΔE(FWHM) = 2.44 ± 0.29 eV at Mn-Kα, and ΔE(FWHM) = 3.39 ± 0.23 eV at Cu-Kα. Position discrimination is demonstrated to energies below <1 keV and the device performance is well-described by a finite-element model. Results from a prototype 20-pixel hydra with absorbers on a 50-μm pitch have shown ΔE(FWHM) = 3.38 ± 0.20 eV at Cr-Kα1. We are now optimizing designs specifically for Lynx and extending the number of absorbers up to 25/hydra. Numerical simulation suggests optimized designs could achieve ∼3 eV while being compatible with the bandwidth requirements of the state-of-the art multiplexed readout schemes, thus making a 100,000 pixel microcalorimeter instrument a realistic goal.

Smith, Stephen J.↗

Use of Physics Based Management Optimization for Groundwater Remedy Design - 18671

Numerical modeling coupled with formal mathematical optimization techniques was used to design a groundwater remedy strategy to address a carbon tetrachloride (CCl{sub 4}) plume covering several square miles. The optimization approach, methodology, and project costs are described. The site consists of a large grain elevator in Nebraska. CCl{sub 4} was used as a fumigant and subsequently impacted soils and groundwater. Remedy design focused on the more diffuse plume, which extended approximately 4.5 miles down gradient of the source area. An eleven-layer model was developed and calibrated to observed groundwater conditions. This model was linked with formal optimization techniques to identify the best design capable of meeting client specified requirements and well location limitations. The planned system included requirements on the location of extraction and injection wells, total system flow rate, number of management periods, and specific constraints limiting further plume expansion. A separate trinitrotoluene (TNT) contaminant plume from a third party was located vertically above the leading edge of the CCl{sub 4} plume within the same aquifer. A further constraint imposed was that the design could not affect or cause additional migration of the TNT plume. Optimal system design was determined using HydroGeoLogic's Physics Based Management Optimization (PBMO{sup TM}) system. Over 38,000 candidate solutions consisting of different combinations of pumping and injection wells locations and rates, were evaluated through flow modeling coupled with either particle tracking or fully convective-dispersive transport simulations to determine the optimal design. Planning for installation of the optimal design is underway. Simulations were completed on a distributed computing platform consisting of 3 Quad Core PCs. Flow and particle tracking simulations required less than 2 minutes per simulation. Coupled flow and transport simulation run times were generally between 30-40 minutes per simulation. The total costs for developing the groundwater flow model and completing the subsequent optimal design were approximately $400,000. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Chebyshev Polynomials Are Not Always Optimal

The authors are concerned with the problem of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations, and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. In this note, the authors show that this is not true in general. Moreover, the authors derive sufficient conditions which guarantee that Chebyshev polynomials are optimal. Also, some numerical examples are presented.

CHEBYSHEV APPROXIMATION↗

Numerical Methodology For Full-Body TPS Sizing And Optimization For Access-To-Space Vehicles

This paper presents details of the methodology and numerical procedures developed at NASA Ames for full-body TEXAS sizing and optimization for Access to Space vehicle concepts. The core of the procedures is a robust implicit solver for one dimensional transient heat conduction in reusable multilayer TEXAS stackups. The solver includes an arbitrary number of material layers, contact resistances between materials, temperature and pressure dependent material and surface properties, numerous boundary-condition options, and self-adaptive time stepping. The solver is coupled with the Access-to-Space material database of 23 candidate TPS and structural materials and a thermal-environment database obtained from trajectory-based fullbody Navier-Stokes computations of the external flowfield. The thermal environment and material response are coupled through the use of T-type heat transfer coefficients. TIPS sizing and weight optimization are performed at every surface point on the vehicle based on sizing constraints which include material temperature limits, maximum backwall temperature, and cumulative interior heat flux. Typical results are presented for a lifting body concept with 10000 surface points, which required 35 minutes to compute on an SGI Indigo 2.

Milos, Frank S.↗