Search NASA⌕ Search

SEARCH · Search NASA

Results for “hybrid 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 595 records · Page 33

thornado+FLASH-X: A Hybrid Discontinuous Galerkin–Implicit-explicit and Finite-volume Framework for Neutrino-radiation Hydrodynamics in Core-collapse Supernovae

We present neutrino-transport algorithms implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado) and their coupling to self-gravitating hydrodynamics within the adaptive mesh refinement–based multiphysics simulation framework FLASH-X. thornado, developed primarily for simulations of core-collapse supernovae (CCSNe), employs a spectral, six-species two-moment formulation with algebraic closure and special-relativistic observer corrections accurate to $\mathcal{O}(v/c)$, and uses discontinuous Galerkin (DG) methods for phase-space discretization combined with implicit-explicit time stepping. A key development is a nonlinear neutrino–matter coupling algorithm based on nested fixed-point iteration with Anderson acceleration, enabling fully implicit treatment of collisional processes, including energy-coupling interactions such as neutrino–electron scattering and pair production. Coupling to finite-volume (FV) hydrodynamics is achieved through a hybrid DG-FV representation of the fluid variables and operator-split evolution within FLASH-X. The implementation is verified using basic transport tests with idealized opacities and relaxation and deleptonization problems with tabulated microphysics. Spherically symmetric CCSN simulations demonstrate accuracy and robustness of the coupled scheme, including close agreement with the CCSN simulation code Chimera. An axisymmetric CCSN simulation further demonstrates the viability of DG-based neutrino transport for multidimensional supernova modeling within FLASH-X. thornado’s neutrino-transport solver is GPU-enabled using OpenMP offloading or OpenACC, and all CCSN applications included in this work use the GPU implementation. Together, these results establish a foundation for future enhancements in physics fidelity, numerical algorithms, and computational performance, for increasingly realistic large-scale CCSN simulations.

Endeve, Eirik [Oak Ridge National Laboratory (ORNL↗

A quantum eigenvalue solver based on tensor networks

Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.

chemistry↗

Noise Robustness and Experimental Demonstration of a Quantum Generative Adversarial Network for Continuous Distributions

Abstract The potential advantage of machine learning in quantum computers is a topic of intense discussion in the literature. Theoretical, numerical, and experimental explorations will most likely be required to understand its power. There have been different algorithms proposed to exploit the probabilistic nature of variational quantum circuits for generative modeling. In this paper, a hybrid architecture for quantum generative adversarial networks (QGANs) is employed and their robustness in the presence of noise is studied. A simple way of adding different types of noise to the quantum generator circuit is devised, and the noisy hybrid QGANs (HQGANs) are simulated numerically to learn continuous probability distributions, and to show that the performance of HQGANs remains unaffected. The effect of different parameters on the training time is also investigated to reduce the computational scaling of the algorithm and simplify its deployment on a quantum computer. The training on Rigetti's Aspen‐4‐2Q‐A quantum processing unit is then performed, and the results from the training are presented. The authors' results pave the way for experimental exploration of different quantum machine learning algorithms on noisy intermediate‐scale quantum devices.

Anand, Abhinav↗

A Hybrid MPI/OpenMP Approach for Parallel Groundwater Model Calibration on Multicore Computers

Groundwater model calibration is becoming increasingly computationally time intensive. We describe a hybrid MPI/OpenMP approach to exploit two levels of parallelism in software and hardware to reduce calibration time on multicore computers with minimal parallelization effort. At first, HydroGeoChem 5.0 (HGC5) is parallelized using OpenMP for a uranium transport model with over a hundred species involving nearly a hundred reactions, and a field scale coupled flow and transport model. In the first application, a single parallelizable loop is identified to consume over 97% of the total computational time. With a few lines of OpenMP compiler directives inserted into the code, the computational time reduces about ten times on a compute node with 16 cores. The performance is further improved by selectively parallelizing a few more loops. For the field scale application, parallelizable loops in 15 of the 174 subroutines in HGC5 are identified to take more than 99% of the execution time. By adding the preconditioned conjugate gradient solver and BICGSTAB, and using a coloring scheme to separate the elements, nodes, and boundary sides, the subroutines for finite element assembly, soil property update, and boundary condition application are parallelized, resulting in a speedup of about 10 on a 16-core compute node. The Levenberg-Marquardt (LM) algorithm is added into HGC5 with the Jacobian calculation and lambda search parallelized using MPI. With this hybrid approach, compute nodes at the number of adjustable parameters (when the forward difference is used for Jacobian approximation), or twice that number (if the center difference is used), are used to reduce the calibration time from days and weeks to a few hours for the two applications. This approach can be extended to global optimization scheme and Monte Carol analysis where thousands of compute nodes can be efficiently utilized.

54 ENVIRONMENTAL SCIENCES↗

A Novel Multiagent Resource Sharing Algorithm for Control of Advanced Energy Systems

This paper implements a novel resource sharing control strategy on a fuel cell–gas turbine hybrid power system at the National Energy Technology Laboratory’s Hybrid Performance Facility (Hyper). In a fuel cell–gas turbine hybrid power system, the simultaneous interaction of the gas turbine and the fuel cell creates a tightly coupled environment characterized by conflicting dynamics. In this paper, a model-free control approach is applied to solve the tightly coupled control problem posed by this challenging environment. Specifically, this control problem is presented as a resource sharing problem that can be solved using a resource sharing algorithm that is defined based on the distribution construction concept. This algorithm creates computational agents and solves the problem through the distribution and redistribution of shared resources defined as blocks. Furthermore, two agents were created; the first agent (agent 1) controls the gas turbine speed by adjusting the electric load, and the second agent (agent 2) controls the cathode mass flow through the fuel cell using the cold-air bypass valve. A parametric study was performed over the course of 15 experimental tests for both agents 1 and 2 through an evaluation of the responses based on setpoint changes. The algorithm was shown to have behavior comparable to a previously implemented multi-input multioutput state-space controller, which was designed through a model-based control approach. The resource sharing algorithm was able to find stable performance during run-time operations without any prior system knowledge identification on the power plant and without creating models used in traditional control strategies.

25 ENERGY STORAGE↗

Stillwater Hybrid Geo-Solar Power Plant Optimization Analyses

The Stillwater Power Plant is the first hybrid plant in the world able to bring together a medium-enthalpy geothermal unit with solar thermal and solar photovoltaic systems. Solar field and power plant models have been developed to predict the performance of the Stillwater geothermal / solar-thermal hybrid power plant. The models have been validated using operational data from the Stillwater plant. A preliminary effort to optimize performance of the Stillwater hybrid plant using optical characterization of the solar field has been completed. The Stillwater solar field optical characterization involved measurement of mirror reflectance, mirror slope error, and receiver position error. The measurements indicate that the solar field may generate 9% less energy than the design value if an appropriate tracking offset is not employed. A perfect tracking offset algorithm may be able to boost the solar field performance by about 15%. The validated Stillwater hybrid plant models were used to evaluate hybrid plant operating strategies including turbine IGV position optimization, ACC fan speed and turbine IGV position optimization, turbine inlet entropy control using optimization of multiple process variables, and mixed working fluid substitution. The hybrid plant models predict that each of these operating strategies could increase net power generation relative to the baseline Stillwater hybrid plant operations.

15 GEOTHERMAL ENERGY↗

Impacts of Dispatch Strategies and Forecast Errors on the Economics of Behind-the-Meter PV-Battery Systems

To assess the economic value of batteries in hybrid PV-battery systems, one must create a dispatch profile for the battery. Many analyses of battery value assume perfect forecasts of PV generation and load, determining an upper limit on the value of the battery. Prior work that accounts for forecast uncertainty often does so in the context of a single dispatch algorithm, which does not provide a baseline for comparison. Furthermore, when multiple dispatch algorithms are assessed with uncertainty, the benefits considered are for diesel generation in a microgrid, not retail rate savings. This work addresses the gaps in the literature by comparing the performance of both heuristic and optimal dispatch algorithms for retail rate savings under forecast uncertainty, and provides comparisons of the robustness of these algorithms and their associated estimates of economic value. We find that using a perfect forecast can overestimate the value of hybrid PV-battery systems between 1% and 8% compared to the reality of using a day-ahead forecast, depending on the dispatch algorithm used. Thus, accounting for forecast uncertainty in system design and analysis will significantly improve the accuracy of modeled system values.

batteries↗

Impacts of Dispatch Strategies and Forecast Errors on the Economics of Behind-the-Meter PV-Battery Systems: Preprint

To assess the economic value of batteries in hybrid PV-battery systems, one must create a dispatch profile for the battery. Many analyses of battery value assume perfect forecasts of PV generation and load, determining an upper limit on the value of the battery. Prior work that accounts for forecast uncertainty often does so in the context of a single dispatch algorithm, which does not provide a baseline for comparison. Furthermore, when multiple dispatch algorithms are assessed with uncertainty, the benefits considered are for diesel generation in a microgrid, not retail rate savings. This work addresses the gaps in the literature by comparing the performance of both heuristic and optimal dispatch algorithms for retail rate savings under forecast uncertainty, and provides comparisons of the robustness of these algorithms and their associated estimates of economic value. We find that using a perfect forecast can overestimate the value of hybrid PV-battery systems between 1% and 8% compared to the reality of using a day-ahead forecast, depending on the dispatch algorithm used. Thus, accounting for forecast uncertainty in system design and analysis will significantly improve the accuracy of modeled system values.

batteries↗

Simulation of electron Bernstein waves using FullWave with a 2D non-local hot plasma model

Hot plasma wave simulation capability is expanded in the FullWave code by updating the hybrid iterative solver in the code with a semi-implicit time stepping method. The new approach is used to simulate Electron Bernstein Wave (EBW) heating in over-dense spherical tokamak plasmas. The code’s hybrid iterative solver circumvents the prohibitive memory cost of direct methods by combining a time evolution of Maxwell’s equations with frequency-domain relaxation, while the conductivity kernel, calculated via 3D particle tracking, captures the essential non-local wave–particle interactions. One-dimensional EBW simulations verify the algorithm’s accuracy by demonstrating mode conversion from X-mode wave to EBW at the upper hybrid resonance and a strong cyclotron damping near the plasma core. Two-dimensional simulation reproduces the predicted short EBW wavelength and quantitatively matches the hot-plasma dispersion relation. This study demonstrates the fidelity of the hybrid solver for the electron cyclotron frequency range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Impacts of Dispatch Strategies and Forecast Errors on the Economics of Behind-the-Meter PV-Battery Systems

To assess the economic value of batteries in hybrid PV-battery systems, one must create a dispatch profile for the battery. Many analyses of battery value assume perfect forecasts of PV generation and load, determining an upper limit on the value of the battery. Prior work that accounts for forecast uncer- tainty often does so in the context of a single dispatch algorithm, which does not provide a baseline for comparison. Furthermore, when multiple dispatch algorithms are assessed with uncertainty, the benefits considered are for diesel generation in a microgrid, not retail rate savings. This work addresses the gaps in the literature by comparing the performance of both heuristic and optimal dispatch algorithms for retail rate savings under forecast uncertainty, and provides comparisons of the robustness of these algorithms and their associated estimates of economic value. We find that using a perfect forecast can overestimate the value of hybrid PV-battery systems between 1% and 8% compared to the reality of using a day-ahead forecast, depending on the dispatch algorithm used. Thus, accounting for forecast uncertainty in system design and analysis will significantly improve the accuracy of modeled system values.

batteries↗

Status on the Development of a Modeling and Simulation Framework for the Economic Assessment of Nuclear Hybrid Energy

Continued effort to design and build a modeling and simulation framework to assess the economic viability of Nuclear Hybrid Energy Systems (NHES) was undertaken in fiscal year (FY) 2016. The purpose of this report is to document the various tasks associated with the development of such a framework and to provide a status of their progress. Several tasks have been accomplished. First, a synthetic time history generator has been developed in RAVEN, which consists of Fourier series and autoregressive moving average model. The former is used to capture the seasonal trend in historical data, while the latter is to characterize the autocorrelation in residue time series (e.g., measurements with seasonal trends subtracted). As demonstration, both synthetic wind speed and grid demand are generated, showing matching statistics with database. In order to build a design and operations optimizer in RAVEN, a new type of sampler has been developed with highly object-oriented design. In particular, simultaneous perturbation stochastic approximation algorithm is implemented. The optimizer is capable to drive the model to optimize a scalar objective function without constraint in the input space, while the constraints handling is a work in progress and will be implemented to improve the optimization capability. Furthermore, a simplified cash flow model of the performance of an NHES in the electric market has been developed in Python and used as external model in RAVEN to confirm expectations on the analysis capability of RAVEN to provide insight into system economics and to test the capability of RAVEN to identify limit surfaces. Finally, an example calculation is performed that shows the integration and proper data passing in RAVEN of the synthetic time history generator, the cash flow model and the optimizer. It has been shown that the developed Python models external to RAVEN are able to communicate with RAVEN and each other through the newly developed RAVEN capability called “EnsembleModel”.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A hybrid approach for rapid, accurate, and direct kilovoltage radiation dose calculations in CT voxel space

Purpose: To develop and validate a fast and accurate method that uses computed tomography (CT) voxel data to estimate absorbed radiation dose at a point of interest (POI) or series of POIs from a kilovoltage (kV) imaging procedure. Methods: The authors developed an approach that computes absorbed radiation dose at a POI by numerically evaluating the linear Boltzmann transport equation (LBTE) using a combination of deterministic and Monte Carlo (MC) techniques. This hybrid approach accounts for material heterogeneity with a level of accuracy comparable to the general MC algorithms. Also, the dose at a POI is computed within seconds using the Intel Core i7 CPU 920 2.67 GHz quad core architecture, and the calculations are performed using CT voxel data, making it flexible and feasible for clinical applications. To validate the method, the authors constructed and acquired a CT scan of a heterogeneous block phantom consisting of a succession of slab densities: Tissue (1.29 cm), bone (2.42 cm), lung (4.84 cm), bone (1.37 cm), and tissue (4.84 cm). Using the hybrid transport method, the authors computed the absorbed doses at a set of points along the central axis and x direction of the phantom for an isotropic 125 kVp photon spectral point source located along the central axis 92.7 cm above the phantom surface. The accuracy of the results was compared to those computed with MCNP, which was cross-validated with EGSnrc, and served as the benchmark for validation. Results: The error in the depth dose ranged from -1.45% to +1.39% with a mean and standard deviation of -0.12% and 0.66%, respectively. The error in the x profile ranged from -1.3% to +0.9%, with standard deviations of -0.3% and 0.5%, respectively. The number of photons required to achieve these results was 1x10{sup 6}. Conclusions: The voxel-based hybrid method evaluates the LBTE rapidly and accurately to estimate the absorbed x-ray dose at any POI or series of POIs from a kV imaging procedure.

60 APPLIED LIFE SCIENCES↗

Decentralized Distributed Proximal Policy Optimization (DD-PPO) for High Performance Computing Scheduling on Multi-User Systems

Resource allocation in High Performance Computing (HPC) environments presents a complex and multifaceted challenge for job scheduling algorithms. Beyond the efficient allocation of system resources, schedulers must account for and optimize multiple performance metrics, including job wait time and system throughput. Traditional heuristic-based scheduling algorithms increasingly struggle and lack the efficiency needed to meet the demands and address the complexity and scale of modern HPC systems. Consequently, recent research efforts have focused on leveraging advancements in Artificial Intelligence (AI) and Deep Learning (DL), particularly Reinforcement Learning (RL), to develop more adaptable and intelligent scheduling strategies. Previous RL-based scheduling approaches have explored a range of algorithms, from Deep Q-Networks (DQN) to Proximal Policy Optimization (PPO), and more recently, hybrid methods that integrate Graph Neural Networks (GNNs) with RL techniques. However, a common limitation across these methods is their reliance on relatively small datasets, with few methods being evaluated using large-scale, multi-million-job trace datasets representative of real-world HPC workloads. Moreover, existing RL schedulers face scalability issues due to centralized policy updates, which hinder training efficiency and performance when applied to large datasets. This study introduces a novel RL-based scheduler utilizing Decentralized Distributed Proximal Policy Optimization (DD-PPO) algorithm, which supports large-scale distributed training across multiple workers without requiring parameter synchronization at every step. By eliminating reliance on centralized updates to a shared policy, the DD-PPO scheduler enhances scalability, training efficiency, and sample utilization. Experimental validation using a large real-world dataset containing over 11.5 million job traces collected from petascale HPC systems over six years assesses the influence of dataset scale on training effectiveness and compares DD-PPO performance to traditional and advanced scheduling approaches. The experimental results demonstrate improved scheduling performance in comparison to both heuristic-based schedulers and existing RL-based scheduling algorithms.

AI↗

SU-E-J-08: A Hybrid Three Dimensional Registration Framework for Image-Guided Accurate Radiotherapy System ARTS-IGRT

Purpose: The purpose of this work was to develop a registration framework and method based on the software platform of ARTS-IGRT and implement in C++ based on ITK libraries to register CT images and CBCT images. ARTS-IGRT was a part of our self-developed accurate radiation planning system ARTS. Methods: Mutual information (MI) registration treated each voxel equally. Actually, different voxels even having same intensity should be treated differently in the registration procedure. According to their importance values calculated from self-information, a similarity measure was proposed which combined the spatial importance of a voxel with MI (S-MI). For lung registration, Firstly, a global alignment method was adopted to minimize the margin error and achieve the alignment of these two images on the whole. The result obtained at the low resolution level was then interpolated to become the initial conditions for the higher resolution computation. Secondly, a new similarity measurement S-MI was established to quantify how close the two input image volumes were to each other. Finally, Demons model was applied to compute the deformable map. Results: Registration tools were tested for head-neck and lung images and the average region was 128*128*49. The rigid registration took approximately 2 min and converged 10% faster than traditional MI algorithm, the accuracy reached 1mm for head-neck images. For lung images, the improved symmetric Demons registration process was completed in an average of 5 min using a 2.4GHz dual core CPU. Conclusion: A registration framework was developed to correct patient's setup according to register the planning CT volume data and the daily reconstructed 3D CBCT data. The experiments showed that the spatial MI algorithm can be adopted for head-neck images. The improved Demons deformable registration was more suitable to lung images, and rigid alignment should be applied before deformable registration to get more accurate result. Supported by National Natural Science Foundation of China (NO.81101132) and Natural Science Foundation of Anhui Province (NO.11040606Q55)

60 APPLIED LIFE SCIENCES↗

A comparison of global optimization algorithms with standard benchmark functions and real-world applications using Energy Plus

There is an increasing interest in the use of computer algorithms to identify combinations of parameters which optimise the energy performance of buildings. For such problems, the objective function can be multi-modal and needs to be approximated numerically using building energy simulation programs. As these programs contain iterative solution algorithms, they introduce discontinuities in the numerical approximation to the objective function. Metaheuristics often work well for such problems, but their convergence to a global optimum cannot be established formally. Moreover, different algorithms tend to be suited to particular classes of optimization problems. To shed light on this issue we compared the performance of two metaheuristics, the hybrid CMA-ES/HDE and the hybrid PSO/HJ, in minimizing standard benchmark functions and real-world building energy optimization problems of varying complexity. From this we find that the CMA-ES/HDE performs well on more complex objective functions, but that the PSO/HJ more consistently identifies the global minimum for simpler objective functions. Both identified similar values in the objective functions arising from energy simulations, but with different combinations of model parameters. This may suggest that the objective function is multi-modal. The algorithms also correctly identified some non-intuitive parameter combinations that were caused by a simplified control sequence of the building energy system that does not represent actual practice, further reinforcing their utility.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Recent advances in machine learning towards multiscale soft materials design

The multiscale design of soft materials requires an ensemble of computational techniques spanning quantum-chemistry to molecular dynamics to continuum modeling. The recent emergence of machine-learning (ML) and modern optimization algorithms has accelerated material property prediction, as well as stimulated the development of hybrid ML/molecular modeling methodologies capable of providing physical insights unobtainable from purely physics-based modeling and intuition. Such hybrid techniques also have important ramifications for the ML-enhanced interpretation of results from simulations and experiments alike. Leveraging ML techniques for the design of chemical or morphological structures based on a target property or functionality represents an exciting goal for the general area of soft materials, including polymers, liquid crystals, colloids, or biomolecules, to name a few representative classes of systems. Furthermore, we provide a perspective on recent work using ML techniques of relevance for the multiscale design of soft materials and outline potential future directions of interest to the soft materials community.

36 MATERIALS SCIENCE↗

Modeling plasticity-mediated void growth at the single crystal scale: A physics-informed machine learning approach

Modeling the evolution of voids during plastic flow as well as their effects on plastic dissipation is critical for both component manufacturing and lifetime estimation purposes. To this end, we propose a rate-dependent constitutive model to homogenize the effects of semi-randomly distributed voids on single crystal plasticity whilst capturing void interaction and plastic anisotropy. Here, this present work focuses on the case of face centered cubic crystals to introduce an anisotropic gauge function applicable within the crystal plasticity formalism. The approach combines analytical methods to describe the micromechanics of the system in combination with symbolic regression to capture analytically intractable mechanisms from data. The hybrid framework uses a physics-informed genetic programming-based symbolic regression algorithm to solve a multiform optimization problem simultaneously producing a new gauge function and a new strain rate equation. This is also a multi-objective optimization problem with many competing objectives. A new search and selection step is introduced to the genetic algorithm that promotes convergence toward a global solution that better satisfies all the objectives. Overall, the symbolic equations produced leverage data-driven methods to achieve greater accuracy than comparable alternatives on an analytically intractable problem while maintaining model transparency.

36 MATERIALS SCIENCE↗

Optimization of processor allocation for domain decomposed Monte Carlo calculations

Load imbalance plagues domain decomposed Monte Carlo calculations when sources are not uniform. Parallel efficiency for domain decomposed Monte Carlo transport calculations improves through a nonuniform allocation of processors over subdomains. In this work, we optimize the allocation with runtime diagnostics collected during a calibration step, then complete the full calculation. The diagnostic-based approach is compared to implicit filtering, an optimization algorithm for bound constrained noisy optimization problems. Finally, we consider both forward and hybrid radiation transport calculations to measure performance.

97 MATHEMATICS AND COMPUTING↗