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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Testing Surrogate-Based Optimization with the Fortified Branin-Hoo Extended to Four Dimensions

Some popular functions used to test global optimization algorithms have multiple local optima, all with the same value, making them all global optima. It is easy to make them more challenging by fortifying them via adding a localized bump at the location of one of the optima. In previous work the authors illustrated this for the Branin-Hoo function and the popular differential evolution algorithm, showing that the fortified Branin-Hoo required an order of magnitude more function evaluations. This paper examines the effect of fortifying the Branin-Hoo function on surrogate- based optimization, which usually proceeds by adaptive sampling. Two algorithms are considered. The EGO algorithm, which is based on a Gaussian process (GP) and an algorithm based on radial basis functions (RBF). EGO is found to be more frugal in terms of the number of required function evaluations required to identify the correct basin, but it is expensive to run on a desktop, limiting the number of times the runs could be repeated to establish sound statistics on the number of required function evaluations. The RBF algorithm was cheaper to run, providing more sound statistics on performance. A four-dimensional version of the Branin-Hoo function was introduced in order to assess the effect of dimensionality. Furthermore, it was found that the difference between the ordinary function and the fortified one was much more pronounced for the four-dimensional function compared to the two dimensional one.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Energy-Efficient Adaptive Cruise Control Using Eco-Driving Algorithm

SwRI Eco-Driving Algorithm – Objectives and Method – Required Information Streams and Velocity Profile Realization ▪ Impact on Energy Consumption – Study 1 – NEXTCAR II • Individual (ego/eco) vehicle on Blanco Road, San Antonio, TX – Study 2 – DOE EEMS • Entire Urban Corridor – N High Street, Columbus, OH

Bhagdikar, Piyush↗
DOE OSTI2024

Statistically Resolved Planetary Boundary Layer Height Diurnal Variability Using Spaceborne Lidar Data

The Planetary Boundary Layer Height (PBLH) significantly impacts weather, climate, and air quality. Understanding the global diurnal variation of the PBLH is particularly challenging due to the necessity of extensive observations and suitable retrieval algorithms that can adapt to diverse thermodynamic and dynamic conditions. This study utilized data from the Cloud-Aerosol Transport System (CATS) to analyze the diurnal variation of PBLH in both continental and marine regions. By leveraging CATS data and a modified version of the Different Thermo-Dynamics Stability (DTDS) algorithm, along with machine learning denoising, the study determined the diurnal variation of the PBLH in continental mid-latitude and marine regions. The CATS DTDS-PBLH closely matches ground-based lidar and radiosonde measurements at the continental sites, with correlation coefficients above 0.6 and well-aligned diurnal variability, although slightly overestimated at nighttime. In contrast, PBLH at the marine site was consistently overestimated due to the viewing geometry of CATS and complex cloud structures. The study emphasizes the importance of integrating meteorological data with lidar signals for accurate and robust PBLH estimations, which are essential for effective boundary layer assessment from satellite observations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Advances in Machine and Deep Learning for Modeling and Real-time Detection of Multi-Messenger Sources

We live in momentous times. The science community is empowered with an arsenal of cosmic messengers to study the universe in unprecedented detail. Gravitational waves, electromagnetic waves, neutrinos, and cosmic rays cover a wide range of wavelengths and timescales. Combining and processing these datasets that vary in volume, speed, and dimensionality requires new modes of instrument coordination, funding, and international collaboration with a specialized human and technological infrastructure. In tandem with the advent of large-scale scientific facilities, the last decade has experienced an unprecedented transformation in computing and signal-processing algorithms. The combination of graphics processing units, deep learning, and the availability of open source, high-quality datasets has powered the rise of artificial intelligence. This digital revolution now powers a multibillion dollar industry, with far-reaching implications in technology and society. In this chapter, we describe pioneering efforts to adapt artificial intelligence algorithms to address computational grand challenges in multi-messenger astrophysics. We review the rapid evolution of these disruptive algorithms, from the first class of algorithms introduced in early 2017 to the sophisticated algorithms that now incorporate domain expertise in their architectural design and optimization schemes. We discuss the importance of scientific visualization and extreme-scale computing in reducing time-to-insight and obtaining new knowledge from the interplay between models and data.

Artificial Intelligence↗
DOE OSTI2022

Deep reaction network exploration at a heterogeneous catalytic interface

Characterizing the reaction energies and barriers of reaction networks is central to catalyst development. However, heterogeneous catalytic surfaces pose several unique challenges to automatic reaction network characterization, including large sizes and open-ended reactant sets, that make ad hoc network construction the current state-of-the-art. Here, we show how automated network exploration algorithms can be adapted to the constraints of heterogeneous systems using ethylene oligomerization on silica-supported single-site Ga 3+ as a model system. Using only graph-based rules for exploring the network and elementary constraints based on activation energy and size for identifying network terminations, a comprehensive reaction network is generated and validated against standard methods. The algorithm (re)discovers the Ga-alkyl-centered Cossee-Arlman mechanism that is hypothesized to drive major product formation while also predicting several new pathways for producing alkanes and coke precursors. These results demonstrate that automated reaction exploration algorithms are rapidly maturing towards general purpose capability for exploratory catalytic applications.

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

Application of Thévenin equivalent sensitivity equations for reliable voltage stability assessment

In this paper, sensitivity equations for the Thévenin equivalent parameters, voltage and reactance, are derived using the duality between the Thévenin parameters from two consecutive PMU measurements. Using the sensitivity equation for the Thévenin reactance, a robust adaptive X-Th algorithm is developed aiming to extend a well-known adaptive E-Th approach by being able to accurately estimate the parameters for a wider range of loading conditions. In the performed case studies the resulting accuracy is evaluated when estimating the Thévenin parameters for large disturbances, for two sides with respect to a boundary bus, accommodating sensitivity to topology changes and nonlinearities in power systems. In conclusion, the results can be used for accurate voltage stability assessment using the Thévenin parameters.

42 ENGINEERING↗
DOE OSTI2025

Track reconstruction as a service for collider physics

Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa.TrkX, a machine learning-based algorithm. The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Alignment of the CLAS12 central hybrid tracker with a Kalman Filter

Several factors can contribute to the difficulty of aligning the sensors of tracking detectors, including a large number of modules, multiple types of detector technologies, and non-linear strip patterns on the sensors. All three of these factors apply to the CLAS12 CVT, which is a hybrid detector consisting of planar silicon sensors with non-parallel strips, and cylindrical micromegas sensors with longitudinal and arc-shaped strips located within a 5 T superconducting solenoid. To align this detector, we used the Kalman Alignment Algorithm, which accounts for correlations between the alignment parameters without requiring the time-consuming inversion of large matrices. This is the first time that this algorithm has been adapted for use with hybrid technologies, non-parallel strips, and curved sensors. We present the results for the first alignment of the CLAS12 CVT using straight tracks from cosmic rays and from a target with the magnetic field turned off. After running this procedure, we achieved alignment at the level of 10 µm, and the widths of the residual spectra were greatly reduced. These results attest to the flexibility of this algorithm and its applicability to future use in the CLAS12 CVT and other hybrid or curved trackers, such as those proposed for the future Electron-Ion Collider.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Virtual to Physical: Reinforcement Learning to Optimize SNS Particle Accelerator Controls

Complex accelerators must have control systems that can handle dynamic nonlinear environments. This makes traditional control methods unsuitable as they can struggle to adapt to these uncertainties. This provides an ideal environment for reinforcement learning algorithms as they are adaptable and generalizable. We present a reinforcement learning pipeline that can effectively handle the dynamics of a complex accelerator. We test and prove our pipelines capabilities on multiple environments including the Spallation Neutron Source (SNS) and the Beam Test Facility (BTF) at Oakridge National Lab (ORNL). Due to the limited time available to train an online algorithm like reinforcement learning on a real accelerator, we utilize a virtual twin accelerator (VIRAC) developed by ORNL to pretrain the policy and show its ability to converge in the virtual environment. We then test the adaptability of the pretrained RL model by applying it on the real accelerator and comparing the results. Utilizing our Scientific Optimization and Controls Toolkit (SOCT) and open-source standards such as Gymnasium we create and solve for a MEBT orbit correction problem in the SNS and an emittance maximization problem in the BTF. We show how Twin Delayed Deep Deterministic Policy Gradient (TD3) can solve this optimization environment in the virtual accelerator and transfer this policy onto the real accelerator for inference and model retraining. We show how reinforcement learning can be utilized as a control system for complex accelerators and provide a model pipeline for how an implementation performs and can be adapted to new accelerator control problems.

Kasparian, Armen [Thomas Jefferson National Accele↗
DOE OSTI2021

Efficient exascale discretizations: High-order finite element methods

Efficient exploitation of exascale architectures requires rethinking of the numerical algorithms used in many large-scale applications. These architectures favor algorithms that expose ultra fine-grain parallelism and maximize the ratio of floating point operations to energy intensive data movement. One of the few viable approaches to achieve high efficiency in the area of PDE discretizations on unstructured grids is to use matrix-free/partially assembled high-order finite element methods, since these methods can increase the accuracy and/or lower the computational time due to reduced data motion. In this paper we provide an overview of the research and development activities in the Center for Efficient Exascale Discretizations (CEED), a co-design center in the Exascale Computing Project that is focused on the development of next-generation discretization software and algorithms to enable a wide range of finite element applications to run efficiently on future hardware. CEED is a research partnership involving more than 30 computational scientists from two US national labs and five universities, including members of the Nek5000, MFEM, MAGMA and PETSc projects. We discuss the CEED co-design activities based on targeted benchmarks, miniapps and discretization libraries and our work on performance optimizations for large-scale GPU architectures. We also provide a broad overview of research and development activities in areas such as unstructured adaptive mesh refinement algorithms, matrix-free linear solvers, high-order data visualization, and list examples of collaborations with several ECP and external applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Timely Reporting of Heavy Hitters Using External Memory

Given an input stream S of size N, a Φ-heavy hitter is an item that occurs at least ΦN times in S. The problem of finding heavy-hitters is extensively studied in the database literature. In this work, we study a real-time heavy-hitters variant in which an element must be reported shortly after we see its T = Φ N-th occurrence (and hence it becomes a heavy hitter). We call this the Timely Event Detection (TED) Problem. The TED problem models the needs of many real-world monitoring systems, which demand accurate (i.e., no false negatives) and timely reporting of all events from large, high-speed streams with a low reporting threshold (high sensitivity). Like the classic heavy-hitters problem, solving the TED problem without false-positives requires large space (Ω (N) words). Thus in-RAM heavy-hitters algorithms typically sacrifice accuracy (i.e., allow false positives), sensitivity, or timeliness (i.e., use multiple passes). We show how to adapt heavy-hitters algorithms to external memory to solve the TED problem on large high-speed streams while guaranteeing accuracy, sensitivity, and timeliness. Our data structures are limited only by I/O-bandwidth (not latency) and support a tunable tradeoff between reporting delay and I/O overhead. With a small bounded reporting delay, our algorithms incur only a logarithmic I/O overhead. We implement and validate our data structures empirically using the Firehose streaming benchmark. Multi-threaded versions of our structures can scale to process 11M observations per second before becoming CPU bound. In comparison, a naive adaptation of the standard heavy-hitters algorithm to external memory would be limited by the storage device’s random I/O throughput, i.e., ≈100K observations per second.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Development and Validation of Quantitative Model-Based Image Reconstruction for NDE of Reinforced Steel-Lined Concrete Structures: Kal-El FY 2020

This project studied the capabilities of Model-Based Image Reconstruction (MBIR) and Machine Learning (ML) algorithms in the imaging and estimation of rebar corrosion from ultrasound signals. The application was challenging due to the introduction of a steel liner between the sensor and the concrete containing the rebar. The study focused in a synthetic specimen with a 6.35 mm thick steel liner, and a 19.05 mm diameter rebar at a depth of 44.5 mm and with four levels of corrosion; 0%, 20%, 50%, and 100% corrosion level. The corrosion was applied uniformly around the rebar, generating a ring in the perimeter of the rebar with different acoustic density. In order to generate a realistic synthetic dataset, we added random texture to the concrete of the synthetic specimens. This texture will mimic the variations encountered in real concrete specimens.We adapted our MBIR algorithm for the application and enhanced the algorithm to integrate in the physical model known specimen features, such as the steel liner thickness. The new MBIR method was able to cancel out reverberation from the steel liner and properly image the rebar. In particular, corrosion for the 50% and 100% cases were easily visible and quantitative metrics showed a slight separation for the 0% and 20% levels. The quantitative results were in agreement with the qualitative assessment. We also developed a ML XGBoost model to estimate corrosion level from the ultrasound signals. By combining the ML method with MBIR, we can pinpoint in the ultrasound signals the section that corresponds to the echoes from the rebar. The extract signals are processed by the XGBoost model for prediction. From each system scan, we obtain 15 predictions. The median prediction value is used as the final prediction. The True Acceptance Rate for the method is over 99%.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Adaptive Variational Quantum Computing Approaches for Green’s Functions and Nonlinear Susceptibilities

Here, we present and benchmark quantum computing approaches for calculating real-time single-particle Green’s functions and nonlinear susceptibilities of Hamiltonian systems. The approaches leverage adaptive variational quantum algorithms for state preparation and propagation. Using automatically generated compact circuits, the dynamical evolution is performed over sufficiently long times to achieve adequate frequency resolution of the response functions. We showcase accurate Green’s function calculations using a statevector simulator on classical hardware for Fermi-Hubbard chains of 4 and 6 sites, with maximal ansatz circuit depths of 65 and 424 layers, respectively, and for the molecule LiH with a maximal ansatz circuit depth of 81 layers. Additionally, we consider an antiferromagnetic quantum spin-1 model that incorporates the Dzyaloshinskii-Moriya interaction to illustrate calculations of the third-order nonlinear susceptibilities, which can be measured in two-dimensional coherent spectroscopy experiments. These results demonstrate that real-time approaches using adaptive parametrized circuits to evaluate linear and nonlinear response functions can be feasible with near-term quantum processors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗
DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗
DOE OSTI2022

Three-dimensional realizations of flood flow in large-scale rivers using the neural fuzzy-based machine-learning algorithms

Machine learning methods have been extensively used to study the dynamics of complex fluid flows. One such algorithm, known as adaptive neural fuzzy inference system (ANFIS), can generate data-driven predictions for flow fields, but has not been applied to natural geophysical flows in large-scale rivers. Herein, we demonstrate the potential of ANFIS to produce three-dimensional (3D) realizations of the instantaneous flood flow field in several large-scale, virtual meandering rivers. The 3D dynamics of flood flow in large-scale rivers were obtained using large-eddy simulation (LES). The LES results, i.e., the 3D velocity components, were employed to train the learnable coefficients of an ANFIS. Further, the trained ANFIS, along with a few time-steps of LES results (precursor data) were then used to produce 3D realizations of flood flow fields in large-scale rivers with geometries other than the one the ANFIS was trained with. We also used the trained ANFIS to generate 3D realizations of river flow at a discharge other than that the ANFIS was trained with. The flow field results obtained from ANFIS were validated using separate LES runs to assess the accuracy of the 3D instantaneous realizations of the machine learning algorithm. An error analysis was conducted to quantify the discrepancies among the ANFIS and LES results for various flood flow predictions in large-scale rivers.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Determining the N -Representability of a Reduced Density Matrix via Unitary Evolution and Stochastic Sampling

The N-representability problem consists in determining whether, for a given p-body matrix, there exists at least one N-body density matrix from which the p-body matrix can be obtained by contraction, that is, if the given matrix is a p-body reduced density matrix (p-RDM). The knowledge of all necessary and sufficient conditions for a p-body matrix to be N-representable allows the constrained minimization of a many-body Hamiltonian expectation value with respect to the p-body density matrix and, thus, the determination of its exact ground state. However, the number of constraints that complete the N-representability conditions grows exponentially with system size, and hence, the procedure quickly becomes intractable for practical applications. This work introduces a hybrid quantum-stochastic algorithm to effectively replace the N-representability conditions. The algorithm consists of applying to an initial N-body density matrix a sequence of unitary evolution operators constructed from a stochastic process that successively approaches the reduced state of the density matrix on a p-body subsystem, represented by a p-RDM, to a target p-body matrix, potentially a p-RDM. The generators of the evolution operators follow the well-known adaptive derivative-assembled pseudo-Trotter method (ADAPT), while the stochastic component is implemented by using a simulated annealing process. The resulting algorithm is independent of any underlying Hamiltonian, and it can be used to decide whether a given p-body matrix is N-representable, establishing a criterion to determine its quality and correcting it. We apply the proposed hybrid ADAPT algorithm to alleged reduced density matrices from a quantum chemistry electronic Hamiltonian, from the reduced Bardeen–Cooper–Schrieffer model with constant pairing, and from the Heisenberg XXZ spin model. In all cases, the proposed method behaves as expected for 1-RDMs and 2-RDMs, evolving the initial matrices toward different targets.

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

SPEARS: A Database-Invariant Spectral modeling API

The Spectral Physics Environment for Advanced Remote Sensing (SPEARS) application programming interface (API) is a Python-based, line-by-line, local thermal equilibrium (LTE) spectral modeling code which is optimized for simultaneously synthesizing optical spectra from any combination of fundamental spectroscopic databases. In this article, we contribute two novel spectral modeling techniques to the scientific literature. First we describe how SPEARS integrates a physics-based collisional model for calculating pressure broadening in the absence of available broadening coefficients. With this collisional model implementation, a generalized approach to fundamental spectroscopic databases can be achieved across multiple databases. We also detail our adaptive grid mesh algorithm developed to make the code scalable for simulating large spectral bandwidths at high spectral fidelity using intuitive grid parameters. Here, we present comparisons to other modeling tools, experiments, and provide a discussion on the SPEARS user interface.

47 OTHER INSTRUMENTATION↗