Energy transport between heat baths with oscillating temperatures
Not Available
SEARCH · Engineering Papers
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.
Not Available
The possibility of “orbitally selective Mott transitions” within a multiband Hubbard model, in which one orbital with large on-site electron-electron repulsion U 1 is insulating and another orbital, to which it is hybridized, with small U –1 , is metallic, is a problem of long-standing debate and investigation. In this paper we study an analogous phenomenon, the coexistence of metallic and insulating bands in a system of orbitals with different electron-phonon coupling. To this end, we examine two variants of the bilayer Holstein model: a uniform bilayer and a “Holstein-metal interface” where the electron-phonon coupling, λ, is zero in the “metallic” layer. In the uniform bilayer Holstein model, charge density wave (CDW) order dominates at small interlayer hybridization t 3 , but decreases and eventually vanishes as t 3 grows, providing a charge analog of singlet (spin liquid) physics. In the interface case, we show that CDW order penetrates into the metal layer and forms long-range CDW order at an intermediate ratio of inter- to intralayer hopping strengths, 1.4 ≲ t 3 /t ≲ 3.4. Furthermore, this is consistent with the occurrence of an “orbitally selective CDW” regime at weak t3 in which the layer with λ 1 ≠ 0 exhibits long-range charge order, but the “metallic layer” with λ –1 = 0, to which it is hybridized, does not.
We report the first numerical prediction of a “spin microemulsion”—a phase with undulating spin domains resembling classical bicontinuous oil-water-surfactant emulsions—in two-dimensional systems of spinor Bose-Einstein condensates with isotropic Rashba spin-orbit coupling. Using field-theoretic numerical simulations, we investigated the melting of a low-temperature stripe phase with supersolid character and find that the stripes lose their superfluidity at elevated temperature and undergo a Kosterlitz-Thouless-like transition into a spin microemulsion. Momentum distribution calculations highlight a thermally broadened occupation of the Rashba circle of low-energy states with macroscopic and isotropic occupation around the ring. Here, we provide a finite-temperature phase diagram that positions the emulsion as an intermediate, structured isotropic phase with residual quantum character before transitioning at higher temperature into a structureless normal fluid.
Abstract This study focuses on addressing the inverse source problem associated with the parabolic equation. We rely on sparse boundary flux data as our measurements, which are acquired from a restricted section of the boundary. While it has been established that utilizing sparse boundary flux data can enable source recovery, the presence of a limited number of observation sensors poses a challenge for accurately tracing the inverse quantity of interest. To overcome this limitation, we introduce a sampling algorithm grounded in Langevin dynamics that incorporates dynamic sensors to capture the flux information. Furthermore, we propose and discuss two distinct dynamic sensor migration strategies. Remarkably, our findings demonstrate that even with only two observation sensors at our disposal, it remains feasible to successfully reconstruct the high-dimensional unknown parameters.
Sampling from probability distributions of the form 𝝈 ∝ e −𝜷V , where V is a continuous potential, is a fundamental task across physics, chemistry, biology, computer science, and statistics. However, when V is nonconvex, the resulting distribution becomes non-logconcave, and classical methods such as Langevin dynamics often exhibit poor performance. We introduce a quantum algorithm that provably accelerates a broad class of continuous-time sampling dynamics. For Langevin dynamics, our method encodes the target Gibbs measure into the amplitudes of aquantum state, identified as the kernel of a block matrix derived from a factorization of the Witten Laplacian operator. This connection enables Gibbs sampling via singular value thresholding and yields up to a quartic quantum speedup over best-knownclassical Langevin-based methods in the non-logconcave setting. Building on this framework, we further develop the first quantum algorithm that accelerates replica exchange Langevin diffusion, a widely used method for sampling from complex, rugged energy landscapes.
Linear-scaling techniques for Kohn–Sham density functional theory are essential to describe the ground state properties of extended systems. Still, these techniques often rely on the localization of the density matrix or accurate embedding approaches, limiting their applicability. In contrast, stochastic density functional theory (sDFT) achieves linear- and sub-linear scaling by statistically sampling the ground state density without relying on embedding or imposing localization. In return, ground state observables, such as the forces on the nuclei, fluctuate in sDFT, making optimizing the nuclear structure a highly non-trivial problem. In this work, we combine the most recent noise-reduction schemes for sDFT with stochastic optimization algorithms to perform structure optimization within sDFT. We compare the performance of the stochastic gradient descent approach and its variations (stochastic gradient descent with momentum) with stochastic optimization techniques that rely on the Hessian, such as the stochastic Broyden–Fletcher–Goldfarb–Shanno algorithm. In conclusion, we further provide a detailed assessment of the computational efficiency and its dependence on the optimization parameters of each method for determining the ground state structure of bulk silicon with varying supercell dimensions.
We numerically investigate an adaptive version of the parareal algorithm in the context of molecular dynamics. This adaptive variant has been originally introduced in [1]. We focus here on test cases of physical interest where the dynamics of the system is modelled by the Langevin equation and is simulated using the molecular dynamics software LAMMPS. In this work, the parareal algorithm uses a family of machine-learning spectral neighbor analysis potentials (SNAP) as fine, reference, potentials and embedded-atom method potentials (EAM) as coarse potentials. We consider a self-interstitial atom in a tungsten lattice and compute the average residence time of the system in metastable states. Our numerical results demonstrate significant computational gains using the adaptive parareal algorithm in comparison to a sequential integration of the Langevin dynamics. We also identify a large regime of numerical parameters for which statistical accuracy is reached without being a consequence of trajectorial accuracy.
Here, this study overviews and extends a recently developed stochastic finite-temperature Kohn-Sham density functional theory to study warm dense matter using Langevin dynamics, specifically under periodic boundary conditions. The method's algorithmic complexity exhibits nearly linear scaling with system size and is inversely proportional to the temperature. Additionally, a linear-scaling stochastic approach is introduced to assess the Kubo-Greenwood conductivity, demonstrating exceptional stability for dc conductivity. Utilizing the developed tools, we investigate the equation of state, radial distribution, and electronic conductivity of hydrogen at a temperature of 30 000 K. As for the radial distribution functions, we reveal a transition of hydrogen from gaslike to liquidlike behavior as its density exceeds 4 g/cm 3 . As for the electronic conductivity as a function of the density, we identified a remarkable isosbestic point at frequencies around 7 eV, which may be an additional signature of a gas-liquid transition in hydrogen at 30 000 K.
In the limit of small trial moves the Metropolis Monte Carlo algorithm is equivalent to gradient descent on the energy function in the presence of Gaussian white noise. This observation was originally used to demonstrate a correspondence between Metropolis Monte Carlo moves of model molecules and overdamped Langevin dynamics, but it also applies in the context of training a neural network: making small random changes to the weights of a neural network, accepted with the Metropolis probability, with the loss function playing the role of energy, has the same effect as training by explicit gradient descent in the presence of Gaussian white noise. We explore this correspondence in the context of a simple recurrent neural network. We also explore regimes in which this correspondence breaks down, where the gradient of the loss function becomes very large or small. In these regimes the Metropolis algorithm can still effect training, and so can be used as a probe of the loss function of a neural network in regimes in which gradient descent struggles. We also show that training can be accelerated by making purposely-designed Monte Carlo trial moves of neural-network weights.
Here, the Deep Operator Network (DeepONet) is a neural network architecture used to approximate operators, including the solution operator of parametric PDEs. DeepONets have shown remarkable approximation ability. However, the performance of DeepONets deteriorates when the training data is polluted with noise, a scenario that occurs in practice. To handle noisy data, we propose a Bayesian DeepONet based on replica exchange Langevin diffusion (reLD). Replica exchange uses two particles. The first particle trains a DeepONet to exploit the loss landscape and make predictions. The other particle trains a different DeepONet to explore the loss landscape and escape local minima via swapping. Compared to DeepONets trained with state-of-the-art gradient-based algorithms (e.g., Adam), the proposed Bayesian DeepONet greatly improves the training convergence for noisy scenarios and accurately estimates the uncertainty. To further reduce the high computational cost of the reLD training of DeepONets, we propose (1) an accelerated training framework that exploits the DeepONet's architecture to reduce its computational cost up to 25% without compromising performance and (2) a transfer learning strategy that accelerates training DeepONets for PDEs with different parameter values. Finally, we illustrate the effectiveness of the proposed Bayesian DeepONet using four parametric PDE problems.
Abstract The numerical estimation of the position of the water table in unconfined aquifers is important for many practical applications. Its determination through observations or analytical methods is restricted to a few cases. Therefore, it is often estimated through numerical simulations, which may be affected by numerical artifacts and/or poor stability. We use MODFLOW to estimate the position of the water table for a seemingly simple example problem and demonstrate difficulties that can be faced when performing this kind of numerical simulation. We explain the causes for the numerical challenges that originate from the properties of the mathematical equations that must be solved. Based on the results of more than 600 steady‐state simulations, we show how the stability of the numerical solution can be affected by the values of physical parameters that define the problem (e.g., recharge rate, anisotropy ratio, and other parameters that control the numerical algorithm such as settings of the linear and nonlinear solution methods). Finally, we comment on some best practices to apply numerical simulations to estimate the water table position.
While representation learning has been central to the rise of machine learning and artificial intelligence, a key problem remains in making the learnt representations meaningful. For this the typical approach is to regularize the learned representation through prior probability distributions. However such priors are usually unavailable or are ad hoc. To deal with this, recent efforts have shifted towards leveraging the insights from physical principles to guide the learning process. In this spirit, we propose a purely dynamics-constrained representation learning framework. Instead of relying on predefined probabilities, we restrict the latent representation to follow overdamped Langevin dynamics with a learnable transition density — a prior driven by statistical mechanics. We show this is a more natural constraint for representation learning in stochastic dynamical systems, with the crucial ability to uniquely identify the ground truth representation. We validate our framework for different systems including a real-world fluorescent DNA movie dataset. Here, we show that our algorithm can uniquely identify orthogonal, isometric and meaningful latent representations.
Auxiliary-field quantum Monte Carlo (AFQMC) is typically formulated as an open-ended random walk in an overcomplete space of Slater determinants, implemented through a Langevin equation. However, the explicit form of the underlying Fokker-Planck equation governing the walker population distribution has remained unknown. Here, in this Letter, we derive the Fokker-Planck equation for AFQMC and propose a novel numerical scheme to solve it. The solution of the Fokker-Planck equation reveals the wave function actually sampled by the AFQMC algorithm. Interestingly, we find that even when the exact ground state is used as a guiding wave function in constrained path AFQMC, contrary to the common assumption, the wave function sampled by AFQMC is not exact. Beyond clarifying several fundamental aspects of AFQMC, the availability of a Fokker-Planck equation formulation opens new avenues for systematically improving its accuracy, which we outline in this Letter.
A novel, drag-diffusion Langevin method of hybrid, kinetic-fluid Coulomb scattering in plasmas is presented. Unlike previous methods, the frictional drag is always applied in the simulation frame of reference. The velocity-space diffusion is performed in the stationary-fluid frame of reference when anisotropic, and in the laboratory frame when isotropic. While the general method is mass-ratio independent, we focus on interactions of kinetic-ions and fluid-electrons to show first-order modifications to the electron velocity distribution function that are an important correction for the accurate calculation of electric resistivity. Inclusion of sub-cycling and a limit to the maximum collision frequency is shown to allow for arbitrarily large timesteps without numerical failure. Here the Langevin method is compared with a grid-based binary method and found to require a much less restrictive timestep in cases of ion–electron slowing and temperature equilibration; this finding differs from previous work and is dependent on the mass ratio.
This study introduces an enhanced numerical technique tailored specifically for refining 1D small-angle scattering (SAS) intensity profiles affected by smearing. Our primary objective is to address the resolution blurring commonly encountered in SAS data, particularly in systems with clearly defined correlation peaks whose spread aligns with the width of the resolution function at corresponding Q positions. Unlike previous approaches that expanded the SAS intensity using central moment expansion, the new method focuses on expanding the resolution function itself, thus eliminating artificial oscillations observed in smeared spectra due to limitations inherent in our earlier algorithm. This method is straightforward to implement, computationally efficient and consistently performs well in numerical benchmarking. To illustrate its effectiveness, we present a case study of a lamellar phase characterized by distinct peaks in its small-angle neutron scattering intensities.
A theoretical framework which unifies the conventional Mori--Zwanzig formalism and the approximate Koopman learning of deterministic dynamical systems from noiseless observation is presented. In this framework, the Mori--Zwanzig formalism, developed in statistical mechanics to tackle the hard problem of construction of reduced-order dynamics for high-dimensional dynamical systems, can be considered as a natural generalization of the Koopman description of the dynamical system. We next show that, similar to the approximate Koopman learning methods, data-driven methods can be developed for the Mori--Zwanzig formalism with Mori's linear projection operator. We have developed two algorithms to extract the key operators, the Markov and the memory kernel, using time series of a reduced set of observables in a dynamical system. We have adopted the Lorenz `96 system as a test problem and solved for the above operators. These operators exhibit complex behaviors, which are unlikely to be captured by traditional modeling approaches in Mori--Zwanzig analysis. The nontrivial generalized fluctuation-dissipation relationship, which relates the memory kernel with the two-time correlation statistics of the orthogonal dynamics, was numerically verified as a validation of the solved operators. Here we present numerical evidence that the generalized Langevin equation, a key construct in the Mori--Zwanzig formalism, is more advantageous in predicting the evolution of the reduced set of observables than the conventional approximate Koopman operators.
In light of the recently published complete set of statistically correct Grønbech–Jensen (GJ) methods for discrete-time thermodynamics, we revise a differential operator splitting method for the Langevin equation in order to comply with the basic GJ thermodynamic sampling features, namely, the Boltzmann distribution and Einstein diffusion, in linear systems. This revision, which is based on the introduction of time scaling along with flexibility of a discrete-time velocity attenuation parameter, provides a direct link between the ABO splitting formalism and the GJ methods. This link brings about the conclusion that any GJ method has at least weak second order accuracy in the applied time step. It further helps identify a novel half-step velocity, which simultaneously produces both correct kinetic statistics and correct transport measures for any of the statistically sound GJ methods. Explicit algorithmic expressions are given for the integration of the new half-step velocity into the GJ set of methods. Finally, numerical simulations, including quantum-based molecular dynamics (QMD) using the QMD suite Los Alamos Transferable Tight-Binding for Energetics, highlight the discussed properties of the algorithms as well as exhibit the direct application of robust, time-step-independent stochastic integrators to QMD.
ProtoDUNE Vertical Drift needs a selective triggering algorithm. The detector sits on Earth's surface, so cosmic activity dominates its data. Our goal in this paper is to trigger on neutrino events more robustly than the current deployed Analog-to-Digital Converter Simple Window (ADCSW) model and, eventually, search for signals of Beyond Standard Model (BSM) physics at DUNE as our ultimate North Star objective. As a step towards this goal, we evaluate a Wasserstein Normalized Autoencoder (WNAE) on simulated collection-plane only windows of shape $1\times10\times10$ where Neutrinos act as our BSM-proxy and Cosmic-ray Muons serve as our learned background. The network parameters are fitted using only cosmic-ray muon events as background in order to maintain an unsupervised pipeline. Training uses finite-step Langevin $x^-$ samples, positive-sample reconstruction energy, and an empirical sliced $2$-Wasserstein objective to learn a normalized Boltzmann energy model. We then calibrate on a nominal $5\,\mathrm{Hz}$ operating threshold calculated from cosmic validation data. Both WNAE and ADCSW accept 311 of 194,083 held-out cosmic background events at this $5\,\mathrm{Hz}$ threshold. We found that WNAE accepts 9,677 of 34,634 neutrino-proxy events $(27.9\pm0.24)\%$, compared with 10,076 $(29.1\pm0.24)\%$ for ADCSW, an observed WNAE-minus-ADCSW difference of $-1.15\%$. At another nominal $2\,\mathrm{Hz}$ target threshold, the corresponding efficiencies are $(20.5\pm0.22)\%$ and $(22.6\pm0.22)\%$, respectively. Of the WNAE-selected neutrino proxies at $5\,\mathrm{Hz}$, $(20.8\pm0.4)\%$ of the classified neutrino-proxy events are unique to WNAE, where the uncertainty is an absolute binomial standard error of $0.4\%$.