SEARCH · Engineering Papers

Results for “variational algorithms”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 991 records · Page 55

All sources NASA NTRS DOE OSTI

NASA NTRS2023

Machine Learning to Increase the Quality and Repeatability of 3D Printing - Workflow

The imprecise nature of three-dimensional (3D) printing limits the technology’s use beyond prototyping. For production of end-use parts, such as those for aerospace applications, improvements are needed to enhance quality and repeatability. Much of the difficulty in obtaining high quality printed parts lies in finding optimum printing parameters. Currently, this requires trial and error performed by an expert. Finding the optimum printing parameters is also obfuscated by the variation in optimum parameters throughout the part due to part geometry and printer effects. To allow for locally optimized printing parameters, one can envision a machine learning algorithm that could take in an object, predict the best printing parameters, and communicate these parameters to a printer. With this scenario in mind, we developed a tool that can predict and implement locally optimized printing parameters in 3D printing. This tool consists of elements designed to detect errors in a printed part, predict the probability of local flaws occurring at each point in the part, and select the optimal local parameters for the highest quality part given hardware limitations. The results of this work were highlighted in Advanced Materials Technologies. In this paper, we will discuss in greater depth the workflow and algorithms involved with this tool that were not detailed in the journal publication.

additive manufacturing↗

DOE OSTI2020

Characterization of groove density variation of VLS gratings with ALS XROL LTP-II in different operation modes

The long trace profiler, LTP-II, available at the Advanced Light Source (ALS) X-ray Optics Laboratory (XROL), was recently upgraded by replacing a multimode diode laser light source with a single-mode, wavelength-stabilized, fibercoupled diode laser system. The upgrade enables us to reliably characterize the lateral variation of groove density of variable-line-spacing (VLS) x-ray diffraction gratings. Here, we discuss the LTP-II performance with an example of measurements with a VLS grating with the groove density at the grating center of 300 lines/mm. For the measurements, we use the LTP-II in two different operation arrangements, the single Gaussian beam and the pencil beam interferometer arrangements. For each operation arrangement, we apply two data processing algorithms: with calculating the centroid position and with determining the position of a characteristic features of the detected beam intensity distributions. Additionally, we discuss the observed strong correlation between the LTP-II modes of operation and the resulted (extracted) groove density variations. We also speculate on possible origin of the correlation.

42 ENGINEERING↗

NASA NTRS2010

Land Surface Phenology from MODIS: Characterization of the Collection 5 Global Land Cover Dynamics Product

Information related to land surface phenology is important for a variety of applications. For example, phenology is widely used as a diagnostic of ecosystem response to global change. In addition, phenology influences seasonal scale fluxes of water, energy, and carbon between the land surface and atmosphere. Increasingly, the importance of phenology for studies of habitat and biodiversity is also being recognized. While many data sets related to plant phenology have been collected at specific sites or in networks focused on individual plants or plant species, remote sensing provides the only way to observe and monitor phenology over large scales and at regular intervals. The MODIS Global Land Cover Dynamics Product was developed to support investigations that require regional to global scale information related to spatiotemporal dynamics in land surface phenology. Here we describe the Collection 5 version of this product, which represents a substantial refinement relative to the Collection 4 product. This new version provides information related to land surface phenology at higher spatial resolution than Collection 4 (500-m vs. 1-km), and is based on 8-day instead of 16-day input data. The paper presents a brief overview of the algorithm, followed by an assessment of the product. To this end, we present (1) a comparison of results from Collection 5 versus Collection 4 for selected MODIS tiles that span a range of climate and ecological conditions, (2) a characterization of interannual variation in Collections 4 and 5 data for North America from 2001 to 2006, and (3) a comparison of Collection 5 results against ground observations for two forest sites in the northeastern United States. Results show that the Collection 5 product is qualitatively similar to Collection 4. However, Collection 5 has fewer missing values outside of regions with persistent cloud cover and atmospheric aerosols. Interannual variability in Collection 5 is consistent with expected ranges of variance suggesting that the algorithm is reliable and robust, except in the tropics where some systematic differences are observed. Finally, comparisons with ground data suggest that the algorithm is performing well, but that end of season metrics associated with vegetation senescence and dormancy have higher uncertainties than start of season metrics.

Land cover dynamics↗

DOE OSTI2025

Post-hoc reweighting of hadron production in the Lund string model

We present a method for reweighting flavor selection in the Lund string fragmentation model. This is the process of calculating and applying event weights enabling fast and exact variation of hadronization parameters on pre-generated event samples. The procedure is post hoc, requiring only a small amount of additional information stored per event, and allowing for efficient estimation of hadronization uncertainties without repeated simulation. Weight expressions are derived from the hadronization algorithm itself, and validated against direct simulation for a wide range of observables and parameter shifts. The hadronization algorithm can be viewed as a hierarchical Markov process with stochastic rejections, a structure common to many complex simulations outside of high-energy physics. This perspective makes the method modular, extensible, and potentially transferable to other domains. We demonstrate the approach in Pythia, including both coverage considerations and timing benefits. For the purpose of this paper, our goal is to develop and demonstrate the the formalism, and we therefore exclude several model variations for baryon production (popcorn model, junction production) needed for proton collisions. These will be the topic of a future paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NASA NTRS2002

Using TRMM Data To Understand Interannual Variations In the Tropical Water Balance

A significant element of the science rationale for TRMM centered on assembling rainfall data needed to validate climate models-- climatological estimates of precipitation, its spatial and temporal variability, and vertical modes of latent heat release. Since the launch of TRMM, a great interest in the science community has emerged for quantifying interannual variability (IAV) of precipitation and its relationship to sea-surface temperature (SST) changes. The fact that TRMM has sampled one strong warm/ cold ENSO couplet, together with the prospect for a mission lifetime approaching ten years, has bolstered this interest in these longer time scales. Variability on a regional basis as well as for the tropics as a whole is of concern. Our analysis of TRMM results so far has shown surprising lack of concordance between various algorithms in quantifying IAV of precipitation. The first objective of this talk is to quantify the sensitivity of tropical precipitation to changes in SSTs. We analyze performance of the 3A11, 3A25, and 3B31 algorithms and investigate their relationship to scattering-- based algorithms constructed from SSM/I and TRMM 85 kHz data. The physical basis for the differences (and similarities) in depicting tropical oceanic and land rainfall will be discussed. We argue that scattering-based estimates of variability constitute a useful upper bound for precipitation variations. These results lead to the second question addressed in this talk-- How do TRMM precipitation / SST sensitivities compare to estimates of oceanic evaporation and what are the implications of these uncertainties in determining interannual changes in large-scale moisture transport? We summarize results of an analysis performed using COADS data supplemented by SSM/I estimates of near-surface variables to assess evaporation sensitivity to SST. The response of near 5 W sq m/K is compared to various TRMM precipitation sensitivities. Implied moisture convergence over the tropics and its sensitivity to errors of these algorithms is discussed.

Robertson, Franklin R.↗

DOE OSTI2021

Application of Quantum Machine Learning to High Energy Physics Analysis at LHC using IBM Quantum Computer Simulators and IBM Quantum Computer Hardware

One of the major objectives of the experimental programs at the LHC is the discovery of new physics. This requires the identification of rare signals in immense backgrounds. Using machine learning algorithms greatly enhances our ability to achieve this objective. With the progress of quantum technologies, quantum machine learning could become a powerful tool for data analysis in high energy physics. In this study, using IBM gate-model quantum computing systems, we employ the quantum variational classifier method and the quantum kernel estimator method in two recent LHC flagship physics analyses: $t\bar{t}H$ (Higgs boson production in association with a top quark pair) and $H\rightarrow\mu\mu$ (Higgs boson decays to two muons). We have obtained early results with 10 qubits on the IBM quantum simulator and the IBM quantum hardware. On the quantum simulator, the quantum machine learning methods perform similarly to classical algorithms such as SVM (support vector machine) and BDT (boosted decision tree), which are often employed in LHC physics analyses. On the quantum hardware, the quantum machine learning methods have shown promising discrimination power, comparable to that on the quantum simulator. This study demonstrates that quantum machine learning has the ability to differentiate between signal and background in realistic physics datasets.

Chan, Jay↗

DOE OSTI2024

Quantum simulation of excited states from parallel contracted quantum eigensolvers

Abstract Computing excited-state properties of molecules and solids is considered one of the most important near-term applications of quantum computers. While many of the current excited-state quantum algorithms differ in circuit architecture, specific exploitation of quantum advantage, or result quality, one common feature is their rooting in the Schrödinger equation. However, through contracting (or projecting) the eigenvalue equation, more efficient strategies can be designed for near-term quantum devices. Here we demonstrate that when combined with the Rayleigh–Ritz variational principle for mixed quantum states, the ground-state contracted quantum eigensolver (CQE) can be generalized to compute any number of quantum eigenstates simultaneously. We introduce two excited-state (anti-Hermitian) CQEs that perform the excited-state calculation while inheriting many of the remarkable features of the original ground-state version of the algorithm, such as its scalability. To showcase our approach, we study several model and chemical Hamiltonians and investigate the performance of different implementations.

Physics↗

NASA NTRS1985

Analysis of adaptive algorithms for an integrated communication network

Techniques were examined that trade communication bandwidth for decreased transmission delays. When the network is lightly used, these schemes attempt to use additional network resources to decrease communication delays. As the network utilization rises, the schemes degrade gracefully, still providing service but with minimal use of the network. Because the schemes use a combination of circuit and packet switching, they should respond to variations in the types and amounts of network traffic. Also, a combination of circuit and packet switching to support the widely varying traffic demands imposed on an integrated network was investigated. The packet switched component is best suited to bursty traffic where some delays in delivery are acceptable. The circuit switched component is reserved for traffic that must meet real time constraints. Selected packet routing algorithms that might be used in an integrated network were simulated. An integrated traffic places widely varying workload demands on a network. Adaptive algorithms were identified, ones that respond to both the transient and evolutionary changes that arise in integrated networks. A new algorithm was developed, hybrid weighted routing, that adapts to workload changes.

Reed, Daniel A.↗

DOE OSTI2023

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗

NASA NTRS1987

On Motion Planning and Control of Multi-Link Lightweight Robotic Manipulators

A general gross and fine motion planning and control strategy is needed for lightweight robotic manipulator applications such as painting, welding, material handling, surface finishing, and spacecraft servicing. The control problem of lightweight manipulators is to perform fast, accurate, and robust motions despite the payload variations, structural flexibility, and other environmental disturbances. Performance of the rigid manipulator model based computed torque and decoupled joint control methods are determined and simulated for the counterpart flexible manipulators. A counterpart flexible manipulator is defined as a manipulator which has structural flexibility, in addition to having the same inertial, geometric, and actuation properties of a given rigid manipulator. An adaptive model following control (AMFC) algorithm is developed to improve the performance in speed, accuracy, and robustness. It is found that the AMFC improves the speed performance by a factor of two over the conventional non-adaptive control methods for given accuracy requirements while proving to be more robust with respect to payload variations. Yet there are clear limitations on the performance of AMFC alone as well, which are imposed by the arm flexibility. In the search to further improve speed performance while providing a desired accuracy and robustness, a combined control strategy is developed. Furthermore, the problem of switching from one control structure to another during the motion and implementation aspects of combined control are discussed.

Cetinkunt, Sabri↗

DOE OSTI2025

Preserving nonlinear constraints in variational flow filtering data assimilation

Data assimilation aims to estimate the states of a dynamical system by optimally combining sparse and noisy observations of the physical system with uncertain forecasts produced by a computational model. The states of many dynamical systems of interest obey nonlinear physical constraints, and the corresponding dynamics is confined to a certain sub-manifold of the state space. Standard data assimilation techniques applied to such systems yield posterior states lying outside the manifold, violating the physical constraints. This work focuses on particle flow filters which use stochastic differential equations to evolve state samples from a prior distribution to samples from an observation-informed posterior distribution. The variational Fokker-Planck (VFP)—a generic particle flow filtering framework—is extended to incorporate non-linear, equality state constraints in the analysis. To this end, two algorithmic approaches that modify the VFP stochastic differential equation are discussed: (i) VFPSTAB, to inexactly preserve constraints with the addition of a stabilizing drift term, and (ii) VFPDAE, to exactly preserve constraints by treating the VFP dynamics as a stochastic differential-algebraic equation (SDAE). Additionally, an implicit-explicit time integrator is developed to evolve the VFPDAE dynamics. The strength of the proposed approach for constraint preservation in data assimilation is demonstrated on three test problems: the double pendulum, Korteweg-de-Vries, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Learning Grain-Boundary Segregation: From First Principles to Polycrystals

The segregation of solute atoms at grain boundaries (GBs) can strongly impact the structural and functional properties of polycrystals. Yet, due to the limited availability of simulation tools to study polycrystals at the atomistic scale (i.e., interatomic potentials), there is a minimal understanding of the variation of solute segregation tendencies across the very complex space of GB microenvironments and the large range of alloys in which it can occur. Here, we develop an algorithmic framework that can directly learn the full spectrum of segregation energies for a metal solute atom in a metal polycrystal from ab initio methods, bypassing the need for alloy interatomic potentials. This framework offers a pathway to a comprehensive catalog of GB solute segregation with quantum accuracy, for the entire alloy space. As an initial demonstration in this pursuit, we build an extensive GB segregation database for aluminum-based alloys across the periodic table, including dozens of alloys for which there are substantially no prior data.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2025

Towards a Quantum Algorithm for the Incompressible Nonlinear Navier-Stokes Equations

In this work, we present novel concepts for quantum algorithms to solve transient, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the incompressible Navier-Stokes equations as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts solving nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. We propose a new framework based on matrix product states (MPSs) and matrix product operators (MPOs), in addition to the Krylov subspace methods. For example, the solution variables of the Navier-Stokes equations are represented by MPSs, and the linear and nonlinear terms are processed by MPOs. The time evolution of the operators is attained by a fast-forwarding algorithm using Krylov subspace methods. Furthermore, we discuss various techniques for efficient encoding of MPSs, measurement reduction for MPOs, and use of tensor operations to treat multi-variate, multi-physics characteristics of Navier-Stokes.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗

DOE OSTI2025

Sensitive detection of structural dynamics using a statistical framework for comparative crystallography

Chemical and conformational changes are crucial to protein function and its pharmacological control. X-ray crystallography can reveal these changes in atomic detail, but standard analysis methods, which refine separate datasets, often overlook differences that are subtle or arise in only a subset of molecules. Direct comparison of crystallographic datasets is, in principle, more powerful, but systematic errors (“scales”) often mask changes in the crystallographic observables (“structure factors”). Machine learning algorithms that jointly estimate scales and structure factors can address this limitation. Here, we augment this approach with multivariate, structured priors derived from crystallographic theory, implemented in the variational deep learning framework Careless. Doing so strongly improves the detection of protein dynamics, element-specific anomalous signals, and the binding of drug candidates, offering a robust approach to comparative crystallography and, potentially, to detection of protein dynamics by other structure determination methods.

Hekstra, Doeke R. [Harvard Univ., Cambridge, MA (U↗

DOE OSTI2025

Designing an Optimal Sensor Network via Minimizing Information Loss

Optimal experimental design is a classic topic in statistics, with many well-studied problems, applications, and solutions. The design problem we study is the placement of sensors to monitor spatiotemporal processes, explicitly accounting for the temporal dimension in our modeling and optimization. We observe that recent advancements in computational sciences often yield large datasets based on physics-based simulations, which are rarely leveraged in experimental design. We introduce a novel model-based sensor placement criterion, along with a highly-efficient optimization algorithm, which integrates physics-based simulations and Bayesian experimental design principles to identify sensor networks that “minimize information loss” from simulated data. Our technique relies on sparse variational inference and (separable) Gauss-Markov priors, and thus may adapt many techniques from Bayesian experimental design. We validate our method through a case study monitoring air temperature in Phoenix, Arizona, using state-of-the-art physics-based simulations. Our results show our framework to be superior to random or quasi-random sampling, particularly with a limited number of sensors. We conclude by discussing practical considerations and implications of our framework, including more complex modeling tools and real-world deployments.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS1974

A fast-initializing digital equalizer with on-line tracking for data communications

A theory is developed for a digital equalizer for use in reducing intersymbol interference (ISI) on high speed data communications channels. The equalizer is initialized with a single isolated transmitter pulse, provided the signal-to-noise ratio (SNR) is not unusually low, then switches to a decision directed, on-line mode of operation that allows tracking of channel variations. Conditions for optimal tap-gain settings are obtained first for a transversal equalizer structure by using a mean squared error (MSE) criterion, a first order gradient algorithm to determine the adjustable equalizer tap-gains, and a sequence of isolated initializing pulses. Since the rate of tap-gain convergence depends on the eigenvalues of a channel output correlation matrix, convergence can be improved by making a linear transformation on to obtain a new correlation matrix.

Houts, R. C.↗

NASA NTRS1991

Guidance and control analysis of the entry of a lifting body personnel launch vehicle

NASA is currently involved in definition studies of a Personnel Launch System (PLS) that could be used to transport people to and from low-earth orbit. This vehicle would serve both to complement the Space Shuttle and to provide alternative access to space in the event the Space Shuttle fleet were unavailable for a prolonged period. The PLS would consist of a manned spacecraft launched by an expendable vehicle, e.g., Titan 4. One promising candidate for the manned component of the PLS is the NASA Langley Research Center HL-20 lifting body. Many studies are currently underway to assess this vehicle, and one of the main areas of study is the development of the capability to successfully enter, glide to the landing site, and land. To provide this capability, guidance and control algorithms have been developed, incorporated into a six-degree-of-freedom simulation, and evaluation in the presence of off-nominal atmospheric conditions, consisting of both density variations and steady-state winds. In addition, the impact of atmospheric turbulence was examined for the portion of flight from Mach 3.5 to touchdown. This analysis showed that the vehicle remained controllable and could successfully land even in the presence of off-nominal atmospheric conditions.

Powell, Richard W.↗

NASA NTRS2002

Parametric Study of a YAV-8B Harrier in Ground Effect using Time-Dependent Navier-Stokes Computations

A process is described which enables the generation of 35 time-dependent viscous solutions for a YAV-8B Harrier in ground effect in one week. Overset grids are used to model the complex geometry of the Harrier aircraft and the interaction of its jets with the ground plane and low-speed ambient flow. The time required to complete this parametric study is drastically reduced through the use of process automation, modern computational platforms, and parallel computing. Moreover, a dual-time-stepping algorithm is described which improves solution robustness. Unsteady flow visualization and a frequency domain analysis are also used to identify and correlated key flow structures with the time variation of lift.

Pandya, Shishir↗