Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Goal-oriented real-time Bayesian inference for linear autonomous dynamical systems with application to digital twins for tsunami early warning

We present a goal-oriented framework for constructing digital twins with the following properties: (1) they employ discretizations of high-fidelity partial differential equation (PDE) models governed by autonomous dynamical systems, leading to large-scale forward problems; (2) they solve a linear inverse problem to assimilate observational data to infer uncertain model components followed by a forward prediction of the evolving dynamics; and (3) the entire end-to-end, data-to-inference-to-prediction computation is carried out without approximation and in real time through a Bayesian framework that rigorously accounts for uncertainties. Several challenges must be overcome to realize this framework, including the large scale of the forward problem, the high dimensionality of the parameter space, and for a class of problems including those we target, the slow decay of the singular values of the parameter-to-observable map. Here we introduce a methodology to overcome these challenges by exploiting the autonomous structure of the forward model to decompose the solution of the inverse problem into a one-time-only offline phase in which the PDE model is solved a limited number of times (equal to the number of sensors), and an online phase that maps well onto GPUs and computes the parameter inference and prediction of quantities of interest in real time, given observational data. Our ultimate goal is to apply this framework to construct digital twins for subduction zones, including Cascadia, to provide early warning for tsunamis generated by megathrust earthquakes. To this end, we demonstrate how our methodology can be used to employ seafloor pressure observations, along with the coupled acoustic–gravity wave equations, to infer the earthquake-induced spatiotemporal seafloor motion (discretized with $\mathscr{O}$ (10 9 ) parameters) and forward predict the tsunami propagation. We present results of an end-to-end inference, prediction, and uncertainty quantification for a representative test problem with $\mathscr{O}$ (10 8 ) inversion parameters for which goal-oriented Bayesian inference is accomplished exactly and in real time, that is, in a matter of seconds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗
DOE OSTI2025

A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials

We study the design of an electromagnetic cloak from multiple materials with an additional constraint on the mass of the cloak. Our problem is an example of a topology optimization problem, and we formulate this problem as a mixed-integer partial-differential equation constrained optimization (MIPDECO) problem, where Maxwell’s equation models the propagation of the wave through the cloak and surrounding medium. We use binary variables to model the assignment of the different materials, and their relevant properties (permittivity and density). The mass constraint adds a nontrivial constraint to this problem. We propose a two-phase strategy to solve this problem. In the first phase, we solve a continuous relaxation, and then propose a new variant of the feasibility pump that exploits the structure of the PDE to obtain an initial integral solution candidate. In the second phase, we use a trust-region approach to improve this incumbent. We also consider a continuation or mesh-sequencing approach to find better solutions faster on consecutively finer meshes. We present detailed numerical results to illustrate the effectiveness of our approaches for constructing multi-material cloaks with a mass constraint.

Calculus of Variations and Optimization↗
DOE OSTI2024

Electric vehicle supply equipment location and capacity allocation for fixed-route networks

Electric vehicle (EV) supply equipment location and allocation (EVSELCA) problems for freight vehicles are becoming more important because of the trending electrification shift. Some previous works address EV charger location and vehicle routing problems simultaneously by generating vehicle routes from scratch. Although such routes can be efficient, introducing new routes may violate practical constraints, such as drive schedules, and satisfying electrification requirements can require dramatically altering existing routes. To address the challenges in the prevailing adoption scheme, we approach the problem from a fixed -route perspective. We develop a mixed -integer linear program, a clustering approach, and a metaheuristic solution method using a genetic algorithm (GA) to solve the EVSELCA problem. The clustering approach simplifies the problem by grouping customers into clusters, while the GA generates solutions that are shown to be nearly optimal for small problem cases. A case study examines how charger costs, energy costs, the value of time (VOT), and battery capacity impact the cost of the EVSELCA. Charger equipment costs were found to be the most significant component in the objective function, leading to a substantial reduction in cost when decreased. VOT costs exhibited a significant decrease with rising energy costs. Further, an increase in VOT resulted in a notable rise in the number of fast chargers. Longer EV ranges decrease total costs up to a certain point, beyond which the decrease in total costs is negligible.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Methodology to evaluate design modifications intended to eliminate frosting and high discharge temperatures in air-source heat pumps (ASHPs) in cold climates

Air-source heat pumps (ASHPs) operating in cold climates experience problems with frosting and high refrigerant temperatures. These problems increase energy consumption, and their severity depends on the climatic conditions. In the present paper, a methodology for identifying the prevailing problem between frosting and high discharge temperatures is presented. Three performance indices, the frosting index (FI), the discharge index (DI), and the total loss index (TLI), are proposed to quantify the impacts of frosting and high discharge temperatures on the annual performance of ASHPs in different climatic conditions. The FI and DI show which problem (frosting or high discharge temperature) dominates, and the TLI indicates the combined effect of frosting and high discharge temperatures on the performance of an ASHP. A thermodynamic model of an ASHP coupled with the TRNSYS building simulation tool is used to estimate the performance of an ASHP and the proposed loss indices to estimate the impact of both frosting and high discharge temperatures for 45 cities in Canada. The results can be extended to other parts of the world that experience similar climatic conditions The results reveal that in cities in ASHRAE climatic zones 5 and 6 (classified as cold regions) where the ambient air temperatures are predominantly between -15 °C to 6 °C, ASHPs are heavily impacted by frosting. The problem of high discharge temperatures in ASHPs is predominant in cities in climate zones 7 and 8 (classified as very cold and subarctic regions) where the temperatures are frequently below -20 °C in winter. Among the cities considered, St. John, NL has the highest fraction of heating hours experiencing frosting (90 %), where the annual increase in energy consumption due to frosting is 13.5 % of the annual heating energy consumption. The highest annual increase in energy consumption due to high discharge temperatures is in Isachsen, NU (zone 8), where the increase is 30 % of the annual heating energy consumption. Based on the proposed indices, another index called the performance gain index (PGI) is created, which can be used as a first step to assess the energy-saving potential of design modifications applied to ASHPs to solve the problems of frosting and high discharge temperatures. The PGI will aid in developing climate specific ASHPs. One possible design modification is the use of a two-stage ASHP with an economizer. It is observed that the two-stage ASHP with economizer can mitigate high discharge temperatures and improve performance in very cold and subarctic regions (zones 7 and 8). However, it is not as beneficial in zones 5 and 6, where the impact of high discharge temperatures on performance is minimal and frosting dominates. Finally, a case study, using the PGI to evaluate the economic and environmental effectiveness of a two-stage ASHP with economizer is presented for the city of Saskatoon.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

A Second Moment Method for k -Eigenvalue Acceleration with Continuous Diffusion and Discontinuous Transport Discretizations

The second moment method is a linear acceleration technique that couples the transport equation to a diffusion equation with transport-dependent additive closures. The resulting low-order diffusion equation can be discretized independent of the transport discretization, unlike diffusion synthetic acceleration, and is symmetric positive definite, unlike quasidiffusion. While this method has been shown to be comparable to quasidiffusion in iterative performance for fixed source and time-dependent problems, it is largely unexplored as an eigenvalue problem acceleration scheme due to the belief that the resulting inhomogeneous source makes the problem ill posed. Recently, a preliminary feasibility study was performed on the second moment method for eigenvalue problems. The results suggested comparable performance to quasidiffusion and more robust performance than diffusion synthetic acceleration. This work extends the initial study to more realistic reactor problems using state-of-the-art discretization techniques. Finally, the results in this paper show that the second moment method is more computationally efficient than its alternatives on complex reactor problems with unstructured meshes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Unpaired image translation to mitigate domain shift in liquid argon time projection chamber detector responses

Deep learning algorithms often are developed and trained on a training dataset and deployed on test datasets. Any systematic difference between the training and a test dataset may severely degrade the final algorithm performance on the test dataset—what is known as the domain shift problem . This issue is prevalent in many scientific domains where algorithms are trained on simulated data but applied to real-world datasets. Typically, the domain shift problem is solved through various domain adaptation (DA) methods. However, these methods are often tailored for a specific downstream task, such as classification or semantic segmentation, and may not easily generalize to different tasks. This work explores the feasibility of using an alternative way to solve the domain shift problem that is not specific to any downstream algorithm. The proposed approach relies on modern Unpaired Image-to-Image (UI2I) translation techniques, designed to find translations between different image domains in a fully unsupervised fashion. In this study, the approach is applied to a domain shift problem commonly encountered in Liquid Argon Time Projection Chamber (LArTPC) detector research when seeking a way to translate samples between two differently distributed LArTPC detector datasets deterministically. This translation allows for mapping real-world data into the simulated data domain where the downstream algorithms can be run with much less domain-shift-related performance degradation. Conversely, using the translation from the simulated data to a real-world domain can increase the realism of the simulated dataset and reduce the magnitude of any systematic uncertainties. To evaluate the quality of the translations, we use both pixel-wise metrics and a downstream task to measure the effectiveness of UI2I methods for mitigating the domain shift problem. We adapted several popular UI2I translation algorithms to work on scientific data and demonstrated the viability of these techniques for solving the domain shift problem with LArTPC detector data. To facilitate further development of DA techniques for scientific datasets, the ‘Simple Liquid-Argon Track Samples’ dataset used in this study is also published.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Optimal Power Management for Large-Scale Battery Energy Storage Systems via Bayesian Inference

Large-scale battery energy storage systems (BESS) have found ever-increasing use across industry and society to accelerate clean energy transition and improve energy supply reliability and resilience. However, their optimal power management poses significant challenges: the underlying high-dimensional nonlinear nonconvex optimization lacks computational tractability in real-world implementation, and the uncertainty of the exogenous power demand makes exact optimization difficult. This paper presents a new solution framework to address these bottlenecks. The solution pivots on introducing power-sharing ratios to specify each cell’s power quota from the output power demand. To find the optimal power-sharing ratios, we formulate a nonlinear model predictive control (NMPC) problem to achieve power-loss-minimizing BESS operation while complying with safety, cell balancing, and power supply-demand constraints. We then propose a parameterized control policy for the power-sharing ratios, which utilizes only three parameters, to reduce the computational demand in solving the NMPC problem. This policy parameterization allows us to translate the NMPC problem into a Bayesian inference problem for the sake of 1) computational tractability, and 2) overcoming the nonconvexity of the optimization problem. We leverage the ensemble Kalman inversion technique to solve the parameter estimation problem. Concurrently, a low-level control loop is developed to seamlessly integrate our proposed approach with the BESS to ensure practical implementation. This low-level controller receives the optimal power-sharing ratios, generates output power references for the cells, and maintains a balance between power supply and demand despite uncertainty in output power. We conduct extensive simulations and experiments on a 20-cell prototype to validate the proposed approach.

Battery energy storage systems (BESSs)↗
DOE OSTI2025

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗
DOE OSTI2025

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Neural Networks to Find the Optimal Forcing for Offsetting the Anthropogenic Climate Change Effects

Abstract Of great relevance to climate engineering is the systematic relationship between the radiative forcing to the climate system and the response of the system, a relationship often represented by the linear response function (LRF) of the system. However, estimating the LRF often becomes an ill-posed inverse problem due to high-dimensionality and nonunique relationships between the forcing and response. Recent advances in machine learning make it possible to address the ill-posed inverse problem through regularization and sparse system fitting. Here, we develop a convolutional neural network (CNN) for regularized inversion. The CNN is trained using the surface temperature responses from a set of Green’s function perturbation experiments as imagery input data together with data sample densification. The resulting CNN model can infer the forcing pattern responsible for the temperature response from out-of-sample forcing scenarios. This promising proof of concept suggests a possible strategy for estimating the optimal forcing to negate certain undesirable effects of climate change. The limited success of this effort underscores the challenges of solving an inverse problem for a climate system with inherent nonlinearity. Significance Statement Predicting the climate response for a given climate forcing is a direct problem, while inferring the forcing for a given desired climate response is often an inverse, ill-posed, problem, posing a new challenge to the climate community. This study makes the first attempt to infer the radiative forcing for a given target pattern of global surface temperature response using a deep learning approach. The resulting deeply trained convolutional neural network inversion model shows promise in capturing the forcing pattern corresponding to a given surface temperature response, with a significant implication on the design of an optimal solar radiation management strategy for curbing global warming. This study also highlights the technical challenges that future research should prioritize in seeking feasible solutions to the inverse climate problem.

Ren, Huiying↗
DOE OSTI2025

Quantum Information for Fusion Energy Sciences (Final Technical Report)

The simulation of plasma dynamics is a critical area of Fusion Energy Sciences (FES) due to it’s usefulness in predicting, controlling, and confining plasmas in the context of potential fusion reactors. The simulation of plasmas is a computationally difficult problem in both classical and quantum physics, motivating investigation into the potential of quantum computers to simulate these systems. This project took several concrete steps towards this goal by developing tools for improving the control, characterization, and calibration of quantum gates on a superconducting quantum computer, developing error suppression and mitigation tools to reduce errors on the quantum computer, and utilizing these advancements to simulate reduced models of plasma dynamics on the quantum computer. In order to efficiently simulate plasma physics, an optimal control method which synthesizes, directly at the pulse level, any quantum gate on qubit and qutrit systems was developed. Using four superconducting transmon quantum processors at Rigetti and LLNL, it was demonstrated that any arbitrary quantum gate on qubits and qutrits could be implemented with high fidelity, leading to a significantly reduced length of a gate sequence. A problem of interest in FES is the nonlinear optical process of laser pulse compression within a plasma. Since quantum physics is linear, simulating nonlinear operations is not naturally feasible on a quantum computer, however it is possible to simulated a quantized version of the nonlinear process. A quantization approach to convert nonlinear wave-wave interaction problems to Hamiltonian simulation problems was developed and demonstrated using two qubits on a Rigetti device. In this experiment, a number of error suppression and mitigation techniques were investigated to determine how best to utilize the finite quantum resources. This study provides an example of how plasma problems may be solved on near-term, noisy quantum computing platforms and identified a promising set of techniques. Building on the insights of these experiments, the investigation turned to linear electron-plasma wave physics. A connection was identified between a local one-dimensional lattice spin model and linear wave phenomena, allowing a plasma physics problem to be efficiently mapped to the quantum computer. In this framework, reflection and transmission of plasma waves at a sharp boundary was studied, as well as the propagation of waves through an inhomogeneous plasma medium. In addition to the suite of error suppression and mitigation techniques developed, this experiment introduced the use of a digital-analog gate scheme designed to efficiently simulate the plasma Hamiltonian. With hardware available at the conclusion of the project, simulation at the scale of 9 qubits and 15 timesteps (60 entangling layers) was achieved.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Whitepaper: Optimal Control from a Fluid Dynamics Perspective

An optimal control problem described by the Hamilton-Jacobi-Bellman equation can be developed into a problem that can be solved by general computational fluid dynamics packages. We describe how this formulation would allow a classical problem in optimal control, Zermelo’s problem, to be treated as a multi-fluid problem. This approach has the advantage of allowing optimal navigation problems to be conducted over large areas, as well as to include moderately larger numbers of ships. We draw comparisons between this approach and the field of fluid control for fluid animations in movies.

42 ENGINEERING↗
DOE OSTI2025

TRUST Sensors in Environments: Thermocouples (SE-TC), Release FY25

The Delivery Environments Testbeds to Reduce Uncertainty in Simulations and Tests (TRUST) project is a broad project intended to analyze simplified problems experimentally and with modeling and simulation. The purpose of analyzing these simplified problems is to extend solution methods to more complex problems, as well as understand deficiencies and gaps in knowledge of methods currently used in more complex analyses. The TRUST project encompasses several smaller testbeds intended to isolate individual phenomena. The testbed under consideration in this report is the Sensors in Environments: Thermocouples testbed. In previous years, the purpose of this testbed was to quantify uncertainty of thermocouple sensors. To accomplish this, an aluminum plate was placed in a thermal chamber and subject to various types of thermal loading. Thermocouples were placed in various locations on the aluminum plate in various configurations (e.g., embedded in the plate, placed under Kapton tape), and an effort was made to quantify uncertainty in these measurements. Finite element simulations were performed to investigate how sensitive these measurements were to parameters such as the boundary conditions on the plate and material properties. However, a fundamental source of uncertainty in this analysis was the convective heat transfer from the plate. Convective heat transfer is a complex physical phenomenon comprised of a number of interacting sub-processes and is difficult to predict accurately a priori. As such, the main purpose of this testbed in FY25 was to better understand, both experimentally and numerically, the convective heat transfer from the plate. This is a highly applicable problem to several more complex problems, as convective heat transfer occurs in nearly all problems where a body is moving through air. Numerically, this required a two-step approach. First, the air flow in the thermal chamber was in vestigated using computational fluid dynamics. The commercial solver Fluent was used to perform these simulations. From these simulations, a heat transfer coefficient over the surface of the plate was calculated. This heat transfer was then used as boundary conditions for finite element heat transfer simulations within the plate, which were performed using Abaqus. Significant effort was devoted to automating the handoff between these two solvers. Experimentally, previous thermocouple results in the plate were used to validate the time-dependent thermal profiles produced from Abaqus. Further experimental efforts were performed both to help validate the Fluent simulations and to inform its boundary conditions. For example, hot-wire anemometers were used to measure the velocity in the chamber, which would be particularly useful in understanding the chamber inlet velocity. Thermocouple measurements were also taken in the chamber, instead of only on the plate, to serve as validation evidence for the Fluent simulations. Numerical results showed that the Fluent to Abaqus workflow matched previous plate thermocouple measurements well. This type of handoff is useful for more complex experiments, or those that are not able to be examined in as great of detail as this testbed, as it was performed without any experimental input. Experimental results, however, were more mixed. The anemometers proved unreliable, with inconsistent measurements across all anemometers, even at locations that were nearly identical. On the other hand, the thermocouples provided a relatively rich view of the temperature field in the chamber.

42 ENGINEERING↗
DOE OSTI2026

Integration of Online Cross-Section Generation Capability with Depletion and Transient Solvers in Griffin

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE)-based reactor multiphysics analysis application jointly developed by Argonne and Idaho National Laboratories under the DOENE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. In FY25, an online crosssection generation capability based on the Self-Shielding Application Programming Interface (SSAPI) was demonstrated for TRISO-fueled reactor problems under steady-state conditions. This fiscal year, that capability was extended to support depletion and transient multiphysics calculations, enabling high-fidelity analyses that generate self-shielded cross sections on the fly from the actual evolving composition and temperature states rather than from pre-tabulated libraries. For depletion, a two-way coupling was established in which SSAPI computes compact-averaged self-shielded cross sections that the depletion solver then uses to advance the Bateman equations, with the updated compositions returned to SSAPI at each step; the depletion module was refactored to support both library-based and SSAPI-based cross sections, and additional logic was added to track daughter isotopes and to exclude minor isotopes for efficiency. For transient analysis, the SSAPI multigroup library was extended with the kinetics data required for time-dependent calculations, the Improved Quasi-Static (IQS) scheme was coupled with SSAPI, and several supporting capabilities were implemented, including a self-shielding treatment that lets control rods and drums move within a self-shielded model, which had previously been impossible and had ruled out rod- and drum-movement transients with on-the-fly cross sections altogether, a new mixing scheme for delayed-neutron precursor decay constants, a checkpoint-based restart workflow, and performance improvements such as pointwise cross-section interpolation and the bypassing of unnecessary Dancoff factor calculations. The implemented capabilities were verified against Serpent Monte Carlo solutions. For depletion, a prismatic pin-cell problem based on a Next Generation Nuclear Plant (NGNP) Very High Temperature Reactor benchmark showed excellent agreement, with eigenvalue differences within 200 pcm over the entire burnup range (up to 140 MWD/kgU) and fission-product and actinide inventories agreeing to within 0.8% and 2.5%, respectively; a heat-pipe microreactor assembly problem with a much higher fuel loading confirmed the same behavior and quantified the bias introduced when the multigroup equivalence effect is neglected. For transient analysis, a pin-cell problem with a step reactivity insertion and temperature feedback reproduced the analytically expected asymptotic power and showed close agreement between the direct and IQS solutions, and a two-dimensional microreactor core problem with control-drum rotation exercised the new moving-drum self-shielding treatment and demonstrated successful coupling of the online crosssection generation with both the direct and IQS transient methods. The capability was further exercised on a full-core pebble-bed problem, in which Griffin was coupled with the System Analysis Module (SAM) to simulate load-following operation of the gPBR with the Doppler feedback resolved at the TRISO fuel kernel temperature. These developments in Griffin provide a convenient, high-fidelity approach to cross-section generation for advanced thermal reactors with geometrically complex and highly heterogeneous configurations, including TRISO-fueled prismatic and pebble-bed systems, and support steady-state, depletion, and transient multiphysics calculations. They also enable self-shielded cross sections to be evaluated directly at the actual coupled state of the system, thereby establishing a foundation for high-fidelity, fully coupled multiphysics analysis of advanced reactors

Park, H.↗
DOE OSTI2024

HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware

In order to characterize and benchmark computational hardware, software, and algorithms, it is essential to have many problem instances on-hand. This is no less true for quantum computation, where a large collection of real-world problem instances would allow for benchmarking studies that in turn help to improve both algorithms and hardware designs. To this end, here we present a large dataset of qubit-based quantum Hamiltonians. The dataset, called HamLib (for Hamiltonian Library), is freely available online and contains problem sizes ranging from 2 to 1000 qubits. HamLib includes problem instances of the Heisenberg model, Fermi-Hubbard model, Bose-Hubbard model, molecular electronic structure, molecular vibrational structure, MaxCut, Max- k -SAT, Max- k -Cut, QMaxCut, and the traveling salesperson problem. The goals of this effort are (a) to save researchers time by eliminating the need to prepare problem instances and map them to qubit representations, (b) to allow for more thorough tests of new algorithms and hardware, and (c) to allow for reproducibility and standardization across research studies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

We present a benchmarking study of active learning (AL) schemes for designing planar multilayer nanophotonic metamaterials, where the design tasks are formulated as binary optimization problems. Different surrogate models, including factorization machine (FM), Gaussian process regression (GPR), and convolutional neural network (CNN), combined with different optimization methods, including exhaustive enumeration, discrete particle swarm optimization (DPSO), quantum annealing (QA), hybrid QA, and simulated annealing are studied. The benchmark cases investigated range from small problems with short binary lengths (N = 25) to large problems with N up to 100, focusing on the design of two classes of photonic structures, including antireflective coatings for the long-wavelength infrared region and transparent radiative coolers. For small problems, CNN coupled with DPSO in AL achieves the best performance. As N increases, FM with QA outperforms GPR and CNN. For FM-based AL, hybrid QA yields the best optimization results, particularly in high-dimensional cases (N = 100). These results demonstrate that the optimization method can significantly affect in AL performance as N increases, and that QA-based optimization can provide practical routes for mitigating the optimization bottleneck in high-dimensional problems.

Jung, Serang [Kyung Hee University, Korea]↗
DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗