Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum distributed algorithms”

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

Nonlinear sparse Bayesian learning for physics-based models

This paper addresses the issue of overfitting while calibrating unknown parameters of over-parameterized physics-based models with noisy and incomplete observations. Here, a semi-analytical Bayesian framework of nonlinear sparse Bayesian learning (NSBL) is proposed to identify sparsity among model parameters during Bayesian inversion. NSBL offers significant advantages over machine learning algorithm of sparse Bayesian learning (SBL) for physics-based models, such as 1) the likelihood function or the posterior parameter distribution is not required to be Gaussian, and 2) prior parameter knowledge is incorporated into sparse learning (i.e. not all parameters are treated as questionable). NSBL employs the concept of automatic relevance determination (ARD) to facilitate sparsity among questionable parameters through parameterized prior distributions. The analytical tractability of NSBL is enabled by employing Gaussian ARD priors and by building a Gaussian mixture-model approximation of the posterior parameter distribution that excludes the contribution of ARD priors. Subsequently, type-II maximum likelihood is executed using Newton's method whereby the evidence and its gradient and Hessian information are computed in a semi-analytical fashion. We show numerically and analytically that SBL is a special case of NSBL for linear regression models. Subsequently, a linear regression example involving multimodality in both parameter posterior pdf and model evidence is considered to demonstrate the performance of NSBL in cases where SBL is inapplicable. Next, NSBL is applied to identify sparsity among the damping coefficients of a mass-spring-damper model of a shear building frame. These numerical studies demonstrate the robustness and efficiency of NSBL in alleviating overfitting during Bayesian inversion of nonlinear physics-based models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

THINK OUTSIDE THE COLOR BOX: PROBABILISTIC TARGET SELECTION AND THE SDSS-XDQSOQUASAR TARGETING CATALOG

We present the SDSS-XDQSO quasar targeting catalog for efficient flux-based quasar target selection down to the faint limit of the Sloan Digital Sky Survey (SDSS) catalog, even at medium redshifts (2.5 {approx}< z {approx}< 3) where the stellar contamination is significant. We build models of the distributions of stars and quasars in flux space down to the flux limit by applying the extreme-deconvolution method to estimate the underlying density. We convolve this density with the flux uncertainties when evaluating the probability that an object is a quasar. This approach results in a targeting algorithm that is more principled, more efficient, and faster than other similar methods. We apply the algorithm to derive low-redshift (z < 2.2), medium-redshift (2.2 {le} z {le} 3.5), and high-redshift (z > 3.5) quasar probabilities for all 160,904,060 point sources with dereddened i-band magnitude between 17.75 and 22.45 mag in the 14,555 deg{sup 2} of imaging from SDSS Data Release 8. The catalog can be used to define a uniformly selected and efficient low- or medium-redshift quasar survey, such as that needed for the SDSS-III's Baryon Oscillation Spectroscopic Survey project. We show that the XDQSO technique performs as well as the current best photometric quasar-selection technique at low redshift, and outperforms all other flux-based methods for selecting the medium-redshift quasars of our primary interest. We make code to reproduce the XDQSO quasar target selection publicly available.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Magnitude of speed of sound aberration corrections for ultrasound image guided radiotherapy for prostate and other anatomical sites

Purpose: The purpose of this work is to assess the magnitude of speed of sound (SOS) aberrations in three-dimensional ultrasound (US) imaging systems in image guided radiotherapy. The discrepancy between the fixed SOS value of 1540 m/s assumed by US systems in human soft tissues and its actual nonhomogeneous distribution in patients produces small but systematic errors of up to a few millimeters in the positions of scanned structures. Methods: A correction, provided by a previously published density-based algorithm, was applied to a set of five prostate, five liver, and five breast cancer patients. The shifts of the centroids of target structures and the change in shape were evaluated. Results: After the correction the prostate cases showed shifts up to 3.6 mm toward the US probe, which may explain largely the reported positioning discrepancies in the literature on US systems versus other imaging modalities. Liver cases showed the largest changes in volume of the organ, up to almost 9%, and shifts of the centroids up to more than 6 mm either away or toward the US probe. Breast images showed systematic small shifts of the centroids toward the US probe with a maximum magnitude of 1.3 mm. Conclusions: The applied correction in prostate and liver cancer patients shows positioning errors of several mm due to SOS aberration; the errors are smaller in breast cancer cases, but possibly becoming more important when breast tissue thickness increases.

60 APPLIED LIFE SCIENCES↗

A baseline for ensemble-based, time-resolved inflow reconstruction for a single turbine using large-eddy simulations and latent diffusion models

We are interested in reconstructing winds flowing through a turbine on a second-by-second basis over a 10 min window. Previously, we developed a machine learning algorithm that takes in a snapshot of wind speed measurements and generates ensembles of three-dimensional wind field estimates. Here, we use these estimates as initial conditions in large-eddy simulations and reconstruct atmospheric and turbine response dynamic quantities in a synthetic field campaign. In doing so, we establish a baseline for model validation that future time-aware data assimilation techniques will be compared to. In turbine-free case studies, ground truth wind speeds consistently fall within our estimated wind speed distribution for the first 100 s after the simulation start. In simulations with turbines, the wind estimates show a small bias of 0.10 m s 1 and good correlation of 0.80 during the first 100 s. During this window, our estimates of the Blade 1 bending moment and generator power typically span the ground truth, with the estimate of the former performing better overall. In summary, this approach shows promise as a stand-alone technique for reconstructing real-world inflow and turbine dynamics in 1-2 min windows and as a foundation for future time-aware data assimilation techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic simulation of reaction-diffusion systems: A fluctuating-hydrodynamics approach

Here, we develop numerical methods for stochastic reaction-diffusion systems based on approaches used for fluctuating hydrodynamics (FHD). For hydrodynamic systems, the FHD formulation is formally described by stochastic partial differential equations (SPDEs). In the reaction-diffusion systems we consider, our model becomes similar to the reaction-diffusion master equation (RDME) description when our SPDEs are spatially discretized and reactions are modeled as a source term having Poisson fluctuations. However, unlike the RDME, which becomes prohibitively expensive for an increasing number of molecules, our FHD-based description naturally extends from the regime where fluctuations are strong, i.e., each mesoscopic cell has few (reactive) molecules, to regimes with moderate or weak fluctuations, and ultimately to the deterministic limit. By treating diffusion implicitly, we avoid the severe restriction on time step size that limits all methods based on explicit treatments of diffusion and construct numerical methods that are more efficient than RDME methods, without compromising accuracy. Guided by an analysis of the accuracy of the distribution of steady-state fluctuations for the linearized reaction-diffusion model, we construct several two-stage (predictor-corrector) schemes, where diffusion is treated using a stochastic Crank-Nicolson method, and reactions are handled by the stochastic simulation algorithm of Gillespie or a weakly second-order tau leaping method. We find that an implicit midpoint tau leaping scheme attains second-order weak accuracy in the linearized setting and gives an accurate and stable structure factor for a time step size of an order of magnitude larger than the hopping time scale of diffusing molecules. We study the numerical accuracy of our methods for the Schlögl reaction-diffusion model both in and out of thermodynamic equilibrium. We demonstrate and quantify the importance of thermodynamic fluctuations to the formation of a two-dimensional Turing-like pattern and examine the effect of fluctuations on three-dimensional chemical front propagation. Furthermore, by comparing stochastic simulations to deterministic reaction-diffusion simulations, we show that fluctuations accelerate pattern formation in spatially homogeneous systems and lead to a qualitatively different disordered pattern behind a traveling wave.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal design of one-dimensional photonic crystal back reflectors for thin-film silicon solar cells

For thin-film silicon solar cells (TFSC), a one-dimensional photonic crystal (1D PC) is a good back reflector (BR) because it increases the total internal reflection at the back surface. We used the plane-wave expansion method and the finite difference time domain (FDTD) algorithm to simulate and analyze the photonic bandgap (PBG), the reflection and the absorption properties of a 1D PC and to further explore the optimal 1D PC design for use in hydrogenated amorphous silicon (a-Si:H) solar cells. With identified refractive index contrast and period thickness, we found that the PBG and the reflection of a 1D PC are strongly influenced by the contrast in bilayer thickness. Additionally, light coupled to the top three periods of the 1D PC and was absorbed if one of the bilayers was absorptive. By decreasing the thickness contrast of the absorptive layer relative to the non-absorptive layer, an average reflectivity of 96.7% was achieved for a 1D PC alternatively stacked with a-Si:H and SiO{sub 2} in five periods. This reflectivity was superior to a distributed Bragg reflector (DBR) structure with 93.5% and an Ag film with 93.4%. n-i-p a-Si:H solar cells with an optimal 1D PC-based BR offer a higher short-circuit current density than those with a DBR-based BR or an AZO/Ag-based BR. These results provide new design rules for photonic structures in TFSC.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse-grid, reduced-basis Bayesian inversion: Nonaffine-parametric nonlinear equations

We extend the reduced basis (RB) accelerated Bayesian inversion methods for affine-parametric, linear operator equations which are considered in [16,17] to non-affine, nonlinear parametric operator equations. We generalize the analysis of sparsity of parametric forward solution maps in [20] and of Bayesian inversion in [48,49] to the fully discrete setting, including Petrov–Galerkin high-fidelity (“HiFi”) discretization of the forward maps. We develop adaptive, stochastic collocation based reduction methods for the efficient computation of reduced bases on the parametric solution manifold. The nonaffinity and nonlinearity with respect to (w.r.t.) the distributed, uncertain parameters and the unknown solution is collocated; specifically, by the so-called Empirical Interpolation Method (EIM). For the corresponding Bayesian inversion problems, computational efficiency is enhanced in two ways: first, expectations w.r.t. the posterior are computed by adaptive quadratures with dimension-independent convergence rates proposed in [49]; the present work generalizes [49] to account for the impact of the PG discretization in the forward maps on the convergence rates of the Quantities of Interest (QoI for short). Second, we propose to perform the Bayesian estimation only w.r.t. a parsimonious, RB approximation of the posterior density. Based on the approximation results in [49], the infinite-dimensional parametric, deterministic forward map and operator admit N-term RB and EIM approximations which converge at rates which depend only on the sparsity of the parametric forward map. In several numerical experiments, the proposed algorithms exhibit dimension-independent convergence rates which equal, at least, the currently known rate estimates for N-term approximation. We propose to accelerate Bayesian estimation by first offline construction of reduced basis surrogates of the Bayesian posterior density. The parsimonious surrogates can then be employed for online data assimilation and for Bayesian estimation. They also open a perspective for optimal experimental design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Theoretical Plasma Physics

Lattice Boltzmann algorithms are a mesoscopic method to solve problems in nonlinear physics which are highly parallelized – unlike the direction solution of the original problem. These methods are applied to both fluid and magnetohydrodynamic turbulence. By introducing entropic constraints one can enforce the positive definiteness of the distribution functions and so be able to simulate fluids at high Reynolds numbers without numerical instabilities. By introducing a vector distribution function for the magnetic field one can enforce the divergence free condition on the magnetic field automatically, without the need of divergence cleaning as needed in most direct numerical solutions of the resistive magnetohydrodynamic equations. The principal reason for the high parallelization of lattice Boltzmann codes is that they consist of a kinetic collisional relaxation step (which is purely local) followed by a simple shift of the relaxed data to neighboring lattice sites. In large eddy simulations, the closure schemes are highly nonlocal – the most famous of these schemes is that due to Smagorinsky. Under a lattice Boltzmann representation the Smagorinsky closure is purely local – being simply a particular moment on the perturbed distribution fucntions. After nonlocal fluid moment models were discovered to represent Landau damping, it was found possible to model these fluid models using an appropriate lattice Boltzmann algorithm. The close to ideal parallelization of the lattice Boltzmann codes permitted us to be Gordon Bell finalists on using the Earth Simulation in Japan. We have also been involved in the radio frequency propagation of waves into a tokamak and into a spherical overdense tokamak plasma. Initially we investigated the use of a quasi-optical grill for the launching of lower hybrid waves into a tokamak. It was found that the conducting walls do not prevent the rods from being properly irradiated, the overloading of the quasi-optical grill is not severe with the electric field only being about three times higher than in the ideal case. Moreover, the quasi-optical grill was significantly fewer structural elements that the multijunction grill. Nevertheless there has not been much interest from experimental fusion groups to implementing these structures. Hence we have returned to optimizing the multijunction grill so that the large number of coupling matrix elements can be efficiently evaluated using symmetry arguments. In overdense plasmas, the standard electromagnetic waves cannot propagate into the plasma center, but are reflected at the plasma edge. By optimizing mode conversion processes (in particular, the O-X-B wave propagation of Ordinary Mode converting to an Extraordinary mode which then converts into an electrostatic Bernstein wave) one can excite within the plasma an electrostatic Bernstein wave that does not suffer density cutoffs and is absorbed on the electron cyclotron harmonics. Finally we have started looking at other mesoscopic lattice algorithms that involve unitary collision and streaming steps. Because these algorithms are unitary they can be run on quantum computers when they become available – unlike their computational cousin of lattice Boltzmann which is a purely classical code. These quantum lattice gas algorithms have been tested successfully on exact analytic soliton collision solution. These calculations are hoped to be able to study Bose Einstein condensed atomic gases and their ground states in an optical lattice.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Statistical behaviour of adaptive multilevel splitting algorithms in simple models

Adaptive multilevel splitting algorithms have been introduced rather recently for estimating tail distributions in a fast and efficient way. In particular, they can be used for computing the so-called reactive trajectories corresponding to direct transitions from one metastable state to another. The algorithm is based on successive selection–mutation steps performed on the system in a controlled way. It has two intrinsic parameters, the number of particles/trajectories and the reaction coordinate used for discriminating good or bad trajectories. We investigate first the convergence in law of the algorithm as a function of the timestep for several simple stochastic models. Second, we consider the average duration of reactive trajectories for which no theoretical predictions exist. The most important aspect of this work concerns some systems with two degrees of freedom. They are studied in detail as a function of the reaction coordinate in the asymptotic regime where the number of trajectories goes to infinity. We show that during phase transitions, the statistics of the algorithm deviate significatively from known theoretical results when using non-optimal reaction coordinates. In this case, the variance of the algorithm is peaking at the transition and the convergence of the algorithm can be much slower than the usual expected central limit behaviour. The duration of trajectories is affected as well. Moreover, reactive trajectories do not correspond to the most probable ones. Such behaviour disappears when using the optimal reaction coordinate called committor as predicted by the theory. We finally investigate a three-state Markov chain which reproduces this phenomenon and show logarithmic convergence of the trajectory durations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reconstruction of apparent orthotropic conductivity tensor image using magnetic resonance electrical impedance tomography

Magnetic resonance electrical impedance tomography visualizes current density and/or conductivity distributions inside an electrically conductive object. Injecting currents into the imaging object along at least two different directions, induced magnetic flux density data can be measured using a magnetic resonance imaging scanner. Without rotating the object inside the scanner, we can measure only one component of the magnetic flux density denoted as B{sub z}. Since the biological tissues such as skeletal muscle and brain white matter show strong anisotropic properties, the reconstruction of anisotropic conductivity tensor is indispensable for the accurate observations in the biological systems. In this paper, we propose a direct method to reconstruct an axial apparent orthotropic conductivity tensor by using multiple B{sub z} data subject to multiple injection currents. To investigate the anisotropic conductivity properties, we first recover the internal current density from the measured B{sub z} data. From the recovered internal current density and the curl-free condition of the electric field, we derive an over-determined matrix system for determining the internal absolute orthotropic conductivity tensor. The over-determined matrix system is designed to use a combination of two loops around each pixel. Numerical simulations and phantom experimental results demonstrate that the proposed algorithm stably determines the orthotropic conductivity tensor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Green's Function of the Dirac Equation with Complex Energy and Non-singular Central Nuclear Potential

We report the further development of an effective approach to construction of the electron Green's function (GF) for the Dirac equation with a complex energy and non-singular central nuclear potential. The nuclear charge distribution and the corresponding nuclear potential are received within the relativistic mean field (RMF) model. The Green's function is usually represented as a combination of two fundamental solutions of the Dirac equation. In the numerical procedure we use the Ivanov-Ivanova effective numerical algorithm and reduce a definition of the Dirac equation fundamental solutions to solving the system of differential equations, which includes the differential equations for the RMF nuclear potential too. As an application, we estimate the self-energy shift correction to atomic levels energies within the Mohr covariant procedure and presented GF approach and calculate the transitions energies for some heavy Li-like multi-charged ions within the QED many-body perturbation theory formalism.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Mixed stochastic-deterministic density functional theoretic decomposition of Kubo–Greenwood conductivities in the projector augmented wave formalism

Pairing the accuracy of the Kohn–Sham density-functional framework with the efficiency of a stochastic algorithmic approach, mixed stochastic-deterministic density functional theory (mDFT) achieves a favorable computational scaling with system sizes and electronic temperatures. We employ the recently developed mDFT formalism to investigate the dynamic charge-transport properties of systems in the warm dense matter regime. The optical conductivity spectra are computed for single- and multi- component mixtures of carbon, hydrogen, and beryllium using two complementary approaches: Kubo–Greenwood in the mDFT picture and real-time time-dependent mDFT. We further devise a decomposition of the Onsager coefficients leading up to the Kubo–Greenwood spectra to exhibit contributions from the deterministic, stochastic, and mixed electronic state transitions at different incident photon energies.

36 MATERIALS SCIENCE↗

Measurement of $Z/\gamma^* + b$-jet Production Cross section in $p\bar{p}$ collisions at $\sqrt{s}= 1.96$ TeV with the CDF detector

Processes at hadron colliders, such as the production of jets, are described by the Quantum Chromodynamics theory (QCD). Precise descriptions of processes involving jets in association with a vector boson have nowadays large relevance as they represent irreducible background to other Standard Model (SM) processes and searches for new physics. The experimental study and understanding of the b-jet production in association with a Z boson are crucial for many reasons. For one side, it is the most important background for a light Higgs boson decaying into a bottom-antibottom quark pair and produced in the ZH mode.This is one of the most promising channels for the Higgs search at Tevatron in particular since the latest results have excluded the high mass region (MH > 127 GeV/c 2 ). For another side the signature of b-jets and a Z boson is also background to new physics searches, such as supersymmetry, where a large coupling of the Higgs boson to bottom quarks is allowed. The produ ction cross section measurement of b-jets in events with a Z boson has already been performed at hadron colliders, at the Tevatron by CDF and D0 experiments and are now pursued at the LHC by ATLAS and CMS. In particular the CDF measurement was performed with only 2 fb -1 and was limited by the statistical uncertainty. This PhD thesis presents a new measurement of the $Z/\gamma^* + b$-jet production cross section using the complete dataset collected by CDF during the Run II. $Z/\gamma^*$ bosons are selected in the electron and muon decay modes and are required to have 66 < MZ < 116 GeV/c 2 while jets, reconstructed with the MidPoint algorithm, have to be central (|Y| < 1.5) with pT > 20 GeV/c . The per jet cross section is measured with respect to the $Z/\gamma^*$ inclusive and the $Z/\gamma^* +$ jets cross sections. Results are compared to leading order (LO) event generator plus parton shower and next-to-leading order (NLO) predictions corrected for non perturbative effects such as hadronizat ion and underlying event. Differential distributions as a fu! nction of jet transverse moment and jet rapidity are also presented together with the comparison to NLO pQCD predictions for different renormalization and factorization scales and various PDF sets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum-Classical Hybrid for Information Processing

Based upon quantum-inspired entanglement in quantum-classical hybrids, a simple algorithm for instantaneous transmissions of non-intentional messages (chosen at random) to remote distances is proposed. The idea is to implement instantaneous transmission of conditional information on remote distances via a quantum-classical hybrid that preserves superposition of random solutions, while allowing one to measure its state variables using classical methods. Such a hybrid system reinforces the advantages, and minimizes the limitations, of both quantum and classical characteristics. Consider n observers, and assume that each of them gets a copy of the system and runs it separately. Although they run identical systems, the outcomes of even synchronized runs may be different because the solutions of these systems are random. However, the global constrain must be satisfied. Therefore, if the observer #1 (the sender) made a measurement of the acceleration v(sub 1) at t =T, then the receiver, by measuring the corresponding acceleration v(sub 1) at t =T, may get a wrong value because the accelerations are random, and only their ratios are deterministic. Obviously, the transmission of this knowledge is instantaneous as soon as the measurements have been performed. In addition to that, the distance between the observers is irrelevant because the x-coordinate does not enter the governing equations. However, the Shannon information transmitted is zero. None of the senders can control the outcomes of their measurements because they are random. The senders cannot transmit intentional messages. Nevertheless, based on the transmitted knowledge, they can coordinate their actions based on conditional information. If the observer #1 knows his own measurements, the measurements of the others can be fully determined. It is important to emphasize that the origin of entanglement of all the observers is the joint probability density that couples their actions. There is no centralized source, or a sender of the signal, because each receiver can become a sender as well. An observer receives a signal by performing certain measurements synchronized with the measurements of the others. This means that the signal is uniformly and simultaneously distributed over the observers in a decentralized way. The signals transmit no intentional information that would favor one agent over another. All the sequence of signals received by different observers are not only statistically equivalent, but are also point-by-point identical. It is important to assume that each agent knows that the other agent simultaneously receives the identical signals. The sequences of the signals are true random, so that no agent could predict the next step with the probability different from those described by the density. Under these quite general assumptions, the entangled observers-agents can perform non-trivial tasks that include transmission of conditional information from one agent to another, simple paradigm of cooperation, etc. The problem of behavior of intelligent agents correlated by identical random messages in a decentralized way has its own significance: it simulates evolutionary behavior of biological and social systems correlated only via simultaneous sensoring sequences of unexpected events.

Zak, Michail↗

Fast equilibration protocol for million atom systems of highly entangled linear polyethylene chains

Equilibrated systems of entangled polymer melts cannot be produced using direct brute force equilibration due to the slow reptation dynamics exhibited by high molecular weight chains. Instead, these dense systems are produced using computational techniques such as Monte Carlo-Molecular Dynamics hybrid algorithms, though the use of soft potentials has also shown promise mainly for coarse-grained polymeric systems. Through the use of soft-potentials, the melt can be equilibrated via molecular dynamics at intermediate and long length scales prior to switching to a Lennard-Jones potential. We will outline two different equilibration protocols, which use various degrees of information to produce the starting configurations. In one protocol, we use only the equilibrium bond angle, bond length, and target density during the construction of the simulation cell, where the information is obtained from available experimental data and extracted from the force field without performing any prior simulation. In the second protocol, we moreover utilize the equilibrium radial distribution function and dihedral angle distribution. This information can be obtained from experimental data or from a simulation of short unentangled chains. Both methods can be used to prepare equilibrated and highly entangled systems, but the second protocol is much more computationally efficient. These systems can be strictly monodisperse or optionally polydisperse depending on the starting chain distribution. Our protocols, which utilize a soft-core harmonic potential, will be applied for the first time to equilibrate a million particle system of polyethylene chains consisting of 1000 united atoms at various temperatures. Calculations of structural and entanglement properties demonstrate that this method can be used as an alternative towards the generation of entangled equilibrium structures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable posterior approximations for large-scale Bayesian inverse problems via likelihood-informed parameter and state reduction

Two prime bottlenecks to the solution of large-scale Bayesian inverse problems are the scaling of posterior sampling algorithms to high-dimensional parameter spaces and the computational cost of forward model evaluations. However, incomplete or noisy data, the state variation and parameter dependence of the forward model, and correlations in the prior collectively provide useful structure that can be exploited for dimension reduction in this setting—both in the parameter space of the inverse problem and in the state space of the forward model. To this end, we show how to jointly construct low-dimensional subspaces of the parameter space and the state space in order to accelerate the Bayesian solution of the inverse problem. As a byproduct of state dimension reduction, we also show how to identify low-dimensional subspaces of the data in problems with high-dimensional observations. These subspaces enable approximation of the posterior as a product of two factors: (i) a projection of the posterior onto a low-dimensional parameter subspace, wherein the original likelihood is replaced by an approximation involving a reduced model; and (ii) the marginal prior distribution on the high-dimensional complement of the parameter subspace. We introduce and compare several strategies for constructing these subspaces using only a limited number of forward and adjoint model simulations. The resulting posterior approximations can rapidly be characterized using standard sampling techniques, e.g., Markov chain Monte Carlo. Two numerical examples demonstrate the accuracy and efficiency of our approach: inversion of an integral equation in atmospheric remote sensing, where the data dimension is very high; and the inference of a heterogeneous transmissivity field in a groundwater system, which involves a partial differential equation forward model with high dimensional state and parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Operator learning for predicting multiscale bubble growth dynamics

We report simulating and predicting multiscale problems that couple multiple physics and dynamics across many orders of spatiotemporal scales is a great challenge that has not been investigated systematically by deep neural networks (DNNs). Herein, we develop a framework based on operator regression, the so-called deep operator network (DeepONet), with the long-term objective to simplify multiscale modeling by avoiding the fragile and time-consuming “hand-shaking” interface algorithms for stitching together heterogeneous descriptions of multiscale phenomena. To this end, as a first step, we investigate if a DeepONet can learn the dynamics of different scale regimes, one at the deterministic macroscale and the other at the stochastic microscale regime with inherent thermal fluctuations. Specifically, we test the effectiveness and accuracy of the DeepONet in predicting multirate bubble growth dynamics, which is described by a Rayleigh–Plesset (R–P) equation at the macroscale and modeled as a stochastic nucleation and cavitation process at the microscale by dissipative particle dynamics (DPD). First, we generate data using the R–P equation for multirate bubble growth dynamics caused by randomly time-varying liquid pressures drawn from Gaussian random fields (GRFs). Our results show that properly trained DeepONets can accurately predict the macroscale bubble growth dynamics and can outperform long short-term memory networks. We also demonstrate that the DeepONet can extrapolate accurately outside the input distribution using only very few new measurements. Subsequently, we train the DeepONet with DPD data corresponding to stochastic bubble growth dynamics. Although the DPD data are noisy and we only collect sparse data points on the trajectories, the trained DeepONet model is able to predict accurately the mean bubble dynamics for time-varying GRF pressures. Taken together, our findings demonstrate that DeepONets can be employed to unify the macroscale and microscale models of the multirate bubble growth problem, hence providing new insight into the role of operator regression via DNNs in tackling realistic multiscale problems and in simplifying modeling with heterogeneous descriptions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Shadow molecular dynamics for flexible multipole models

Shadow molecular dynamics provide an efficient and stable atomistic simulation framework for flexible charge models with long-range electrostatic interactions. Shadow molecular dynamics simulations are driven by approximate “shadow” Born–Oppenheimer potentials for which the exact charges and forces are directly accessible without relying on costly (and approximate) iterative solvers. While previous implementations have been limited to atomic monopole charge distributions, we extend this approach to flexible multipole models. We derive detailed expressions for the shadow energy functions, potentials, and force terms, explicitly incorporating monopole–monopole, dipole–monopole, and dipole–dipole interactions. In our formulation, both atomic monopoles and atomic dipoles are treated as extended dynamical variables alongside the propagation of the nuclear degrees of freedom. We demonstrate that introducing the additional dipole degrees of freedom preserves the stability and accuracy previously seen in monopole-only shadow molecular dynamics simulations. In addition, we present a shadow molecular dynamics scheme where the monopole charges are held fixed while the dipoles remain flexible. Our extended shadow dynamics provide a framework for stable, computationally efficient, and versatile molecular dynamics simulations involving long-range interactions between flexible multipoles. This is of particular current interest in combination with machine-learned interatomic potentials, including long-range electrostatic interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗