SEARCH · Search NASA

Results for “classical simulation”

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 433 records · Page 24

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Dominant balance-based adaptive mesh refinement for incompressible fluid flows

This work introduces a novel adaptive mesh refinement (AMR) method that utilizes dominant balance analysis (DBA) for efficient and accurate grid adaptation in computational fluid dynamics (CFD) simulations. The proposed method leverages a Gaussian mixture model (GMM) to classify grid cells into active and passive regions based on the dominant physical interactions within the equation space. By modeling truncation error probabilistically from discretized terms, the method identifies regions of high interaction where numerical accuracy is most sensitive to resolution. Unlike traditional AMR strategies, this approach does not rely on heuristic-based sensors or user-defined thresholds, providing a fully automated and problem-independent framework for AMR. Applied to the incompressible Navier-Stokes equations for steady and unsteady flow past a cylinder, the DBA-based AMR method achieves comparable accuracy to high-resolution grids while reducing computational costs by up to 70 %. The validation highlights the method’s effectiveness in capturing complex flow features while minimizing grid cells, directing computational resources toward regions with the most critical dynamics. This modular and scalable strategy is adaptable to a wide range of applications, presenting a promising tool for efficient high-fidelity simulations in CFD and other multiphysics domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Reduced-Order Modeling of Multigroup Neutron Cross Sections for High-Temperature Gas-cooled Reactors

Abstract – Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.

42 - ENGINEERING↗

DOE OSTI2025

Lectures on statistical mechanics

Presented here is a transcription of the lecture notes from Professor Allan N. Kaufman’s graduate statistical mechanics course Physics 212A and 212B at the University of California Berkeley from the 1972–1973 academic year. 212A addressed equilibrium statistical mechanics with topics: fundamentals (micro-canonical and sub-canonical ensembles, adiabatic law and action conservation, fluctuations, pressure, and virial theorem), classical fluids and other systems (equation of state, deviations from ideality, virial coefficients and van der Waals potential, canonical ensemble and partition function, quasistatic evolution, grand-canonical ensemble and partition function, chemical potential, simple model of a phase transition, quantum virial expansion, numerical simulation of equations of state, and phase transition), chemical equilibrium (systems with multiple species and chemical reactions, law of mass action, Saha equation, chemical equilibrium including ionization and excited states), and long-range interactions (including Coulomb, dipole, and gravitational interactions, Debye–Hückel theory, and shielding). 212B addressed nonequilibrium statistical mechanics with topics: fundamentals (definitions: realizations, moments, characteristic function, and discrete variables), Brownian motion (Langevin equation, fluctuation–dissipation theorem, spatial diffusion, Boltzmann’s H-theorem), Liouville and Klimontovich equations, Landau equation (derivation, elaboration, and H-theorem, and irreversibility), Markov processes and Fokker–Planck equation (derivations of the Fokker–Planck equation and a master equation), linear response and transport theory (linear Boltzmann equation, linear response theory of Kubo and Mori, relation of entropy production to electrical conductivity, transport relations and coefficients, normal mode solutions of the transport equations, sketch of a generalized Langevin equation method for transport theory), and an introduction to nonequilibrium quantum statistical mechanics.

plasma dynamics↗

DOE OSTI2025

Metastability and Ostwald step rule in the crystallisation of diamond and graphite from molten carbon

Abstract Experimental challenges in determining the phase diagram of carbon at temperatures and pressures near the graphite-diamond-liquid triple point are often related to the persistence of metastable crystalline or glassy phases, superheated crystals, or supercooled liquids. A deeper understanding of the crystallisation kinetics of diamond and graphite is crucial for effectively interpreting the outcomes of these experiments. Here, we reveal the microscopic mechanisms of diamond and graphite nucleation from liquid carbon through molecular simulations with first-principles machine learning potentials. Our simulations accurately reproduce the experimental phase diagram of carbon near the triple point and show that liquid carbon crystallises spontaneously upon cooling. Metastable graphite crystallises in the domain of diamond thermodynamic stability at pressures above the triple point. Furthermore, whereas diamond crystallises through a classical nucleation pathway, graphite follows a two-step process in which low-density fluctuations forego ordering. Calculations of the nucleation rates of the two competing phases confirm this result and reveal a manifestation of Ostwald’s step rule, where the strong metastability of graphite hinders the transformation to the stable diamond phase. Our results provide a key to interpreting melting and recrystallisation experiments and shed light on nucleation kinetics in polymorphic materials with deep metastable states.

Science & Technology - Other Topics↗

DOE OSTI2024

Adsorption Thermodynamics for Process Simulation

Adsorption has rapidly evolved in recent decades and is an established separation technology extensively practiced in gas separation industries and others. However, rigorous thermodynamic modeling of multicomponent adsorption equilibrium remains elusive, and industrial practitioners rely heavily on expensive and time-consuming trial-and-error pilot studies to develop adsorption units. Here, this article highlights the need for rigorous adsorption thermodynamic models and the limitations and deficiencies of existing models such as the extended Langmuir isotherm, dual-process Langmuir isotherm, and adsorbed solution theory. It further presents a series of recent advances in the generalization of the classical Langmuir isotherm of single-component adsorption by deriving an activity coefficient model to account for the adsorbed phase adsorbate–adsorbent interactions, substituting adsorbed phase adsorbate and vacant site concentrations with activities, and extending to multicomponent competitive adsorption equilibrium, both monolayer and multilayer. Requiring a minimum set of physically meaningful model parameters, the generalized Langmuir isotherm for monolayer adsorption and the generalized Brunauer–Emmett–Teller isotherm for multilayer adsorption address various thermodynamic modeling challenges including adsorbent surface heterogeneity, isosteric enthalpies of adsorption, BET surface areas, adsorbed phase nonideality, adsorption azeotrope formation, and multilayer adsorption. Also discussed is the importance of quality adsorption data that cover sufficient temperature, pressure, and composition ranges for reliable determination of the model parameters to support adsorption process simulation, design, and optimization.

09 BIOMASS FUELS↗

DOE OSTI2025

Conditioned quantum-assisted deep generative surrogate for particle-calorimeter interactions

Particle collisions at accelerators like the Large Hadron Collider (LHC), recorded by experiments such as ATLAS and CMS, enable precise standard model measurements and searches for new phenomena. Simulating these collisions significantly influences experiment design and analysis but incurs immense computational costs, projected at millions of CPU-years annually during the high luminosity LHC (HL-LHC) phase. Currently, simulating a single event with Geant4 consumes around 1000 CPU seconds, with calorimeter simulations especially demanding. To address this, we propose a conditioned quantum-assisted generative model, integrating a conditioned variational autoencoder (VAE) and a conditioned restricted Boltzmann machine (RBM). Our RBM architecture is tailored for D-Wave’s Pegasus-structured advantage quantum annealer for sampling, leveraging the flux bias for conditioning. This approach combines classical RBMs as universal approximators for discrete distributions with quantum annealing’s speed and scalability. We also introduce an adaptive method for efficiently estimating effective inverse temperature, and validate our framework on Dataset 2 of CaloChallenge.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

How Rigid Are Anthranilamide Molecular Electrets?

As important as molecular electrets are for electronic materials and devices, conformational fluctuations strongly impact their macrodipoles and intrinsic properties. Herein, we employ molecular dynamics (MD) simulations with the polarizable charge equilibrium (PQEq) method to investigate the persistence length (L P ) of molecular electrets composed of anthranilamide (Aa) residues. The PQEq-MD dissipates the accepted static notions about Aa macromolecules, and L P represents the shortest Aa rigid segments. The classical model with a single L P value does not describe these oligomers. Introducing multiple L P values for the same macromolecule follows the observed trends and discerns the enhanced rigidity in their middle sections from the reduced stiffness at their terminal regions. Furthermore, L P distinctly depends on solvent polarity. The Aa oligomers maintain extended conformations in nonpolar solvents with L P exceeding 4 nm, while in polar media, increased conformational fluctuations reduce L P to about 2 nm. These characteristics set key guidelines about the utility of Aa conjugates for charge-transfer systems within organic electronics and energy engineering.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2026

Real-time estimators for scattering observables: A full account of finite-volume errors for quantum simulation

The real-time correlators of quantum field theories can be directly probed through new approaches to simulation, such as quantum computing and tensor networks. This provides a new framework for computing scattering observables in lattice formulations of strongly interacting theories, such as lattice quantum chromodynamics. In this paper, we prove that the proposal of real-time estimators of scattering observables is universally applicable to all scattering observables of gapped quantum field theories. All finite-volume errors are exponentially suppressed, and the rate of this suppression is controlled by the regulator considered, namely, a displacement of the spectrum of the theory into the complex plane. A partial restoration of Lorentz symmetry by averaging over different boosts gives an additional suppression of finite volume errors. Our results also apply to the simulation of wave packet scattering, where a similar averaging is performed to construct the wave packets that regulate the finite volume effects. This result represents a necessary key step toward determining a broad class of scattering observables via quantum computing that are currently inaccessible via classical computing. Such observables are relevant for various applications, including hadron spectroscopy, hadron structure, and precision tests of the Standard Model. We also comment on potential applications of our results to traditional computational schemes.

Burbano, Ivan M. [University of California, Berkel↗

DOE OSTI2025

On nonlocal problems with Neumann boundary conditions: scaling and convergence for nonlocal operators and solutions

Formulations of Neumann-type boundary conditions for boundary value problems in the nonlocal framework are beset with difficulties, some related to the choice of a proper scaling. Here we identify a space-dependent scaling for a nonlocal Neumann operator, for which we prove linear in δ (δ being the radius for the support for the kernel) convergence of the Neumann operator and $\mathcal{O}$(δ 2 ) convergence of solutions to their classical counterparts. The pointwise-like convergence of the nonlocal normal operator is cast as a new type of two-scale operator-point convergence, which we call condensated convergence . The results hold for general integrable kernels, a setting which is favored in numerical simulations. We support this analysis with numerical convergence studies using a piecewise linear discontinuous Galerkin discretization and show an $\mathcal{O}$(δ 2 ) rate of convergence of solutions, also exhibiting an $\mathcal{O}$(h 2 ) convergence, where h is the mesh size.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method

While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Analog-to-digital converter based on voltage-controlled superconducting devices

The increasing demand for cryogenic electronics in superconducting and quantum computing systems calls for ultra-energy-efficient data conversion architectures that remain functional at deep cryogenic temperatures. Here, in this work, we present the first design of a voltage-controlled superconducting flash analog-to-digital converter (ADC) based on a voltage-controlled quantum-enhanced Josephson junction field-effect transistor (JJFET). Exploiting its strong gate tunability and transistor-like behavior, the JJFET offers a scalable alternative to conventional current-controlled superconducting devices while aligning naturally with CMOS-style design methodologies. Building on our previously developed Verilog-A compact model calibrated to experimental data, we design and simulate a three-bit JJFET-based flash ADC targeted for integration within cryogenic control and readout circuitry in quantum computing. The core comparator block is realized through careful bias current selection and augmented with a three-terminal nanocryotron to precisely define reference voltages. Cascaded JJFET comparators ensure robust voltage gain, cascadability, and logic-level restoration across stages. Simulation results demonstrate accurate quantization behavior with ultra-low power dissipation, underscoring the feasibility of voltage-driven superconducting mixed-signal circuits. This work establishes a critical step toward unifying superconducting logic and data conversion, paving the way for scalable cryogenic architectures in quantum–classical co-processors, low-power artificial intelligence accelerators, and next-generation energy-constrained computing platforms.

Analog-to-digital converter↗

DOE OSTI2025

The importance of accounting for the Tolman correction to surface tension for nucleation and growth modeling of Fe clusters

Gibbs free energies of clusters are required for predictive modeling of cluster growth during condensation of a cooling vapor. Here, we present a straightforward method of calculating free energies of cluster formation using the data from molecular dynamics (MD) simulations. We apply this method to iron clusters having from 2 to 100 atoms. The energies obtained are verified by comparing to an MD-simulated equilibrium cluster size distribution in a sub-saturated vapor. We show that these free energies differ significantly from those obtained with a commonly used spherical cluster approximation, which relies on a surface tension coefficient of a flat surface, as it is used in the classical nucleation theory (CNT). We show that the spherical cluster approximation in CNT can be improved by using a cluster-size-dependent Tolman correction for the surface tension. The Tolman length and effective surface tension values were derived for iron clusters, and they significantly differ from the commonly used experimentally measured values. This improved approximation does not account for geometric magic number effects responsible for spikes and troughs in densities of neighbor cluster sizes. Nonetheless, it allows to more accurately model cluster formation from a cooling vapor. It better reproduces the condensation timeline, overall shape of the cluster size distribution, average cluster size, and the distribution width. In contrast, using a constant surface tension coefficient (as done in CNT) resulted in incorrect condensation dynamics and cluster size distributions. The analytical expression for cluster nucleation rate from CNT was updated to account for the size-dependence of cluster surface tension.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Stabilizing Non-Abelian Topological Order Against Heralded Noise via Local Lindbladian Dynamics

An important open question for the current generation of highly controllable quantum devices is understanding which phases can be realized as stable steady states under local quantum dynamics. In this work, we show how robust steady-state phases with both Abelian and non-Abelian mixed-state topological order can be stabilized, in two spatial dimensions, against generic “heralded” noise using active dynamics that incorporate measurement and feedback, modeled as a fully local Lindblad master equation. These topologically ordered steady states are two-way connected to pure topologically ordered ground states using local quantum channels, and preserve quantum information for a time that is exponentially large in the system size. Specifically, we present explicit constructions of families of local Lindbladians for both Abelian (ℤ 2 ) and non-Abelian (𝐷 4 ) topological order whose steady states host mixed-state topological order when the noise is below a threshold strength. As the noise strength is increased, these models exhibit first-order transitions to intermediate mixed-state phases where they encode robust classical memories, followed by (first-order) transitions to a trivial steady state at high noise rates. When the noise is imperfectly heralded, steady-state order disappears but our active dynamics significantly enhances the lifetime of the encoded logical information. To carry out the numerical simulations for the non-Abelian 𝐷 4 case, we introduce a generalized stabilizer tableau formalism that permits efficient simulation of the non-Abelian Lindbladian dynamics.

Monte Carlo methods↗

DOE OSTI2025

Confinement performance predictions for a high field axisymmetric tandem mirror

This paper presents a Hammir tandem mirror confinement performance analysis based on Realta Fusion’s first-of-a-kind model for axisymmetric magnetic mirror fusion performance. This model uses an integrated end plug simulation model including, heating, equilibrium and transport combined with a new formulation of the plasma operation contours (POPCONs) technique for the tandem mirror central cell. Using this model in concert with machine learning optimization techniques, it is shown that an end plug utilizing high temperature superconducting magnets and modern neutral beams enables a classical tandem mirror pilot plant producing a fusion gain Q > 5. The approach here represents an important advance in tandem mirror design. The high-fidelity end plug model enables calculations of heating and transport in the highly non-Maxwellian end plug to be made more accurately. The detailed end plug modelling performed in this work has highlighted the importance of classical radial transport and neutral beam absorption efficiency on end plug viability. The central cell POPCON technique allows consideration of a wide range of parameters in the relatively simple near-Maxwellian central cell, facilitating the selection of more optimal central cell plasmas. These advances make it possible to find more conservative classical tandem mirror fusion pilot plant operating points with lower temperatures, neutral beam energies and end plug performance requirements than designs in the literature. Despite being more conservative, it is shown that these operating points have sufficient confinement performance to serve as the basis of a viable fusion pilot plant provided that they can be stabilized against magnetohydrodynamic and trapped particle modes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

Interferometric binary phase estimations

We propose an interferometric scheme where each photon returns one bit of the binary expansion of an unknown phase. It sets up a method for estimating the phase value at arbitrary uncertainty. This strategy is global, since it requires no prior information, and it achieves the Heisenberg bound independently of the output statistics. We provide simulations and a characterization of this architecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Zero and Finite Temperature Quantum Simulations Powered by Quantum Magic

We introduce a quantum information theory-inspired method to improve the characterization of many-body Hamiltonians on near-term quantum devices. We design a new class of similarity transformations that, when applied as a preprocessing step, can substantially simplify a Hamiltonian for subsequent analysis on quantum hardware. By design, these transformations can be identified and applied efficiently using purely classical resources. In practice, these transformations allow us to shorten requisite physical circuit-depths, overcoming constraints imposed by imperfect near-term hardware. Importantly, the quality of our transformations is t u n a b l e : we define a 'ladder' of transformations that yields increasingly simple Hamiltonians at the cost of more classical computation. Using quantum chemistry as a benchmark application, we demonstrate that our protocol leads to significant performance improvements for zero and finite temperature free energy calculations on both digital and analog quantum hardware. Specifically, our energy estimates not only outperform traditional Hartree-Fock solutions, but this performance gap also consistently widens as we tune up the quality of our transformations. In short, our quantum information-based approach opens promising new pathways to realizing useful and feasible quantum chemistry algorithms on near-term hardware.

Physics↗

DOE OSTI2025

Spin-informed universal graph neural networks for simulating magnetic ordering

The screening and discovery of magnetic materials are hindered by the computational cost of first-principles density-functional theory (DFT) calculations required to find the ground state magnetic ordering. Although universal machine-learning interatomic potentials (uMLIPs), also known as atomistic foundation models, offer high-fidelity models of many atomistic systems with significant speedup, they currently lack the inputs required for predicting magnetic ordering. In this work, we present a data-efficient, spin-informed graph neural network framework that incorporates spin degrees of freedom as inputs and preserves physical symmetries, extending the functionality of uMLIPs to simulate magnetic orderings. This framework speeds up DFT calculations through better initial guesses for magnetic moments, determines the ground-state ordering of bulk materials and even generalizes to magnetic ordering in surfaces. Furthermore, we implement a closed-loop anomaly detection approach that effectively addresses the classic "chicken-and-egg" problem of creating a high-quality dataset while developing a uMLIP, unearthing anomalies in large benchmark datasets and boosting model accuracy.

Xu, Wenbin↗

DOE OSTI2025

Increasing the hardness of posiform planting using random QUBOs for programmable quantum annealer benchmarking

Posiform planting is a method for constructing QUBO instances with a unique planted solution that can be tailored to arbitrary connectivity graphs. In this study we investigate making posiform planted QUBOs computationally harder by fusing many smaller random Ising models, whose global minimum is computed classically, with posiform planted QUBOs. The unique ground state of the resulting QUBO is the concatenation of (exactly one of) the ground states of each smaller problem. Our method generates QUBO instances that have a unique solution, are native to the hardware graph, and have tunable computational hardness. We use our QUBOs to benchmark three D-Wave quantum annealing processors (with 563–5627 qubits), and compare them against simulated annealing and Gurobi. Surprisingly, we find that the D-Wave ground state sampling success rate is not dependent on the glued random QUBO size, and that some QUBO classes are solved at high success rates at short annealing times on the Zephyr processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗