Search NASA⌕ Search

SEARCH · Search NASA

Results for “classical optimizers”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1980

A pilot modeling technique for handling-qualities research

A brief survey of the more dominant analysis techniques used in closed-loop handling-qualities research is presented. These techniques are shown to rely on so-called classical and modern analytical models of the human pilot which have their foundation in the analysis and design principles of feedback control. The optimal control model of the human pilot is discussed in some detail and a novel approach to the a priori selection of pertinent model parameters is discussed. Frequency domain and tracking performance data from 10 pilot-in-the-loop simulation experiments involving 3 different tasks are used to demonstrate the parameter selection technique. Finally, the utility of this modeling approach in handling-qualities research is discussed.

Hess, R. A.↗
NASA NTRS1984

Shape design sensitivity analysis of built-up structures

Selection of the best shape of a fillet in a tension bar such that no yielding occurs has long attracted the attention of engineers. Dimensions and notations for the bar and fillet are shown. With symmetry, only the upper half of the bar is considered. The optimal design problem is to find a boundary shape to minimize the total area of the fillet such that no yielding occurs. The classical boundary value problem is reduced to a variational or energy related problem which not only has excellent properties of existence and uniqueness but also provides the mathematical foundation for finite element analysis. The variational formulation may be viewed as the principle of virtual work and the finite element method as a application of the Galerkin method to the variational equation for approximate solution of the boundary value problem.

Choi, K. K.↗
NASA NTRS1995

Development of a composite tailoring procedure for airplane wing

The development of a composite wing box section using a higher order-theory is proposed for accurate and efficient estimation of both static and dynamic responses. The theory includes the effect of through-the-thickness transverse shear deformations which is important in laminated composites and is ignored in the classical approach. The box beam analysis is integrated with an aeroelastic analysis to investigate the effect of composite tailoring using a formal design optimization technique. A hybrid optimization procedure is proposed for addressing both continuous and discrete design variables.

Chattopadhyay, Aditi↗
NASA NTRS2010

Basis Function Approximation of Transonic Aerodynamic Influence Coefficient Matrix

A technique for approximating the modal aerodynamic influence coefficients [AIC] matrices by using basis functions has been developed and validated. An application of the resulting approximated modal AIC matrix for a flutter analysis in transonic speed regime has been demonstrated. This methodology can be applied to the unsteady subsonic, transonic and supersonic aerodynamics. The method requires the unsteady aerodynamics in frequency-domain. The flutter solution can be found by the classic methods, such as rational function approximation, k, p-k, p, root-locus et cetera. The unsteady aeroelastic analysis for design optimization using unsteady transonic aerodynamic approximation is being demonstrated using the ZAERO(TradeMark) flutter solver (ZONA Technology Incorporated, Scottsdale, Arizona). The technique presented has been shown to offer consistent flutter speed prediction on an aerostructures test wing [ATW] 2 configuration with negligible loss in precision in transonic speed regime. These results may have practical significance in the analysis of aircraft aeroelastic calculation and could lead to a more efficient design optimization cycle

Li, Wesley Waisang↗
NASA NTRS2011

Basis Function Approximation of Transonic Aerodynamic Influence Coefficient Matrix

A technique for approximating the modal aerodynamic influence coefficients matrices by using basis functions has been developed and validated. An application of the resulting approximated modal aerodynamic influence coefficients matrix for a flutter analysis in transonic speed regime has been demonstrated. This methodology can be applied to the unsteady subsonic, transonic, and supersonic aerodynamics. The method requires the unsteady aerodynamics in frequency-domain. The flutter solution can be found by the classic methods, such as rational function approximation, k, p-k, p, root-locus et cetera. The unsteady aeroelastic analysis for design optimization using unsteady transonic aerodynamic approximation is being demonstrated using the ZAERO flutter solver (ZONA Technology Incorporated, Scottsdale, Arizona). The technique presented has been shown to offer consistent flutter speed prediction on an aerostructures test wing 2 configuration with negligible loss in precision in transonic speed regime. These results may have practical significance in the analysis of aircraft aeroelastic calculation and could lead to a more efficient design optimization cycle.

Li, Wesley W.↗
NASA NTRSDate not supplied

Towards Sheaf Theoretic Analyses for Delay Tolerant Networking

The goal of Delay Tolerant Networking (DTN) is to take a collection of heterogeneous, disparate connections between satellites, space assets, ground stations, and ground infrastructure and bring it together into a cohesive, functioning overlay network. Depending on the systems being considered, one can find links with a one-way light time exceeding minutes (and hours),periodic links which can sometimes be predicted by orbital mechanics, and restrictions based on the variety of capabilities built into these systems. These characteristics preclude traditional network models and routing techniques and have classically led to either rigid routing tables or purely probabilistic models. As the deeper underlying structures remain unknown, development of more DTN-optimized algorithms has lacked the necessary foundation. In a continuation of previous work, the goal of this paper is to identify and study these fundamental structures that exist in delay tolerant networks (DTN), with a focus on space networks. The current routing methodology has been to use contact graph routing (CGR) algorithms. CGR models a series of known contacts as a static graph. For CGR to work, this graph must be globally consistent and must have an accurate picture of the network. Because this is a globally controlled structure, there is little room for flexibility in the event of changes to the network which would naturally occur as the network grows. As a response to the desire for flexibility as the network changes, we introduced the mathematical structure known as sheaves to DTNs last year. The tag-line for sheaves is that they are a mathematically precise way of gluing local data together into unique global data. Thus, sheaves lend extra power to traditional models(and routing algorithms) by taking additional information and merging it, in as consistent a manner as possible, with the representation itself. The clearest example of how Earth-bound networks exhibit behavior that is “sheafy” is link state routers, which build a local-to-global picture of their network by gluing local information together into a global network, exactly as a sheaf would do. For routing within delay tolerant networks to truly exploit this structure, a deeper structure than a graph is required. In this paper, we develop sheaves that can work over directed graphs such as temporal flow networks, we construct a sheaf representation for Dijkstra’s algorithm, and we outline a construction for routing sheaves capable of modeling multicast scenarios. Finally, there is a section of future work suggesting follow-on research.

Robert Short↗
NASA NTRSDate not supplied

NASA Armstrong Flight Research Center Dynamics and Controls (530)

AFRC Controls and Dynamics Branch - Research Areas: - Traditional GN&C - Classical and advanced control algorithms - Risk based approaches for safety critical applications - Integration of novel sensors and sensor fusion (FOSS, LIDAR, etc.) - Trajectory optimization and control - Flight/System Dynamics - Equations of Motion and integrated modeling of vehicles and vehicle systems - Unique and novel vehicle dynamics - Methods for extracting relevant vehicle dynamic information from flight data - Human and vehicle interfaces and interactions - Handling Qualities and Pilot-in-the-loop oscillations (PIO) predictions and design metrics - Ride quality research - Autonomy - Novel algorithms, sensors, and sensor fusion - Bounding risk for testing automated systems - Pilot/Operator interactions - Engineering Support and Airworthiness Assessments - Aircraft modifications and experimental configurations

Chris Miller↗
DOE OSTI2024

Efficient Parameterization of Density Functional Tight-Binding for 5 f -Elements: A Th–O Case Study

Density functional tight binding (DFTB) models for f-element species are challenging to parametrize owing to the large number of adjustable parameters. The explicit optimization of the terms entering the semiempirical DFTB Hamiltonian related to f orbitals is crucial to generating a reliable parametrization for f-block elements, because they play import roles in bonding interactions. However, since the number of parameters grows quadratically with the number of orbitals, the computational cost for parameter optimization is much more expensive for the f-elements than for the main group elements. In this work we present a set of efficient approaches for mitigating the hurdle imposed by the large size of the parameter space. A novel group-by-orbital correction functions for two-center bond integrals was developed. With this approach the number of parameters is reduced, and it grows linearly with the number of elements, maintaining the accuracy and the number of parameters, in the case of f elements, by more than 40%. The parameter optimization step was accelerated by means of the mini-batch BFGS method. This method allows parameter optimizations with much larger training sets than other single batch methods. A stochastic optimizer was employed that helped overcome shallow local minima in the objective function. The proposed algorithm was used to parametrize the DFTB Hamiltonian for the Th–O system, which was subsequently applied to the study of ThO 2 nanoparticles. The training set consisted of 6322 unique structures, which is barely feasible with conventional optimization methods. The optimized parameter set, LANL-ThO, displays good agreement with DFT-calculated properties such as energies, forces, and structures for both clusters and bulk ThO 2 . Benefiting from the fewer number of parameters and lower computational costs for objective function evaluations, this new approach shows its potential applications in DFTB parametrization for elements with high angular momentum, which present a challenge to conventional methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1994

Optimized design of a hypersonic nozzle

Conventional procedures for designing nozzles involve the design of an inviscid contour (using the method of characteristics) that is corrected with a displacement thickness calculated from boundary-layer theory. However, nozzles designed using this classical procedure have been shown to exhibit poor flow quality at Mach numbers characteristic of hypersonic applications. The nozzle to be designed will be a part of the NASA HYPULSE facility which is being used for hypervelocity flight research. Thus, the flow quality of the nozzle is a critical question that needs to be addressed. Design of nozzles for hypersonic applications requires a proper assessment of the effects of the thick boundary layer on the inviscid flowfield. Since the flow field is largely supersonic, the parabolized form of the Navier-Stokes (PNS) equations can be used. The requirement of a uniform flow at the exit plane of the nozzle can be used to define an objective function as part of an optimization procedure. The design procedure used in this study involves the coupling of a nonlinear (least-squares) optimization algorithm with an efficient, explicit PNS solver. The thick boundary layers growing on the walls of the nozzle limit the extent of the usable core region (region with uniform flow) for testing models (especially rectangular). In order to maximize the region of uniform flow, it was decided to have the exit plane of this nozzle to be (nearly) rectangular. Thus, an additional constraint on the nozzle shape resulted, namely the nozzle will have a shape transitioning from a circular one at the inlet to that of a rectangle at the exit. In order to provide for a smooth shape transition, the cross sectional contour of the nozzle is defined by a superellipse. The nozzle is taken to be a meter in length. The axial variations of the major and minor radii of the superellipse are governed by cubic splines. The design parameters are the coefficients of the splines associated with the local nozzle wall slopes. Extensive calculations have been made (with a three-dimensional Euler code) to understand the effects of various parameters such as location of the knot points of the spline function, different ways of characterizing the uniformity of the flow in the exit plane, as well as the effect of constraining the area of the nozzle to be invariant. Turbulent flow (measurements indicate that the flow at the nozzle inlet is turbulent) calculations are now being performed (with the inviscidly designed nozzle contours) to assess the flow quality.

Krishnamurthy, Ramesh↗
DOE OSTI2024

Porting Classical Approaches for Quantum Simulations to Quantum Computers

Simulating quantum many-body systems is one of the most promising problems in which we might anticipate that quantum computers should show quantum advantage. Unfortunately, there is still a gap between this promise and actual practice. New quantum algorithms need to be developed and the current quantum algorithms have various difficulties - e.g efficient state preparation - which must be overcome and improved upon. In many cases, classical approaches need to be ported over to quantum devices. In this project we have developed a suite of new quantum algorithms which makes progress in this regard. We developed a new optimization scheme for variational quantum eigensolvers, UBOS, which mitigates problems with local minimas and barren plateaus while improving convergence to the ground state by an order of magnitude. We developed a new way to utilize qubitization to find ground states of nearly frustration-free Hamiltonians faster than all previous methods. We developed a series of state preparation techniques which helps initialize parameterized quantum circuits into reasonable starting points on which quantum algorithms are then applied. In addition to the development of novel algorithms, it is critical to have classical simulation techniques for approximately simulating quantum circuits which can be used to benchmark and understand quantum algorithms. Toward that end, we developed a novel POVM formalism to simulate quantum circuits as well as exemplify the massive parallelization of tensor network methodologies. Finally, we developed physical understanding of entanglement phase transitions such as many-body localization and random tensor networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Quantum Adiabatic Optimization with Rydberg Arrays: Localization Phenomena and Encoding Strategies

Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native constraints of quantum hardware, necessitating encoding strategies to map the original problem into a hardware-conformant form. While the classical overhead associated with such mappings is easily quantifiable and typically polynomial in problem size, it is much harder to quantify their overhead on the quantum algorithm, e.g., the transformation of the adiabatic timescale. In this work, we address this challenge on the concrete example of the encoding scheme proposed in [Nguyen , PRX Quantum , 010316 (2023)], which is designed to map optimization problems on arbitrarily connected graphs into Rydberg atom arrays. We consider the fundamental building blocks underlying this encoding scheme and determine the scaling of the minimum gap with system size along adiabatic protocols. Even when the original problem is trivially solvable, we find that the encoded problem can exhibit an exponentially closing minimum gap. We show that this originates from a quantum coherent effect, which gives rise to an unfavorable localization of the ground-state wave function. On the QuEra Aquila neutral atom machine, we observe such localization and its effect on the success probability of finding the correct solution to the encoded optimization problem. Finally, we propose quantum-aware modifications of the encoding scheme that avoid this quantum bottleneck and lead to an exponential improvement in the adiabatic performance. This highlights the crucial importance of accounting for quantum effects when designing strategies to encode classical problems onto quantum platforms. Published by the American Physical Society 2025

Bombieri, Lisa (ORCID:0009000950422897)↗
NASA NTRS2023

Quantum Image Denoising: A Framework via Boltzmann Machines, QUBO, and Quantum Annealing

We investigate a framework for binary image denoising via restricted Boltzmann machines (RBMs) that introduces a denoising objective in quadratic unconstrained binary optimization (QUBO) form and is well-suited for quantum annealing. The denoising objective is attained by balancing the distribution learned by a trained RBM with a penalty term for derivations from the noisy image. We derive the statistically optimal choice of the penalty parameter assuming the target distribution has been well-approximated, and further suggest an empirically supported modification to make the method robust to that idealistic assumption. We also show under additional assumptions that the denoised images attained by our method are, in expectation, strictly closer to the noise-free images than the noisy images are. While we frame the model as an image denoising model, it can be applied to any binary data. As the QUBO formulation is well-suited for implementation on quantum annealers, we test the model on a D-Wave Advantage machine, and also test on data too large for current quantum annealers by approximating QUBO solutions through classical heuristics.

restricted Boltzmann machine↗
DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗
NASA NTRS1998

Recent Progress in Quantum Well Infrared Photodetector Research and Development at Jet Propulsion Laboratory

One of the simplest device realizations of the classic particle-in-the-box problem of basic quantum mechanics is the Quantum Well Infrared Photodetector (QWIP). In this paper we discuss the optimization of the detector design, material growth and processing that has culminated in realization of 15 micron cutoff 128x128 QWIP focal plane array camera, hand-held and palmsize 256x256 long-wavelength QWIP cameras and 648x480 long-wavelength cameras, holding forth great promise for myriad applications in 6-25 micron wavelength range in science, medicine, defense and industry.

quantum↗
NASA NTRS2017

Optimal Control Allocation with Load Sensor Feedback for Active Load Suppression, Experiment Development

The problem of control command and maneuver induced structural loads is an important aspect of any control system design. The aircraft structure and the control architecture must be designed to achieve desired piloted control responses while limiting the imparted structural loads. The classical approach is to utilize high structural margins, restrict control surface commands to a limited set of analyzed combinations, and train pilots to follow procedural maneuvering limitations. With recent advances in structural sensing and the continued desire to improve safety and vehicle fuel efficiency, it is both possible and desirable to develop control architectures that enable lighter vehicle weights while maintaining and improving protection against structural damage. An optimal control technique has been explored and shown to achieve desirable vehicle control performance while limiting sensed structural loads. The subject of this paper is the design of the optimal control architecture, and provides the reader with some techniques for tailoring the architecture, along with detailed simulation results.

controls↗
DOE OSTI2025

Fast ion confinement in quasi-axisymmetric stellarator equilibria

This report presents an initial analysis of the fast ion confinement and losses within quasi-axisymmetric stellarator equilibria in consideration by Thea Energy. The equilibria have not yet been explicitly optimized for fast particle confinement and require validation. Modeling with the ASCOT5 code is used to directly examine the fast ion transport. The particle tracking simulations are purely (neo)classical in nature and simply contain the supplied equilibrium and collisions (pitch-angle, energy slowing, and velocity diffusion) from supplied thermal profiles. Uniform marker deposition is used to probe the general confinement properties of the equilibria while a realistic beam-born population is provided from the BEAMS3D code and an alpha particle population is calculated from a fusion source integrator. A first wall is included and defines the loss boundary. Analysis for NBI ions within Thea Energy’s conceptual Eos neutron source are presented along with alpha particles in an enlarged DT-plasma. The fast ions are assessed in regards to their confinement time, pitch, energy, and spatial coordinates. For each population, the impact of collisions and orbit drifts are discussed. It is found that NBI born ions in Eos are strongly confined until slowing-down, owing largely to the tangential injection geometry, while 22% of DT-born alpha energy is lost in the scaled device, indicating that any fusion pilot plant design optimization should include metrics for fast ion confinement.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1977

DESAP 2: A structural design program with stress and buckling constraints. Volume 1: Theoretical and user's manual

DESAP 2 is described as a finite element program for computer-automated, minimum weight design of elastic structures with constraints on stresses (including local instability criteria) and buckling loads. No limits are placed on the number of load conditions for stress-constrained design, but only one of these load conditions can be chosen as the potential buckling load. A substantial portion of DESAP 2, particularly the analysis of the prebuckling state, is derived from the SOLID SAP finite element program. The stress-constrained design is based on the classical stress ratio method, which drives the design towards a fully stressed state. The constraints on the buckling load are handled by solving the appropriate optimality criterion by successive iterations. During each iteration, the element sizes determined by the stress ratio method are used as the minimum size constraints. The element subroutines are organized in a manner that permits the user to make additions and changes with a minimal programming effort. Consequently, DESAP 2 can readily be changed into a special-purpose program to handle the user's specific design requirements and failure criteria.

Kiusalaas, J.↗