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 361 records · Page 20

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

Moltensaltpropnet

MoltenSaltPropnet is a physics-informed machine learning framework that aims to predict the thermophysical properties of molten fluoride and chloride salt mixtures, which are crucial for the design and safety of Generation IV molten salt reactors. The code processes data from the Molten-Salt Thermal Properties Database (MSTDB-TP) and the Janz compendium, converting critically evaluated correlations into fast, differentiable surrogate models for density, viscosity, thermal conductivity, and heat capacity across 448 distinct salt systems. The implementation consists of several key components: 1. Data Curation: The code parses and cleans the raw data, normalizing elemental mole fractions and extracting relevant regression coefficients for various thermophysical properties. 2. Feature Engineering: It generates fixed-length numerical descriptors that encapsulate the composition and temperature, incorporating polynomial interaction terms and dimensionality-reduction techniques to optimize model performance. 3. Coefficient Learning: Four different machine learning architectures are employed: a deep residual network (ResNet), a Kolmogorov–Arnold network (KAN), a sparsity-inducing neural network (SNN), and classical regression models. Each model learns to predict coefficients that define the temperature-dependent correlations for the thermophysical properties. 4. Property Reconstruction: The predicted coefficients are used to compute temperature-dependent property values, ensuring positivity and monotonic trends through a composite loss function that enforces physical constraints. 5. User Interface: An open-source web application enables users to filter the database, train task-specific models, and visualize the results, allowing for rapid exploration of candidate salt mixtures. MoltenSaltPropnet bridges the gap between limited experimental data and high-fidelity reactor simulations, providing a powerful tool for researchers in the field of molten salt reactors and advanced nuclear energy systems.

Retamales, Mauricio Eduardo Tano [Idaho National L↗

Open-Source Data for MAC-POSTS: Mobility Data Analytics Center - Prediction, Optimization, and Simulation Toolkit for Transportation Systems

MAC-POSTS (Mobility Data Analytics Center - Prediction, Optimization, and Simulation toolkit for Transportation Systems) is a toolkit for dynamic transportation network modeling. Developed by the Mobility Data Analytics Center (MAC) at Carnegie Mellon University, this package implements many classic dynamic transportation network models, as well as new models proposed by MAC members. It has served as one building block for many other models and research projects. As such, this package used to be treated as an internal research project of the MAC lab, and admittedly, the code base is messy, and the interface is hard to use. However, we are working hard to make it a generally usable and useful toolkit for dynamic transportation network modeling. We would really appreciate any feedback, comments, suggestions, or criticisms.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Numerical modeling of physical vapor transport under microgravity conditions: Effect of thermal creep and stress

One of the most promising applications of microgravity (micro-g) environments is the manufacture of exotic and high-quality crystals in closed cylindrical ampoules using physical vapor transport (PVT) processes. The quality enhancements are believed to be due to the absence of buoyant convection in the weightless environment - resulting in diffusion-limited transport of the vapor. In a typical experiment, solid-phase sample material is initially contained at one end of the ampoule. The sample is made to sublime into the vapor phase and deposit onto the opposite end by maintaining the source at an elevated temperature with respect to the deposit. Identification of the physical factors governing both the rates and uniformity of crystal growth, and the optimization of the micro-g technology, will require an accurate modeling of the vapor transport within the ampoule. Previous micro-g modeling efforts have approached the problem from a 'classical' convective/diffusion formulation, in which convection is driven by the action of buoyancy on thermal and solutal density differences. The general conclusion of these works have been that in low gravity environments the effect of buoyancy on vapor transport is negligible, and vapor transport occurs in a diffusion-limited mode. However, it has been recently recognized than in the non-isothermal (and often low total pressure) conditions encountered in ampoules, the commonly-assumed no-slip boundary condition to the differential equations governing fluid motion can be grossly unrepresentative of the actual situation. Specifically, the temperature gradients can give rise to thermal creep flows at the ampoule side walls. In addition, temperature gradients in the vapor itself can, through the action of thermal stress, lead to bulk fluid convection.

Mackowski, Daniel W.↗

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗

Exploiting Quantum Resonance to Solve Combinatorial Problems

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

Zak, Michail↗

Reinforcement learning pulses for transmon qubit entangling gates

The utility of a quantum computer is highly dependent on the ability to reliably perform accurate quantum logic operations. For finding optimal control solutions, it is of particular interest to explore model-free approaches, since their quality is not constrained by the limited accuracy of theoretical models for the quantum processor—in contrast to many established gate implementation strategies. In this work, we utilize a continuous control reinforcement learning algorithm to design entangling two-qubit gates for superconducting qubits; specifically, our agent constructs cross-resonance and CNOT gates without any prior information about the physical system. Using a simulated environment of fixed-frequency fixed-coupling transmon qubits, we demonstrate the capability to generate novel pulse sequences that outperform the standard cross-resonance gates in both fidelity and gate duration, while maintaining a comparable susceptibility to stochastic unitary noise. We further showcase an augmentation in training and input information that allows our agent to adapt its pulse design abilities to drifting hardware characteristics, importantly, with little to no additional optimization. Our results exhibit clearly the advantages of unbiased adaptive-feedback learning-based optimization methods for transmon gate design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Configurations for Rotating Spacecraft Formations

In this paper a new class of formations that maintain a constant shape as viewed from the Earth is introduced. An algorithm is developed to place n spacecraft in a constant shape formation spaced equally in time using the classical orbital elements. To first order, the dimensions of the formation are shown to be simple functions of orbit eccentricity and inclination. The performance of the formation is investigated over a Keplerian orbit using a performance measure based on a weighted average of the angular separations between spacecraft in formation. Analytic approximations are developed that yield optimum configurations for different values of n. The analytic approximations are shown to be in excellent agreement with the exact solutions.

Hughes, Steven P.↗

Inference of phase field fracture models

The phase field approach to modeling fracture uses a diffuse damage field to represent cracks. This representation mollifies singularities that arise in computations with sharp interface models and some of the resultant difficulties in the mathematical and numerical treatment of fracture. Phase field fracture models have proven effective at representing crack propagation, branching, and merging. Specific formulations, beginning with brittle fracture, have also been shown to converge to classical solutions. Extensions to cover the range of material failure, including ductile and cohesive fracture, lead to an array of possible models. There exists a large body of literature focusing on this class of models and on the impact of model form on the predicted crack evolution. However, there have not been systematic studies into how optimal models may be chosen. Here, we take a first step in this direction by developing formal methods for identification of the best parsimonious model of phase field fracture given full-field data on the damage and deformation fields. We consider some of the main models that have been used for the degradation of elastic response due to damage and its propagation. Our approach builds upon Variational System Identification (VSI), a weak form variant of the Sparse Identification of Nonlinear Dynamics (SINDy). Furthermore, in this first communication we focus on synthetically generated data but we also consider central issues associated with the use of experimental full-field data, such as data sparsity and noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Initiation of dusting corrosion in high-temperature alloys under CO exposure

Carbon monoxide is commonly encountered in energy systems, yet its reactivity with structural alloys—critical heat-resistant components in these systems—has been largely overlooked compared to the well-documented effects of oxidizing gases. In contrast, we demonstrate the high-temperature reaction of CO with NiAl using in-situ low-energy electron microscopy and X-ray photoemission electron microscopy. Our results show that CO dissociates into atomic oxygen and carbon, resulting in two concurrent reactions: selective oxidation of aluminum to form Al 2 O 3 and the initiation of dusting corrosion through carbon dissolution into the alloy and subsequent carbon deposition on the surface. These reactions produce spatially distinct surface products, preventing the formation of a continuous protective Al oxide layer. These results reveal a preference for the dissociative pathway of CO over the classic Boudouard disproportionation reaction that forms CO 2 . These insights not only advance our understanding of CO-induced alloy degradation but also highlight the practical implications for managing alloy stability and optimizing catalysis in carbon-rich environments, such as those in petrochemical processing and hydrocarbon combustion.

36 MATERIALS SCIENCE↗

Extraordinary frequency stabilization by resonant nonlinear mode coupling

Here, we show that a self-sustained oscillator with a frequency-selective element operating with two nonlinearly coupled modes can achieve a level of frequency stability well beyond that available using single-mode operation. The system of interest consists of a self-sustained oscillator based on a nonlinear primary mode that is coupled via an internal resonance to a passive secondary mode. Analysis of a generic model for this resonance with both additive and multiplicative noises reveals that the stability improvements accrue from two sources: (i) nonlinear frequency veering in the primary mode, a classical analogue to quantum-level repulsion, that eliminates amplitude-to-frequency noise conversion; and (ii) phase cleaning of the oscillator through an intrinsic phase constraint arising from synchronization of the modes. This latter effect can significantly reduce the effects of intrinsic frequency fluctuations of the primary mode, which are not accessible by any known strategy using single-mode operation. The theoretical predictions are supported by experimental measurements of a microelectromechanical systems-based oscillator that demonstrate a reduction in oscillator line width of several orders of magnitude. This approach offers a means of optimizing frequency stability in self-sustained oscillators, which has direct implications for applications in timekeeping and sensing.

36 MATERIALS SCIENCE↗

OSA Spotlight Summary: Designing Miniature X-ray Optics for the SmallSat Lunar Science Mission Concept CubeX

The scientific demand for extended field X-Ray remote sensing for mapping of planetary bodies has produced the CubeSat X-ray Telescope (CubeX) lunar mission concept. Orbiting the Moon at 6,000 km for 1 year sometime during the mid-decade solar maximum, the primary objectives of CubeX are to map lunar surface elemental abundances and to assess feasibility of x-ray pulsar timing navigation. CubeX’s Miniature X-ray Optics (MiXO) design builds on heritage of existing X-ray imaging designs using new electroformed NiCo alloy replication (ENR) to create shells of 1 mm thickness. MiXO will provide 1 arcmin resolution X-Ray imaging for an extended instantaneous field of view, at various energy range sensitivities. Based on the classic Wolter-Type I design (using a paraboloid/hyperboloid grazing mirror pair), mirror parameters were expanded to allow both shell length and focal-plane offsets to vary independently. The design was optimized with a merit function that factored together four sub-merits: PSF sharpness (measured as half-power diameter), consistency across the field, minimized scattering, and maximized effective area. Monte Carlo analysis was used to predict final performance, including surface scatter effects. The demonstrated configurations include a compact 34 shell design with a diameter of 105 mm more efficient at higher energies, and a larger 130 mm/24 shell version with a larger overall effective area at lower energies. The compact design carries more expensive fabrication and assembly cost (with more shells) as well as a more challenging alignment (with denser packing). Both have overall resolution <1’ up to 26’ off-axis and <1.5’ up to 33’ off-axis, whereas a conventional design’s image quality degrades quickly beyond 15’ off-axis. This opens up new possibilities for future SmallSat missions that could use two different configurations for wide energy ranges or midsized instruments using multiple identical modules for larger collecting area.

x-ray↗

An Integrated Computational Materials Engineering (ICME) Approach to Design Nonlinear Transition Zones Between Dissimilar Metals

Current approaches to designing graded transition joints (GTJs) between dissimilar metals often rely on linear changes in both composition profiles and thickness of each sublayer. This increases fabrication cost and may not be optimal with respect to residual stress or the formation of undesirable phases. Here, in this study, GTJs between P91 ferritic/martensitic steel and 347H austenitic stainless steel were designed using Integrated Computational Materials Engineering (ICME) principles with nonlinear composition and length profiles. Guided by inputs from classical mechanics and CALPHAD predictions of carbon chemical potential, a novel transition zone consisting of five discrete compositions was proposed, with the thickness of each sublayer varying according to a brachistochrone-inspired distribution. In addition to carbon potential gradients, CALPHAD was used to predict coefficients of thermal expansion, which were incorporated into finite element models to evaluate stress evolution. The proposed nonlinear design resulted in a smoother carbon potential gradient, lower carbon depletion at the P91 interface, and a comparable residual stress under long-term thermal exposure, compared to a conventional linear design using ten sublayers with equal thickness. This work introduces a brachistochrone-inspired distribution for GTJ design, offering a general framework for optimizing graded interfaces between dissimilar metals.

Directed Energy Deposition↗

High-Performance Computing Optimization for Aladyn – Adaptive Neural Network Molecular Dynamics Mini-Application

This report provides a description and performance evaluation of the optimization techniques for high performance computing (HPC) implementation of the open source Computational Materials mini-application Aladyn (https://github.com/nasa/aladyn). Aladyn is a basic molecular dynamics code written in FORTRAN 2003, which is designed to demonstrate the use of adaptive neural networks (ANNs) in atomistic simulations. The role of ANNs is to efficiently reproduce the very complex energy landscape resulting from the atomic interactions in materials with the accuracy of the more expensive quantum mechanics-based calculations. The ANN is trained on a large set of atomic structures calculated using the density functional theory (DFT) method. While achieving orders of magnitude faster computational performance than DFT, the ANN-based approach was still very computationally demanding compared to the conventional approach of using empirically fitted energy functions. After its initial development, Aladyn was evaluated and optimized by experts at the NASA Advanced Supercomputing (NAS) division to exploit modern supercomputer architectures. The code has been optimized for execution on multicore central processing units (CPUs), including Intel® Skylake microarchitecture, and on graphic accelerators, such as Nvidia® V100 graphic processing units (GPUs), using Open Multi-Processing (OpenMP) and Open Accelerators (OpenACC) programming interfaces. The optimization achieved a speedup of 4.7 times the baseline version on CPU performance and an additional 2.4 times on CPU+GPU performance. Atomistic computer simulations are a fundamental tool in materials research to model material properties form physics-based first principles. Atomic interaction, governed by Quantum Mechanics (QM) require sophisticated and highly computationally demanding mathematical models to calculate [1]. Classical methods use approximate functional forms, empirically fitted through a set of variable parameters to emulate atomic energies as direct functions of atomic coordinates [2]. While empirical potentials are computationally much simpler, allowing simulations of large-scale systems of up to a trillion (1012) atoms [3], they are substantially less accurate compared to quantum calculations and applicable only to very specific atomic configurations or predefined crystallographic phases. A recently suggested approach is to use heuristic machine learning methods [4], such as those based on Adaptive Neural Networks (ANNs) to predict atomic energies, after being trained on a sufficiently large database of QM-calculated structures [5,6]. This approach reduces significantly the computational complexity, allowing for simulations of orders of magnitude larger systems compared to QM-based methods without compromising accuracy. Still, compared to classical methods using empirical energy functions, ANN methods remain two- to three orders of magnitude more computationally demanding. Hence, the computational cost of simulations, together with the need for extensive training of ANNs, still makes the practical implementation of ANN-based methods quite challenging. The purpose of the Aladyn mini-application software [7], available as open source at https://github.com/nasa/aladyn, is to be a testbed for exploring possible optimization strategies to develop highly scalable parallel algorithms for ANN-based atomistic simulations. Aladyn is aimed at utilizing the architecture of the high-end modern highperformance computing (HPC) hardware based on multicore central processing units (CPUs) equipped with graphic processing unit (GPU) accelerators. Specifically, the goal is to optimize the performance on a single HPC compute node, before implementing scaling to multi-node parallelization using message passing interface (MPI). At the same time, the open source code of Aladyn can serve as a training model for students and professors in academia.

Yamakov, Vesselin I.↗

Quantum solver for single-impurity Anderson models with particle-hole symmetry

Quantum embedding methods, such as dynamical mean-field theory (DMFT), provide a powerful framework for investigating strongly correlated materials. A central computational bottleneck in DMFT is in solving the Anderson impurity model (AIM), whose exact solution is classically intractable for large bath sizes. In this work, we benchmark a quantum-classical hybrid solver tailored for particle-hole symmetric AIMs, using the variational quantum eigensolver to prepare the ground state of the model with shallow quantum circuits. The solver uses shallow quantum ansätze and one set of variational parameters to prepare the ground state and its particle and hole excitations, enabling the construction of the impurity Green’s function through a continued-fraction expansion. We evaluate the performance of this approach across a few bath sizes and interaction strengths under noisy, shot-limited conditions. We compare three optimization routines (COBYLA, Adam, and L-BFGS-B) in terms of convergence and fidelity, assess the benefits of estimating a quantum-computed moment correction to the variational energies, and benchmark the approach by comparing the density of states computed from the impurity Green’s function against that obtained using a classical pipeline. Our results demonstrate the feasibility of Green’s function construction on near-term devices and establish practical benchmarks for quantum impurity solvers embedded within self-consistent DMFT loops.

Karabin, Mariia [ORNL]↗

Predicting Open Quantum Dynamics with Data-Informed Quantum-Classical Dynamics

We introduce a data-informed quantum-classical dynamics (DIQCD) approach for predicting the evolution of an open quantum system. The equation of motion in DIQCD is a Lindblad equation with a flexible, time-dependent Hamiltonian that can be optimized to fit sparse and noisy data from local observations of an extensive open quantum system. We demonstrate the accuracy and efficiency of DIQCD for both experimental and simulated quantum devices. We show that DIQCD can predict entanglement dynamics of ultracold molecules (calcium fluoride) in optical tweezer arrays. DIQCD also successfully predicts carrier mobility in organic semiconductors (rubrene) with accuracy comparable to nearly exact numerical methods.

Lindblad equation↗

Blueprint for DOE Quantum Supercomputing: Ensuring U.S. Leadership in the Quantum Decade

Quantum computing stands at the threshold of a transformative decade, where the field will evolve from small-scale demonstrations toward practical scientific computing at scale. This Blueprint identifies fault-tolerant quantum computers (FTQCs) as a viable, scalable, and broadly applicable path to achieving “quantum scientific utility,” defined as solving scientifically valuable problems beyond the reach of conventional, classical computers. This capability is expected to show scientific demonstrations in the late 2020s and to mature in the early-to-mid 2030s. This Blueprint outlines a strategy to prepare the U.S. Department of Energy (DOE) for FTQCs and their integration into the U.S. national scientific computing infrastructure. Its purpose is to identify the steps, milestones, and research directions necessary for DOE to enable initial deployment of FTQCs in 2028 as a scientific tool for the nation and mature this capability into the 2030s. DOE has a long history of supporting quantum information science and technology, contributing significantly to research advancements, training a quantum-ready workforce, and providing access to early small-scale quantum hardware. Given recent demonstrations of logical operations on error-corrected logical qubits and the advancement of commercial hardware roadmaps, DOE should begin preparations for large-scale, fault-tolerant quantum computing deployment for DOE science missions. This Blueprint proposes that DOE focus on (1) deploying first-generation scientifically relevant quantum computers with at least 100 logical qubits and performing at least 10,000 to 100,000 hard logical operations in scientifically relevant calculations; (2) developing essential FTQC programming competencies, system software, and facility readiness; and (3) investing in cutting edge focused R&D that fosters breakthroughs in scientific applications, algorithms, and logical architectures needed to accelerate the advent of scientific utility. This effort will position DOE to transition to larger systems: production-scale quantum computers that comprise 1,000 to 10,000 logical qubits, perform 1 to 10 billion hard logical operations, and execute scientifically useful computations at scale. Achieving these goals will require DOE facilities to evolve with urgency to support scientific campaigns that integrate quantum and classical computing resources into efficient workflows, novel software and firmware environments for compiling and routing quantum programs on FTQC machines, and suitable infrastructure for quantum hardware. It will also require further development and optimization of scientific applications from the fields of materials science, quantum chemistry, and high-energy and nuclear physics. The Blueprint calls for transformative R&D and collective action to accelerate the advent of scientific quantum utility and bring it within reach by 2028.

97 MATHEMATICS AND COMPUTING↗

Study of winglets applied to biplanes

This paper examines, both theoretically and experimentally, the possibility of improving the aerodynamic characteristics of a biplane configuration by adding winglets. Theoretical calculations show good agreement with experiment in predicting inviscid drag due to lift. Theoretical and experimental results indicate that the addition of winglets to an optimized biplane configuration can increase the ideal efficiency factor by up to 13 percent, as well as increasing the lift-curve slope and maximum lift coefficient. A theoretical analysis comparing the biplane with an optimized winglet to an equivalent monoplane indicates that the biplane has the potential for a 6.4-percent increase in L/D(max), and 13-percent increase in C(L) to the 3/2-power/C(D), the classical endurance parameter.

Gall, P. D.↗