Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum mechanics and quantum computing”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Quasi-Helmholtz decomposition, Gauss' laws and charge conservation for finite element particle-in-cell

Development of particle-in-cell (PIC) methods using finite element based methods (FEMs) have been a topic of renewed interest; this has largely been driven by (a) the ability of finite element methods to better model geometry, (b) better understanding of function spaces that are necessary to represent all Maxwell quantities, and (c) more recently, the fundamental rubrics that should be obeyed in space and time so as to satisfy Gauss' laws and the equation of continuity. In that vein, methods have been developed recently that satisfy these equations and are agnostic to time stepping methods. While this development is indeed a significant advance, it should be noted that implicit FEM transient solvers support an underlying null space that corresponds to a gradient of a scalar potential ∇Φ(r) (or t∇Φ(r) in the case of wave equation solvers). While explicit schemes do not suffer from this drawback, they are only conditionally stable with time step sizes that are mesh dependent and very small. Furthermore, the null space produces spurious charge that can corrupt the desired physics of a PIC simulation. The way to overcome this bottleneck, and indeed, satisfy all four Maxwell's equation is to use a quasi-Helmholtz formulation on a tessellation. In the re-formulation presented, we strictly satisfy the equation of continuity and Gauss' laws for both the electric and magnetic flux densities. Results illustrating the efficacy of this scheme will be demonstrated by analyzing non-neutral beams with space-charge and the adiabatic expansion of a neutral plasma with realistic parameters (Debye length and real mass ratios).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

GenASiS Basics: Object-oriented utilitarian functionality for large-scale physics simulations (Version 4)

GenASiS Basics provides modern Fortran classes furnishing extensible object-oriented utilitarian functionality for large-scale physics simulations on distributed memory supercomputers. This functionality includes physical units and constants; display to the screen or standard output device; message passing; I/O to disk; and runtime parameter management and usage statistics. Herein, this revision—Version 4 of Basics—includes a name change and additions to functionality, including the facilitation of direct communication between GPUs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Accelerating multicanonical sampling with irreversibility

Flat-histogram Monte Carlo simulations are well-established, robust methods to perform random walks in a physical observable or parameter space, making them suitable for finding ground states or studying phase transitions in complex systems in statistical physics. However, their efficiency can be limited by the time to attain the desired flat distribution, which is generally unknown prior to the simulations. In particular, they might suffer from slowing down towards the end of a simulation due to the diffusive nature of random walks. In this work we apply irreversibility to the multicanonical Monte Carlo method via the lifting approach to alleviate this behavior. We achieve a 2–4 times speedup in ground-state search for a two-dimensional (2D) Ising model, and up to an order of magnitude of speedup for finding the ground-state energy in an Edwards–Anderson spin glass, compared to traditional multicanonical sampling. In conclusion, the round-trip times between ground states show a narrower distribution and are significantly shorter compared to the reversible counterpart, suggesting that a lower convergence time with a smaller time variance is feasible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Model for the electrical conductivity in dense plasma mixtures

A new density functional theory, average atom based model for the electrical conductivity of dense plasmas with a mixture of ion species, containing no adjustable parameters, is presented herein. The model takes the temperature, mass density and relative abundances of the species as input. It takes into account partial ionization, ionic structure, and core-valence orthogonality, and uses quantum mechanical calculations of cross sections. Comparison to an existing high fidelity but computationally expensive method reveals good agreement. The new model is computationally efficient and can reach high temperatures. A new mixing rule is also presented that gives reasonably accurate conductivities for high temperature plasma mixtures.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Catalytic consequences of hydrogen addition events and solvent-adsorbate interactions during guaiacol-H 2 reactions at the H 2 O-Ru(0 0 0 1) interface

Catalytic reactions of biomass-derived phenolics and H 2 occur on transition metal surfaces via competitive C–O cleavage and ring saturation pathways, with both requiring multiple hydrogen addition events before forming their respective rate limiting transition states. These events are markedly affected by solvent chemical identity, with polar protic solvents ionizing hydrogen adatoms (H*) to interfacial protons (H + ) and opening up new catalytic routes. Here, we establish the reaction coordinate space for guaiacol-H 2 reactions on Ru(0 0 0 1) using density functional theory and describe the atomic-scale effect of a polar protic solvent, H 2 O. Coupled H + and H* attack leads to quasi-equilibrated enol and keto intermediates as the precursors for C–O cleavage and ring saturation, respectively. For C–O cleavage, H 2 O solvent enables a lower energy pathway via concomitant transfer of the hydroxyl H + to the methoxy oxygen during C–OCH 3 cleavage, forming a charge separated [Ru(s)–(C 6 H 5 O – )…(H + )…OCH 3 ] transition state and reducing the barrier by up to 0.8 eV as compared to unassisted C–OCH 3 cleavage. For ring saturation, H* attack onto an unsaturated meta carbon is rate limiting with no direct solvent participation, suggesting that protic polar solvents selectively promote the C–O cleavage pathway. Taken together, we show that activating guaiacol for either C–O bond cleavage or ring saturation product formation depends on the reactive hydrogen identity (H* or H + ), enol/keto isomerization equilibrium, and accessibility of the proton assisted Car–OCH 3 cleavage transition state. Here, all such factors are tunable via changes to the solvent or metal identity.

09 BIOMASS FUELS↗
DOE OSTI2020

DPM: A deep learning PDE augmentation method with application to large-eddy simulation

A framework is introduced that leverages known physics to reduce overfitting in machine learning for scientific applications. The partial differential equation (PDE) that expresses the physics is augmented with a neural network that uses available data to learn a description of the corresponding unknown or unrepresented physics. Training within this combined system corrects for missing, unknown, or erroneously represented physics, including discretization errors associated with the PDE's numerical solution. For optimization of the network within the PDE, an adjoint PDE is solved to provide high-dimensional gradients, and a stochastic adjoint method (SAM) further accelerates training. Additionally, the approach is demonstrated for large-eddy simulation (LES) of turbulence. High-fidelity direct numerical simulations (DNS) of decaying isotropic turbulence provide the training data used to learn sub-filter-scale closures for the filtered Navier–Stokes equations. Out-of-sample comparisons show that the deep learning PDE method outperforms widely-used models, even for filter sizes so large that they become qualitatively incorrect. It also significantly outperforms the same neural network when a priori trained based on simple data mismatch, not accounting for the full PDE. Measures of discretization errors, which are well-known to be consequential in LES, point to the importance of the unified training formulation's design, which without modification corrects for them. For comparable accuracy, simulation runtime is significantly reduced. A relaxation of the typical discrete enforcement of the divergence-free constraint in the solver is also successful, instead allowing the DPM to approximately enforce incompressibility physics. Since the training loss function is not restricted to correspond directly to the closure to be learned, training can incorporate diverse data, including experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Identifying and tracking bubbles and drops in simulations: A toolbox for obtaining sizes, lineages, and breakup and coalescence statistics

Knowledge of bubble and drop size distributions in two-phase flows is important for characterizing a wide range of phenomena, including combustor ignition, sonar communication, and cloud formation. The physical mechanisms driving the background flow also drive the time evolution of these distributions. Accurate and robust identification and tracking algorithms for the dispersed phase are necessary to reliably measure this evolution and thereby quantify the underlying mechanisms in interface-resolving flow simulations. The identification of individual bubbles and drops traditionally relies on an algorithm used to identify connected regions. This traditional algorithm can be sensitive to the presence of spurious structures. A cost-effective refinement is proposed to maximize volume accuracy while minimizing the identification of spurious bubbles and drops. An accurate identification scheme is crucial for distinguishing bubble and drop pairs with large size ratios. The identified bubbles and drops need to be tracked in time to obtain breakup and coalescence statistics that characterize the evolution of the size distribution, including breakup and coalescence frequencies, and the probability distributions of parent and child bubble and drop sizes. An algorithm based on mass conservation is proposed to construct bubble and drop lineages using simulation snapshots that are not necessarily from consecutive time steps. These lineages are then used to detect breakup and coalescence events, and obtain the desired statistics. Accurate identification of large-size-ratio bubble and drop pairs enables accurate detection of breakup and coalescence events over a large size range. Accurate detection of successive breakup and coalescence events requires that the snapshot interval be an order of magnitude smaller than the characteristic breakup and coalescence times to capture these successive events while minimizing the identification of repeated confounding events. Together, these algorithms serve as a toolbox for detailed analysis of two-phase simulations, and enable insights into the mechanisms behind bubble and drop formation and evolution in flows of practical importance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A consistent and conservative model and its scheme for N -phase- M -component incompressible flows

Here, we propose a consistent and conservative model for multiphase and multicomponent incompressible flows, where there can be arbitrary numbers of phases and components. Each phase has a background fluid called the pure phase, each pair of phases is immiscible, and components are dissolvable in some specific phases. The model is developed based on the multiphase Phase-Field model including the contact angle boundary condition, the diffuse domain approach, and the analyses on the proposed consistency conditions for multiphase and multicomponent flows. The model conserves the mass of individual pure phases, the amount of each component in its dissolvable region, and thus the mass of the fluid mixture, and the momentum of the flow. It ensures that no fictitious phases or components can be generated and that the summation of the volume fractions from the Phase-Field model is unity everywhere so that there is no local void or overfilling. It satisfies a physical energy law and it is Galilean invariant. A corresponding numerical scheme is developed for the proposed model, whose formal accuracy is 2nd-order in both time and space. It is shown to be consistent and conservative and its solution is demonstrated to preserve the Galilean invariance and energy law. Numerical tests indicate that the proposed model and scheme are effective and robust to study various challenging multiphase and multicomponent flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Simulations of plasmas and fluids using anti-symmetric models

ALMA (Anti-symmetric, Large-Moment, Accelerated) is a fast, flexible, and scalable toolkit designed to solve hyperbolic conservation law systems in hybrid supercomputers. Here this manuscript describes the theoretical background and implementation of ALMA, which uses the anti-symmetric formulation of fluids to obtain simple, robust, and easily paralellizable code. Practical GPU acceleration is realized on entire applications with an overall gain factor of 2 to 4. ALMA also provides a parallel, GPU accelerated sparse solver based on geometric multigrid, capable of diagonalizing linear systems with 239 unknowns. Here we demonstrate ALMA's scaling and performance in petascale supercomputers and use standard fluid models to verify the overall approach with canonical benchmark problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Parallel physics-informed neural networks via domain decomposition

Here we develop a distributed framework for the physics-informed neural networks (PINNs) based on two recent extensions, namely conservative PINNs (cPINNs) and extended PINNs (XPINNs), which employ domain decomposition in space and in time-space, respectively. This domain decomposition endows cPINNs and XPINNs with several advantages over the vanilla PINNs, such as parallelization capacity, large representation capacity, efficient hyperparameter tuning, and is particularly effective for multi-scale and multi-physics problems. Here, we present a parallel algorithm for cPINNs and XPINNs constructed with a hybrid programming model described by MPI + X, where X ∈ {CPUs, GPUs}. The main advantage of cPINN and XPINN over the more classical data and model parallel approaches is the flexibility of optimizing all hyperparameters of each neural network separately in each subdomain. We compare the performance of distributed cPINNs and XPINNs for various forward problems, using both weak and strong scalings. Our results indicate that for space domain decomposition, cPINNs are more efficient in terms of communication cost but XPINNs provide greater flexibility as they can also handle time-domain decomposition for any differential equations, and can deal with any arbitrarily shaped complex subdomains. To this end, we also present an application of the parallel XPINN method for solving an inverse diffusion problem with variable conductivity on the United States map, using ten regions as subdomains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Entropy stable modal discontinuous Galerkin schemes and wall boundary conditions for the compressible Navier-Stokes equations

Entropy stable schemes ensure that physically meaningful numerical solutions also satisfy a semi-discrete entropy inequality under appropriate boundary conditions. Here in this work, we describe a discretization of viscous terms in the compressible Navier-Stokes equations which enables a simple and explicit imposition of entropy stable no-slip and reflective (symmetry) wall boundary conditions for discontinuous Galerkin (DG) discretizations. Specifically, we derive methods for imposing adiabatic no-slip and reflective (symmetry) boundary conditions for modal entropy stable DG formulations which preserve a semi-discrete entropy inequality. Numerical results confirm the robustness and accuracy of the proposed approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A unified formulation of splitting-based implicit time integration schemes

Splitting-based time integration approaches such as fractional step, alternating direction implicit, operator splitting, and locally one dimensional methods partition the system of interest into components, and solve individual components implicitly in a cost-effective way. Here this work proposes a unified formulation of splitting time integration schemes in the framework of general-structure additive Runge–Kutta (GARK) methods. Specifically, we develop implicit-implicit (IMIM) GARK schemes, provide the order conditions for this class, and explain their application to partitioned systems of ordinary differential equations. We show that classical splitting methods belong to the IMIM GARK family, and therefore can be studied in this unified framework. New IMIM-GARK splitting methods are developed and tested using parabolic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

When and why PINNs fail to train: A neural tangent kernel perspective

Physics-informed neural networks (PINNs) have lately received great attention thanks to their flexibility in tackling a wide range of forward and inverse problems involving partial differential equations. However, despite their noticeable empirical success, little is known about how such constrained neural networks behave during their training via gradient descent. More importantly, even less is known about why such models sometimes fail to train at all. Here in this work, we aim to investigate these questions through the lens of the Neural Tangent Kernel (NTK); a kernel that captures the behavior of fully-connected neural networks in the infinite width limit during training via gradient descent. Specifically, we derive the NTK of PINNs and prove that, under appropriate conditions, it converges to a deterministic kernel that stays constant during training in the infinite-width limit. This allows us to analyze the training dynamics of PINNs through the lens of their limiting NTK and find a remarkable discrepancy in the convergence rate of the different loss components contributing to the total training error. To address this fundamental pathology, we propose a novel gradient descent algorithm that utilizes the eigenvalues of the NTK to adaptively calibrate the convergence rate of the total training error. Finally, we perform a series of numerical experiments to verify the correctness of our theory and the practical effectiveness of the proposed algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Learning functional priors and posteriors from data and physics

In this work, we develop a new Bayesian framework based on deep neural networks to be able to extrapolate in space-time using historical data and to quantify uncertainties arising from both noisy and gappy data in physical problems. Specifically, the proposed approach has two stages: (1) prior learning and (2) posterior estimation. At the first stage, we employ the physics-informed Generative Adversarial Networks (PI-GAN) to learn a functional prior either from a prescribed function distribution, e.g., Gaussian process, or from historical data and physics. At the second stage, we employ the Hamiltonian Monte Carlo (HMC) method to estimate the posterior in the latent space of PI-GANs. In addition, we use two different approaches to encode the physics: (1) automatic differentiation, used in the physicsinformed neural networks (PINNs) for scenarios with explicitly known partial differential equations (PDEs), and (2) operator regression using the deep operator network (DeepONet) for PDE-agnostic scenarios. We then test the proposed method for (1) meta-learning for one-dimensional regression, and forward/inverse PDE problems (combined with PINNs); (2) PDE-agnostic physical problems (combined with DeepONet), e.g., fractional diffusion as well as saturated stochastic (100-dimensional) flows in heterogeneous porous media; and (3) spatial-temporal regression problems, i.e., inference of a marine riser displacement field using experimental data from the Norwegian Deepwater Programme (NDP). The results demonstrate that the proposed approach can provide accurate predictions as well as uncertainty quantification given very limited scattered and noisy data, since historical data could be available to provide informative priors. In summary, the proposed method is capable of learning flexible functional priors, e.g., both Gaussian and non-Gaussian process, and can be readily extended to big data problems by enabling mini-batch training using stochastic HMC or normalizing flows since the latent space is generally characterized as low dimensional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Conservative DG method for the micro-macro decomposition of the Vlasov–Poisson–Lenard–Bernstein model

The micro-macro (mM) decomposition approach is considered for the numerical solution of the Vlasov– Poisson–Lenard–Bernstein (VPLB) system, which is relevant for plasma physics applications. In the mM approach, the kinetic distribution function is decomposed as $f$ = $\mathscr{E}$[$ρ_f$] + g , where $\mathscr{E}$ is a local equilibrium distribution, depending on the macroscopic moments $ρ_f$ = $∫_{\mathbb{R}}$ $efdv$ = $\langle$$ef$$\rangle$$_{\mathbb{R}}$, where e = (1, $v$, $\frac{1}{2}$ $v^2$) T , and $g$, the microscopic distribution, is defined such that $\langle$$eg$$\rangle$$_{\mathbb{R}}$ = 0. We aim to design numerical methods for the mM decomposition of the VPLB system, which consists of coupled equations for $ρ_f$ and $g$. To this end, we use the discontinuous Galerkin (DG) method for phase-space discretization, and implicit-explicit (IMEX) time integration, where the phase-space advection terms are integrated explicitly and the collision operator is integrated implicitly. We give special consideration to ensure that the resulting mM method maintains the $\langle$$eg$$\rangle$$_{\mathbb{R}}$ = 0 constraint, which may be necessary for obtaining (i) satisfactory results in the collision dominated regime with coarse velocity resolution, and (ii) unambiguous conservation properties. The constraint-preserving property is achieved through a consistent discretization of the equations governing the micro and macro components. Here, we present numerical results that demonstrate the performance of the mM method. The mM method is also compared against a corresponding DG-IMEX method solving directly for $f$.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

A level-set immersed boundary method for reactive transport in complex topologies with moving interfaces

A simulation framework based on the level-set and the immersed boundary methods (LS-IBM) has been developed for reactive transport problems in porous media involving a moving solid-fluid interface. The interface movement due to surface reactions is tracked by the level-set method, while the immersed boundary method captures the momentum and mass transport at the interface. The proposed method is capable of accurately modeling transport near evolving boundaries in Cartesian grids. The framework formulation guarantees second order accuracy in space. Since the interface velocity is only defined at the moving boundary, an interface velocity propagation method is also proposed. The method can be applied to other moving interface problems of the “Stefan” type. Here, we validate the proposed LS-IBM both for flow and transport close to an immersed object with reactive boundaries as well as for crystal growth. Lastly, the proposed method provides a powerful tool to model more realistic problems involving moving reactive interfaces in complex domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

SympNets: Intrinsic structure-preserving symplectic networks for identifying Hamiltonian systems

Here, we propose new symplectic networks (SympNets) for identifying Hamiltonian systems from data based on a composition of linear, activation and gradient modules. In particular, we define two classes of SympNets: the LA-SympNets composed of linear and activation modules, and the G-SympNets composed of gradient modules. Correspondingly, we prove two new universal approximation theorems that demonstrate that SympNets can approximate arbitrary symplectic maps based on appropriate activation functions. We then perform several experiments including the pendulum, double pendulum and three-body problems to investigate the expressivity and the generalization ability of SympNets. The simulation results show that even very small size SympNets can generalize well, and are able to handle both separable and non-separable Hamiltonian systems with data points resulting from short or long time steps. In all the test cases, SympNets outperform the baseline models, and are much faster in training and prediction. We also develop an extended version of SympNets to learn the dynamics from irregularly sampled data. This extended version of SympNets can be thought of as a universal model representing the solution to an arbitrary Hamiltonian system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗