SEARCH · Engineering Papers

Results for “heuristic”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Impact of error fields and error field correction on heat fluxes in SPARC

Using a single toroidal array of coils to reduce the m,n = 2,1 resonant error field (EF) produced by the misalignment of the axisymmetric coils in SPARC can result in the enhancement of the local divertor heat fluxes. Managing high divertor heat fluxes (q ∥ $\simeq$ 10 GW m -2 ) poses a challenge for compact tokamak devices such as SPARC. The presence of non-axisymmetric magnetic field perturbations adds complexity to the problem by generating intricate 3D edge magnetic topologies that alter the heat flux distributions on the target plates. The aim of this work is to investigate the impact of the EF correction (EFC) on the heat fluxes at the divertor plates in SPARC. The MHD code M3DC1 has been used to simulate the 3D magnetic perturbations generated by the shift and tilt of several axisymmetric coils within specified tolerances, as well as from the array of EFC coils located at the midplane. Using a heuristic model that extends the concept of an axisymmetric heat flux layer to 3D plasmas, the resultant heat flux distributions is derived from magnetic footprints calculated with the MAFOT code. The results show that the EFC could either decrease or further enhance the local heat flux when used to correct the m,n = 2,1 resonant EF to enhance the core plasma performance.

3D fields↗

DOE OSTI2025

Impurity radiation seeding of neoclassical tearing mode growth

Abstract The physics of neoclassical tearing modes (NTMs) is of great concern to tokamak plasma stability and performance, especially in the burning plasma regime. Whereas in many situations the seed events can be clearly identified, such as sawteeth and edge localized modes, the potential seeding mechanism of NTMs due to the resistive tearing instability driven by the impurity radiation cooling still needs more study. Recent NIMROD simulations have demonstrated that local impurity radiation cooling can drive the seed island growth and trigger the subsequent onset of NTM instability. The seed island is mainly driven by the local helical perturbation of the diamagnetic current induced by the perturbed pressure gradient as a result of the impurity radiative cooling on the rational surface. A heuristic closure for the neoclassical viscosity is adopted, and the seed island is further driven by the perturbed bootstrap current induced from the neoclassical electron viscous stress in the extended Ohm’s law. The growth rate of the NTM in simulations is found proportional to the electron neoclassical viscosity, and a theoretical neoclassical driving term is adopted to account for the nonlinear neoclassical island growth in the simulations.

Zeng, Shiyong (ORCID:000000017098818X)↗

DOE OSTI2026

On how avalanches penetrate the SOL and broaden heat loads

Recent experiments reported a correlation between power law core temperature spectra and Dα emission, suggesting that heat avalanches penetrate the SOL. This paper derives a threshold criterion for avalanche penetration using a reduced model. Avalanches with ($\bigtriangledown$$\tilde{T}$) rms > $\bigtriangledown$$\tilde{T}$ crit at the separatrix are predicted to penetrate, and so broaden the SOL and heat load distribution. $\bigtriangledown$$\tilde{T}$ crit is ~ 1/$τ$ ∥ , where $τ$ ∥ is the parallel heat flow time through the SOL. Penetration occurs when avalanches are strong enough to steepen sufficiently to shock at the separatrix. A positive correlation is found between the nonlinear drive for steepening and the penetration depth. In particular, penetration depth exceeds that of the heuristic drift limit when shocks form. Implications for numerical and physical experiments are also discussed.

SOL heat load↗

DOE OSTI2024

Resource Assessment for Distributed Wind Energy: An Evaluation of Best-Practice Methods in the Continental US

Current wind resources within the United States (US) indicate a potential to profitably install nearly 1,400 gigawatts of distributed wind (DW) capacity. This amount is equivalent to over half of the United States’ current energy demand from electricity, making it enough to power millions of homes and businesses and replace countless fossil fuel-based generating plants. Despite the potential growth of DW in the US, deployments are presently hindered by a lack of confidence in resource estimation methods. One potential challenge is that smaller-scale turbines, with hub heights of 40 meters or less, are disproportionately impacted by obstacles such as buildings and vegetation. These obstacles may produce complex wake effects, best modeled with high-fidelity complex fluid dynamics (CFD) models that are too computationally expensive to use for routine siting and resource assessment. Thus, installers today make use of heuristics and simple equations to approximate the impact of obstacles while also leveraging long-term resource data from commercial or publicly available atmospheric models. This study evaluates these historical and commonly used methods alongside new lower-order obstacle models produced from CFD simulations and measurement-based bias correction. The preliminary results from this study show the importance of taking care in the choice and application of mesoscale atmospheric models and the significant value of bias correction using measurements from nearby meteorological towers. Detailed obstacle modeling provides only modest additional gains in performance and, in some cases, can add error, especially at sites where turbines have already been located to avoid obvious impact from upwind obstacles. These findings reinforce the importance of collecting in situ measurements and suggest that obstacle models may be better applied in practice to automated or computer-aided siting, rather than in economic wind resource assessments.

17 WIND ENERGY↗

DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2026

Towards a self-driving trigger at the LHC: adaptive response in real time

Real-time data filtering and selection—or trigger—systems at high-throughput scientific facilities such as the experiments at the Large Hadron Collider must process extremely high-rate data streams under stringent bandwidth, latency, and storage constraints. Yet these systems are typically designed as static, hand-tuned menus of selection criteria grounded in prior knowledge and simulation. In this work, we further explore the concept of a self-driving trigger, an autonomous data-filtering framework that reallocates resources and adjusts thresholds dynamically in real-time to optimize signal efficiency, rate stability, and computational cost as instrumentation and environmental conditions evolve. We introduce a benchmark ecosystem to emulate realistic collider scenarios and demonstrate real-time optimization of a menu including canonical energy sum triggers as well as modern anomaly-detection algorithms that target non-standard event topologies using machine learning. Using simulated data streams and publicly available collision data from the Compact Muon Solenoid experiment, we demonstrate the capability to dynamically and automatically optimize trigger performance under specific cost objectives without manual retuning. Our adaptive strategy shifts trigger design from static menus with heuristic tuning to intelligent, automated, data-driven control, unlocking greater flexibility and discovery potential in future high-energy physics analyses.

Emami, Shaghayegh [Michigan U.] (ORCID:00090007589↗

DOE OSTI2026

Conformalized-KANs: Uncertainty Quantification with Coverage Guarantees for Kolmogorov-Arnold Networks (KANs) in Scientific Machine Learning

This paper explores uncertainty quantification (UQ) methods in the context of Kolmogorov–Arnold Networks (KANs). We apply an ensemble approach to KANs to obtain a heuristic measure of UQ, enhancing interpretability and robustness in modeling complex functions. Building on this, we introduce Conformalized-KANs, which integrate conformal prediction, a distribution-free UQ technique, with KAN ensembles to generate calibrated prediction intervals with guaranteed coverage.} Extensive numerical experiments are conducted to evaluate the effectiveness of these methods, focusing particularly on the robustness and accuracy of the prediction intervals under various hyperparameter settings. We show that the conformal KAN predictions can be applied to recent extensions of KANs, including Finite Basis KANs (FBKANs) and multifideilty KANs (MFKANs). The results demonstrate the potential of our approaches to significantly improve the reliability and applicability of KANs in scientific machine learning.

• Artificial intelligence (AI) / machine learning ↗

DOE OSTI2025

End-to-end protocol for high-quality quantum approximate optimization algorithm parameters with few shots

The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for combinatorial optimization that has been demonstrated to scale better than state-of-the-art classical solvers for some problems. For a given problem instance, QAOA performance depends crucially on the choice of the parameters. While average-case optimal parameters are available in many cases, meaningful performance gains can be obtained by fine-tuning these parameters for a given instance. This task is especially challenging, however, when the number of circuit executions (shots) is limited. In this work, we develop an end-to-end protocol that combines multiple parameter settings and fine-tuning techniques. We use large-scale numerical experiments to optimize the protocol for the shot-limited setting and observe that optimizers with the simplest internal model (linear) perform best. We implement the optimized pipeline on a trapped-ion processor using up to 32 qubits and 5 QAOA layers, and we demonstrate that the pipeline is robust to small amounts of hardware noise. To the best of our knowledge, these are the largest demonstrations of QAOA parameter fine-tuning on a trapped-ion processor in terms of two-qubit gate count.

quantum algorithms & computation↗

DOE OSTI2025

Mesoscale variations of the chemical and electronic landscape on the surface of the Weyl semimetal Co 3 ⁢Sn 2⁢ S 2 visualized by ARPES and XPS

The multiple crystalline terminations in magnetic Weyl semimetal Co 3 Sn 2 S 2 display distinct topological and trivial surface states, which have successfully been distinguished experimentally. However, a model of pure terminations is known to be inadequate because these surfaces exhibit a high degree of spatial heterogeneity and point disorder. Here, in this study, we perform a spectromicroscopy study of the surface chemistry and surface electronic structure using photoemission measurements in combination with first-principles calculations of core levels. We identify an intermediate region with properties distinct from both the sulfur and tin terminations, and demonstrate that the spectral features in this region can be associated with a disordered termination with a varying density of surface tin vacancies. This work establishes heuristics for identifying variable surface disorder using photoemission, an important prerequisite to experimentally establishing the behavior of momentum-space topological surface features subject to variable surface disorder on a single cleave.

Sreedhar, Sudheer Anand [Univ. of California, Davi↗

DOE OSTI2025

Studying QED 3 with radial quantization on the lattice: Free limit

To investigate the three-dimensional quantum electrodynamics in the radial quantization on the lattice, the lattice action is constructed and the free limit is studied on 𝑆 2 × ℝ. With the overlap fermion, it is numerically verified that the important symmetries of the theory can be realized on the lattice. The analytic correlators are derived and compared to the lattice results, which agree including the overall normalization. The 𝑂⁡(𝑎 2 ) scaling is confirmed toward the analytic value in the continuum limit, and the number of reproduced excited states is estimated heuristically for the first few refinement levels. Our study helps us identify the features of the theory that we can study on the icosahedral lattice without fine-tuning.

Boyle, Peter A. [Brookhaven National Laboratory (B↗

DOE OSTI2025

Dual View of the Z 2 -Gauged XY Model in 3D

The 𝑍 2 -gauged XY model is of long-standing interest both in the context of nematic order, and the study of fractionalization and superconductivity. This Letter presents heuristic arguments that no deconfinement of the XY field occurs in this model and presents results of a large-scale Monte Carlo simulations on a cubic lattice that are consistent with this conclusion. Furthermore, the correlation radius determining the confinement is found to be growing rapidly as a function of the parameters in the phase featuring the nematic order. Thus, mesoscopic properties of the system can mimic deconfinement with high accuracy in some part of the phase diagram.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2025

Quantum description of wave dark matter

We outline a fundamentally quantum description of bosonic dark matter (DM) from which the conventional classical-wave picture emerges in the limit 𝑚 ≪10 eV. As appropriate for a quantum system, we start from the density matrix, which encodes the full information regarding the possible measurements we could make of DM and their fluctuations. Following fundamental results in quantum optics, we argue that for DM it is most likely that the density matrix takes the explicitly mixed form of a Gaussian over the basis of coherent states. Deviations from this would generate non-Gaussian fluctuations in DM observables, allowing a direct probe of the quantum state of DM. Our quantum optics–inspired approach allows us to rigorously define and interpret various quantities that are often only described heuristically, such as the coherence time or length. The formalism further provides a continuous description of DM through the wave-particle transition, which we exploit to study how density fluctuations over various physical scales evolve between the two limits and to reveal the unique behavior of DM near the boundary of the wave and particle descriptions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

Bootstrap-determined p values in lattice QCD

We present a general method to determine the probability that stochastic Monte Carlo data, in particular those generated in a lattice QCD calculation, would have been obtained were that data drawn from the distribution predicted by a given theoretical hypothesis. Such a probability, or p -value, is often used as an important heuristic measure of the validity of that hypothesis. The proposed method offers the benefit that it remains usable in cases where the standard Hotelling T 2 methods based on the conventional χ 2 statistic do not apply, such as for uncorrelated fits. Specifically, we analyze q 2 , defined as the correlated χ 2 statistic obtained using an arbitrary covariance matrix estimator, and show how to use the bootstrap as a data-driven method to determine the expected distribution of q 2 for a given hypothesis with minimal assumptions. This distribution can then be used to determine the p -value for a fit to the data. We also describe a bootstrap approach for quantifying the impact upon this p -value of estimating population parameters from a single ensemble of N samples. The overall method is accurate up to a 1 / N bias which we do not attempt to quantify. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Competition between roughness and strength for scale-dependent surfaces

Rocks famously have scale-dependent strength, yet the actual dependence is notoriously hard to measure or incorporate into any theoretical framework. Natural rough surfaces present an opportunity to solve the problem. Surfaces sliding in shear evolve as protrusions collide. These asperities can deform or break, thus creating a new surface shape. In particular, natural surfaces have roughness at all scales as well as scale-dependent strength. Based on a scaling analysis, we have previously suggested that the scale-dependent aspect ratio of steady-state surfaces should be proportional to the scale-dependent shear strain at yield. If true, scale-dependent strength could easily be inferred from natural surfaces. Thus, moving beyond the scaling argument to a rigorous treatment of scale-dependent strength for multiscale rough surfaces in shear is important. However, analytic frameworks for analyzing multiscale problems are challenging, as conventional continuum mechanics typically involves a single value for a material property across scales. Here, in this work, we build on the formalism of Persson (2001) that presents a method to compute contact area for rough surfaces with a prescribed topographic spectrum using a stochastic differential equation. The Persson formalism allows for plastic yield under normal loading of otherwise elastic materials and leaves open the possibility of scale-dependent yield stress. In this study, we pursue this route to develop a theory and numerical results for the yielding of a rough, elastoplastic surface with scale-dependent yield stress. Here, we examine surfaces for which the power spectrum of the topography 𝐶 and yield stress 𝑌 follow power laws as a function of scale 𝜆, such that 𝐶∼𝜆 −𝑚 and 𝑌∼𝜆 −𝑛 , respectively. In this formal treatment of the problem, we focus on surfaces in contact and the resulting yield and do not impose shear. Numerical solutions show that the deviation from the elastic scaling solution is bounded as expected by the prior 1D heuristic scaling argument that anticipates the Hurst exponent as 1−𝑛. We also show that the plasticity is expected to erode the contacts if 𝑚 is lower than 𝑛−3, which corresponds to a Hurst exponent lower than 1−𝑛/2. This result is rigorously sound for 2D, i.e., realistic surfaces, and quantitatively different than the prior scaling argument. The theory now permits a correspondingly quantitative approach to interpreting natural surfaces.

elasticity↗

DOE OSTI2024

Adiabatic quantum imaginary time evolution

We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time evolution does not require quantum state tomography during its runtime and, unlike standard adiabatic state preparation, the final Hamiltonian is not the system Hamiltonian. Instead, the algorithm obtains the adiabatic Hamiltonian by integrating a classical differential equation that ensures that one follows the imaginary time evolution state trajectory. We introduce some heuristics that allow this protocol to be implemented on quantum architectures with limited resources. We explore the performance of this algorithm via classical simulations in a one-dimensional spin model and highlight essential features that determine its cost, performance, and implementability for longer times, and compare to the original quantum imaginary time evolution for ground-state preparation. More generally, our algorithm expands the range of states accessible to adiabatic state preparation methods beyond those that are expressed as ground states of simple explicit Hamiltonians. Published by the American Physical Society 2024

Hejazi, Kasra (ORCID:000000032349478X)↗

DOE OSTI2026

Generalized master equation for particle transport in binary random media with renewal statistics

Particle transport in binary stochastic mixtures is classically modeled assuming Markovian or exponential mixing statistics but in many applications material memory invalidates the Markov assumption. For non-Markovian mixing characterized by alternating renewal processes, a transport-theoretic framework is presented that provides an exact description of transport in nonscattering random binary media with general non-exponential statistics. Our approach is to Markovianize the problem by augmenting the {material type, particle flux} state space with the age or distance from the last interface. A Chapman-Kolmogorov equation is formulated for the joint probability density of the material type, particle flux, and age, and subsequently reduced to a generalized Master equation (GME) in differential form. This constitutes the primary result of this work. A state-updating Monte Carlo algorithm consistent with the GME is developed and benchmarked against analytical solutions for multiple chord-length laws. For purely absorbing renewal statistical media, the GME reproduces analytical benchmarks for the equilibrium age distribution, interior mean/variance of material-conditioned fluxes, and boundary transmittance. Simulations further demonstrate that a Markov (exponential) approximation of non-exponential statistics can introduce large errors in transmittance and interior flux profiles. Lastly, the reintroduction of memory due to scattering is briefly addressed through heuristic considerations.

Fluctuations & noise↗

DOE OSTI2026

Fast Active-Set Thresholding Method for Nonnegative Least Squares

Nonnegative Least Squares (NNLS) is a fundamental constrained optimization problem encountered in many applications such as image deblurring, signal processing, nonnegative matrix factorization, magnetic microscopy, and hyperspectral imaging. Active-set based methods are a common class of algorithms for solving NNLS which identify the optimal variable set of the NNLS solution. They do so by iteratively solving a series of unconstrained least squares problems, identifying which variables violate the nonnegativity constraints, and then swapping variables in/out of consideration until the optimal set of variables is found. Several variations improving upon this method exist in the literature. In this work, we propose an active-set swap heuristic which further improves upon existing active-set based methods for NNLS. Our optimizations are based upon adding multiple variables to the passive set within a threshold of the smallest gradient value and removing variables within a similar threshold of the closest boundary constraint. We leverage these optimizations to yield a Fast Active-Set Thresholding NNLS (FAST-NNLS) algorithm which significantly outperforms the existing state-of-the-art NNLS algorithms for a wide range of problems. Rigorous convergence guarantees are proven for the proposed method. We demonstrate the effectiveness of our proposed method on multiple synthetic datasets and two realworld text analysis applications. In doing so, we present the most comprehensive NNLS solver comparison in the literature to date.

Cobb, Benjamin [Georgia Institute of Technology]↗