Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive algorithm”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
DOE OSTI2024

Demonstrating the Potential of Adaptive LMS Filtering on FPGA-Based Qubit Control Platforms for Improved Qubit Readout in 2D and 3D Quantum Processing Units

Advancements in quantum computing underscore the critical need for sophisticated qubit readout techniques to accurately discern quantum states. This abstract presents our research intended for optimizing readout pulse fidelity for 2D and 3D Quantum Processing Units (QPUs), the latter coupled with Superconducting Radio Frequency (SRF) cavities. Focusing specifically on the application of the Least Mean Squares (LMS) adaptive filtering algorithm, we explore its integration into the FPGA-based control systems to enhance the accuracy and efficiency of qubit state detection by improving Signal-to-Noise Ratio (SNR). Implementing the LMS algorithm on the Zynq UltraScale+ RFSoC Gen 3 devices (RFSoC 4x2 FPGA and ZCU216 FPGA) using the Quantum Instrumentation Control Kit (QICK) open-source platform, we aim to dynamically test and adjust the filtering parameters in real-time to characterize and adapt to the noise profile presented in quantum computing readout signals. Our preliminary results demonstrate the LMS filter's capability to maintain high readout accuracy while efficiently managing FPGA resources. These findings are expected to contribute to developing more reliable and scalable quantum computing architectures, highlighting the pivotal role of adaptive signal processing in quantum technology advancements.

Johnson, Hans↗
DOE OSTI2024

Demonstrating the Potential of Adaptive LMS Filtering on FPGA-Based Qubit Control Platforms for Improved Qubit Readout in 2D and 3D Quantum Processing Units

Advancements in quantum computing underscore the critical need for sophisticated qubit readout techniques to accurately discern quantum states. This abstract presents our research intended for optimizing readout pulse fidelity for 2D and 3D Quantum Processing Units (QPUs), the latter coupled with Superconducting Radio Frequency (SRF) cavities. Focusing specifically on the application of the Least Mean Squares (LMS) adaptive filtering algorithm, we explore its integration into the FPGA-based control systems to enhance the accuracy and efficiency of qubit state detection by improving Signal-to-Noise Ratio (SNR). Implementing the LMS algorithm on the Zynq UltraScale+ RFSoC Gen 3 devices (RFSoC 4x2 FPGA and ZCU216 FPGA) using the Quantum Instrumentation Control Kit (QICK) open-source platform, we aim to dynamically test and adjust the filtering parameters in real-time to characterize and adapt to the noise profile presented in quantum computing readout signals. Our preliminary results demonstrate the LMS filter's capability to maintain high readout accuracy while efficiently managing FPGA resources. These findings are expected to contribute to developing more reliable and scalable quantum computing architectures, highlighting the pivotal role of adaptive signal processing in quantum technology advancements.

Johnson, Hans↗
DOE OSTI2022

Nonlinear burn control in ITER using adaptive allocation of actuators with uncertain dynamics

Abstract ITER will be the first tokamak to sustain a fusion-producing, or burning, plasma. If the plasma temperature were to inadvertently rise in this burning regime, the positive correlation between temperature and the fusion reaction rate would establish a destabilizing positive feedback loop. Careful regulation of the plasma’s temperature and density, or burn control, is required to prevent these potentially reactor-damaging thermal excursions, neutralize disturbances and improve performance. In this work, a Lyapunov-based burn controller is designed using a full zero-dimensional nonlinear model. An adaptive estimator manages destabilizing uncertainties in the plasma confinement properties and the particle recycling conditions (caused by plasma–wall interactions). The controller regulates the plasma density with requests for deuterium and tritium particle injections. In ITER-like plasmas, the fusion-born alpha particles will primarily heat the plasma electrons, resulting in different electron and ion temperatures in the core. By considering separate response models for the electron and ion energies, the proposed controller can independently regulate the electron and ion temperatures by requesting that different amounts of auxiliary power be delivered to the electrons and ions. These two commands for a specific control effort (electron and ion heating) are sent to an actuator allocation module that optimally maps them to the heating actuators available to ITER: an electron cyclotron heating system (20 MW), an ion cyclotron heating system (20 MW), and two neutral beam injectors (16.5 MW each). Two different actuator allocators are presented in this work. The first actuator allocator finds the optimal mapping by solving a convex quadratic program that includes actuator saturation and rate limits. It is nonadaptive and assumes that the mapping between the commanded control efforts and the allocated actuators (i.e. the effector model) contains no uncertainties. The second actuator allocation module has an adaptive estimator to handle uncertainties in the effector model. This uncertainty includes actuator efficiencies, the fractions of neutral beam heating that are deposited into the plasma electrons and ions, and the tritium concentration of the fueling pellets. Furthermore, the adaptive allocator considers actuator dynamics (actuation lag) that contain uncertainty. This adaptive allocation algorithm is more computationally efficient than the aforementioned nonadaptive allocator because it is computed using dynamic update laws so that finding the solution to a static optimization problem is not required at every time step. A simulation study assesses the performance of the proposed adaptive burn controller augmented with each of the actuator allocation modules.

Physics↗
DOE OSTI2022

A combined experimental and numerical approach that eliminates the non-uniqueness associated with the Johnson-Cook parameters obtained using inverse methods

Abstract Johnson-Cook constitutive model is a commonly used material model for machining simulations. The model includes five parameters that capture the initial yield stress, strain-hardening, strain-rate hardening, and thermal softening behavior of the material. These parameters are difficult to determine using experiments since the conditions observed during machining (such as high strain-rates of the order of $$10^5$$ 10 5 /sec - $$10^6$$ 10 6 /sec) are challenging to recreate in the laboratory. To address this problem, several researchers have recently proposed inverse approaches where a combination of experiments and analytical models are used to predict the Johnson-Cook parameters. The errors between the measured cutting forces, chip thicknesses and temperatures and those predicted by analytical models are minimized and the parameters are determined. In this work, it is shown that only two of the five Johnson-Cook parameters can be determined uniquely using inverse approaches. Two different algorithms, namely, Adaptive Memory Programming for Global Optimization (AMPGO) and Particle Swarm Optimization (PSO), are used for this purpose. The extended Oxley’s model is used as the analytical tool for optimization. For determining a parameter’s value, a large range for each parameter is provided as an input to the algorithms. The algorithms converge to several different sets of values for the five Johnson-Cook parameters when all the five parameters are considered as unknown in the optimization algorithm. All of these sets, however, yield the same chip shape and cutting forces in FEM simulations. Further analyses show that only the strain-rate and thermal softening parameters can be determined uniquely and the three parameters present in the strain-hardening term of the Johnson-Cook model cannot be determined uniquely using the inverse method. A combined experimental and numerical approach is proposed to eliminate this determine all parameters uniquely.

42 ENGINEERING↗
DOE OSTI2026

Efficient Berry phase calculation via adaptive variational quantum computing approach

We present an adaptive variational quantum algorithm to estimate the Berry phase accumulated by a nondegenerate ground state under cyclic, adiabatic evolution of a time-dependent Hamiltonian. Our method leverages cyclic adiabatic evolution of the Hamiltonian and employs adaptive variational quantum algorithms for state preparation and evolution, optimizing circuit efficiency while maintaining high accuracy. We benchmark our approach on dimerized Fermi–Hubbard chains with four sites, demonstrating precise Berry phase simulations in both noninteracting and interacting regimes. Our results show that circuit depths reach up to 106 layers for noninteracting systems and increase to 279 layers for interacting systems due to added complexity. In addition, we demonstrate the robustness of our scheme across a wide range of parameters governing adiabatic evolution and variational algorithms. These findings highlight the potential of adaptive variational quantum algorithms for advancing quantum simulations of topological materials and computing geometric phases in strongly correlated systems.

Mootz, Martin [Ames Laboratory (AMES), Ames, IA (U↗
DOE OSTI2025

Dynamic Modeling of a Kaplan Hydroturbine Using Optimal Parametric Tuning and Real Plant Operational Data

To address grid variability caused by renewable energy integration and to maintain grid reliability and resilience, hydropower must quickly adjust its power generation over short time periods. This changing energy generation landscape requires advance technology integration and adaptive parameter optimization for hydropower systems via digital twin effort. However, this is difficult owing to the lack of characterization and modeling for the nonlinear nature of hydroturbines. To solve this issue, this paper first formulates a six-coefficient Kaplan hydroturbine model and then proposes a parametric optimization tuning framework based on the Nelder–Mead algorithm for adaptive dynamic learning of the six-coefficients so as to build models that describe the turbine. To assess the performance of the proposed optimal parametric tuning technique, operational data from a real-world Kaplan hydroturbine unit are collected and used to model the relationship between the gate opening and the generated power production. The findings show that the proposed technique can effectively and adaptively learn the unknown dynamics of the Kaplan hydroturbine while optimally tune the unknown coefficients to match the generated power output from the real hydroturbine unit with an inaccuracy of less than 5%. The method can be used to provides optimal tuning of parameters critical for controller design, operational optimization and daily maintenance for hydroturbines in general.

13 HYDRO ENERGY↗
DOE OSTI2021

A scalable algorithm for the optimization of neural network architectures

In this work, we propose a new scalable method to optimize the architecture of an artificial neural network. The proposed algorithm, called Greedy Search for Neural Network Architecture, aims to determine a neural network with minimal number of layers that is at least as performant as neural networks of the same structure identified by other hyperparameter search algorithms in terms of accuracy and computational cost. Numerical results performed on benchmark datasets show that, for these datasets, our method outperforms state-of-the-art hyperparameter optimization algorithms in terms of attainable predictive performance by the selected neural network architecture, and time-to-solution for the hyperparameter optimization to complete.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Improving the accuracy and efficiency of quantum connected moments expansions

The still-maturing noisy intermediate-scale quantum technology faces strict limitations on the algorithms that can be implemented efficiently. In the realm of quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous, with many variations. Alternatively, a promising new avenue has been unraveled by the quantum variants of techniques grounded on expansions of the moments of the Hamiltonian, notably the connected moments expansion (CMX) and the Peeters–Devreese–Soldatov (PDS) energy functional. Common to those approaches is that, upon preparing an approximate ground state used to compute the necessary moments, the accuracy of the estimated ground state energy depends on the degree of overlap between the prepared state and the true ground state. Thus, we use the ADAPT-VQE algorithm to test shallow circuit construction strategies for the purpose of increasing the overlap with the exact ground state, validated by the sizable accuracy improvement herein reported in the PDS and CMX ground state energies. We also show that we can take advantage of the fact that the terms to be measured are highly recurring in different moments, incurring a substantial reduction in the number of necessary measurements. Finally, by coupling this measurement caching with a threshold that determines whether a given term is to be measured based on its associated scalar coefficient, we observe a further reduction in the number of circuit implementations while allowing for tunable accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Improved Localization Precision and Angular Resolution of a Cylindrical, Time-Encoded Imaging System From Adaptive Detector Movements

To the first order, the localization precision and angular resolution of a cylindrical, time-encoded imaging (c-TEI) system is governed by the geometry of the system. Improving either measure requires increasing the mask radius or decreasing the detector diameter, both of which are undesirable. Here, we propose an alternative option of repositioning the detector within the mask to increase the detector-to-mask distance in the direction of a source, thereby improving the localization precision and angular resolution in that direction. Since the detector-to-mask distance only increases for a small portion of the field of view (FOV), we propose implementing adaptive imaging where one leverages data collected during the measurement to optimize the system configuration. This article utilizes both simulations and experiments to set upper bounds on the potential gain from adaptive detector movements for one and two sources in the FOV. When only one source is present, adaptive detector movements can improve the localization precision and angular resolution by 20% for a source at 90 cm and by 32% for a far-field source. When two sources are present, adaptive detector movements can improve localization precision and angular resolution by up to 50% for sources that are ~10° apart (90 cm from the system). We experimentally verify these results through maximum likelihood estimation of the source position(s) and image reconstruction of point sources that are close together. As a demonstration of an adaptive imaging algorithm, we image a complex arrangement of special nuclear material at the Zero Power Physics Reactor facility at Idaho National Laboratory.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Mid-IR UAV-based sensing platform with deep learning to Identify and Quantify Gaseous Emission in Gas Flares

This report details the development and evaluation of a Mid-Infrared (Mid-IR) Unmanned Aerial Vehicle (UAV)-based sensing platform integrated with deep learning algorithms for the identification and quantification of gaseous emissions in gas flares. The project, spearheaded by Omega Optics, Inc., aimed to address environmental monitoring challenges by leveraging advanced photonic technologies and autonomous UAV operations. The research focused on designing, optimizing, and fabricating photonic crystal waveguides and grating couplers to enhance the sensitivity and accuracy of gas detection. A comprehensive drone-based system was developed, featuring a miniaturized sensor, GPS module, and microcontroller communication network for real-time gas concentration monitoring. The system's adaptive sampling algorithm, implemented using the Robot Operating System (ROS), enables autonomous detection and localization of gas emission sources. Preliminary results demonstrate the platform's capability to detect and monitor gas emissions with high precision, cost-effectiveness, and scalability. Future work will expand upon this foundation by introducing 3D wind model-based learning for dynamic environmental conditions and further enhancing the user interface and data processing algorithms to support broader environmental monitoring applications. Overall, this project represents a significant step forward in UAV-based environmental sensing technologies, offering robust solutions for detecting and mitigating the impacts of gaseous emissions on public health and safety.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

A resolution independent neural operator

The Deep operator network (DeepONet) is a powerful yet simple neural operator architecture that utilizes two deep neural networks to learn mappings between infinite-dimensional function spaces. This architecture is highly flexible, allowing the evaluation of the solution field at any location within the desired domain. However, it imposes a strict constraint on the input space, requiring all input functions to be discretized at the same locations; this limits its practical applications. Here, in this work, we introduce a general framework for operator learning from input–output data with arbitrary number and locations of sensors. This begins by introducing a resolution-independent DeepONet (RI-DeepONet), enabling it to handle input functions that are arbitrarily, but sufficiently finely, discretized. To this end, we propose two dictionary learning algorithms to adaptively learn a set of appropriate continuous basis functions, parameterized as implicit neural representations (INRs), from correlated signals defined on arbitrary point cloud data. These basis functions are then used to project arbitrary input function data as a point cloud onto an embedding space (i.e., a vector space of finite dimensions) with dimensionality equal to the dictionary size, which can be directly used by DeepONet without any architectural changes. In particular, we utilize sinusoidal representation networks (SIRENs) as trainable INR basis functions. The introduced dictionary learning algorithms are then used in a similar way to learn an appropriate dictionary of basis functions for the output function data, which defines a new neural operator architecture referred to as the R esolution I ndependent N eural O perator (RINO). In the RINO, the operator learning task simplifies to learning a mapping from the coefficients of input basis functions to the coefficients of output basis functions. We demonstrate the robustness and applicability of RINO in handling arbitrarily (but sufficiently richly) sampled input and output functions during both training and inference through several numerical examples.

Deep operator network (DeepONet)↗
DOE OSTI2021

Are Remote Sensing Evapotranspiration Models Reliable Across South American Ecoregions?

Many remote sensing-based evapotranspiration (RSBET) algorithms have been proposed in the past decades and evaluated using flux tower data, mainly over North America and Europe. Model evaluation across South America has been done locally or using only a single algorithm at a time. Here, in this work, we provide the first evaluation of multiple RSBET models, at a daily scale, across a wide variety of biomes, climate zones, and land uses in South America. We used meteorological data from 25 flux towers to force four RSBET models: Priestley–Taylor Jet Propulsion Laboratory (PT-JPL), Global Land Evaporation Amsterdam Model (GLEAM), Penman–Monteith Mu model (PM-MOD), and Penman–Monteith Nagler model (PM-VI). ET was predicted satisfactorily by all four models, with correlations consistently higher (R 2 > 6) for GLEAM and PT-JPL, and PM-MOD and PM-VI presenting overall better responses in terms of percent bias (-10 < PBIAS < 10%). As for PM-VI, this outcome is expected, given that the model requires calibration with local data. Model skill seems to be unrelated to land-use but instead presented some dependency on biome and climate, with the models producing the best results for wet to moderately wet environments. Our findings show the suitability of individual models for a number of combinations of land cover types, biomes, and climates. At the same time, no model outperformed the others for all conditions, which emphasizes the need for adapting individual algorithms to take into account intrinsic characteristics of climates and ecosystems in South America.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Bridging Experiment and Theory to Reveal Compounds in K–Zn(Cd)–Bi Systems

This study investigates the facile hydride synthesis method guided by theoretical predictions to explore the K–T–Bi (T = Zn, Cd) phase spaces. Using an adaptive genetic algorithm (AGA) and density functional theory (DFT), candidate compositions are identified for experimental validation via a facile hydrides route, permitting experimental screening of K–Zn–Bi and “empty” K–Cd–Bi systems. The previously reported KZnBi and KZn 2 Bi 2 are synthesized alongside newly discovered KCdBi and KCd 2 Bi 2 . While the AGA and DFT predict the stability of these compounds, structural predictions align with the experiment only for KZnBi and KZn 2 Bi 2 . Single-crystal X-ray structure refinements confirm that KZnBi and KZn 2 Bi 2 adopt the hexagonal ZrBeSi- and tetragonal ThCr 2 Si 2 -structure types, respectively. KCdBi has tetragonal PbClF-structure type and KCd 2 Bi 2 belongs to the ThCr 2 Si 2 -structure type. A trend based on the ratio of the metal ionic radii allows to rationalize variation in the structure types within the ATBi family (A = Li–Cs), correctly identifying KCdBi as isostructural to NaZnBi. Thermal stability studied by high-temperature powder X-ray diffraction reveals that Zn-containing compounds melt at higher temperatures (821 K for KZn 2 Bi 2 ) than Cd-containing KCd 2 Bi 2 (635 K). This study highlights the efficacy of combining rapid synthesis techniques with predictive modeling, though structural predictions show some limitations in accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Machine learning for arbitrary single-qubit rotations on an embedded device

Here, in this study, we present a technique for using machine learning (ML) for single-qubit gate synthesis on field-programmable logic for a superconducting transmon-based quantum computer based on simulated studies. Our approach is multi-stage. We first “bootstrap” a model based on simulation with access to the full state vector for measuring gate fidelity. We next present an algorithm, named adapted randomized benchmarking (ARB), for fine-tuning the gate on hardware based on measurements of the devices. We also present techniques for deploying the model on programmable devices with care to reduce the required resources. While the techniques here are applied to a transmon-based computer, many of them are portable to other architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Probabilistic Context Neighborhood model for lattices

Here we present the Probabilistic Context Neighborhood model designed for two-dimensional lattices as a variation of a Markov random field assuming discrete values. In this model, the neighborhood structure has a fixed geometry but a variable order, depending on the neighbors’ values. Our model extends the Probabilistic Context Tree model, originally applicable to one-dimensional space. It retains advantageous properties, such as representing the dependence neighborhood structure as a graph in a tree format, facilitating an understanding of model complexity. Furthermore, we adapt the algorithm used to estimate the Probabilistic Context Tree to estimate the parameters of the proposed model. We illustrate the accuracy of our estimation methodology through simulation studies. Additionally, we apply the Probabilistic Context Neighborhood model to spatial real-world data, showcasing its practical utility.

97 MATHEMATICS AND COMPUTING↗