SEARCH · Engineering Papers

Results for “Implicit”

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 1,495 records · Page 83

All sources NASA NTRS DOE OSTI

DOE OSTI2022

The Schwarz alternating method for transient solid dynamics

Abstract In our earlier work, we formulated the Schwarz alternating method as a means for concurrent multiscale coupling in finite deformation solid mechanics for quasi‐static problems. Herein, we advance this method for the study of transient dynamic multiscale solid mechanics problems where information is exchanged back and forth between small and large scales. The extension to dynamics relies on the notion of a global time stepper. Within each global time step, the subdomains are coupled by the standard Schwarz iterative process. Remarkably, each subdomain can use its own time step or even its own time integrator to advance its solution in time, provided that they synchronize at each global time step. We study the performance of the Schwarz method on several examples designed for this purpose. Our numerical experiments demonstrate that the method is capable of coupling regions with different mesh resolutions, different element types, and different time integration schemes (e.g., implicit and explicit), all without introducing any artifacts that afflict other coupling methods for transient dynamics. Finally, we apply the dynamic Schwarz alternating method to the simulation of a bolted joint subjected to dynamic loading, as a demonstration of the performance of the method in a realistic scenario.

Mota, Alejandro↗

DOE OSTI2024

A large deformation multiphase continuum mechanics model for shock loading of soft porous materials

A large deformation, coupled finite-element (FE) model is developed to simulate the multiphase response of soft porous materials subjected to high strain-rate loading. The approach is based on the theory of porous media (TPM) at large deformations. Simplifications to the one-dimensional regime studied in the numerical simulations follow. An overview of several different time integration schemes is presented for the purpose of solving the nonlinear dynamic coupled balance of momenta (mixture and fluid) and balance of mass of the mixture equations. Numerical examples are presented for (i) verification against closed-form analytical solutions assuming small loads, (ii) demonstrating large deformation effects at high strain-rate, and (iii) showing differences in deformations between a single-phase elastodynamics model with occluded compressible pore fluid and a multiphase poroelastodynamics model at high strain-rate. The multiphase model shows that the relative motion of the pore fluid significantly dampens the deformation response of the solid skeleton as compared to the single-phase model, and makes it possible to extract quantitative values for the stresses of the different constituents, thereby allowing one to form preliminary conclusions about the onset of damage in the solid skeleton. The novelty of the current work is developing a multiphase, large deformation, mixture theory numerical model for high strain-rate loading of soft porous materials. It was discovered that explicit, adaptive time-stepping Runge–Kutta schemes offer high accuracy at relatively low cost when compared to traditional implicit or explicit central difference time-stepping schemes for shock-like loadings. Here, shock viscosity is added to the mixture momentum balance equation to regularize the shock front, and a stabilization term is added to the mixture mass balance equation to stabilize equal order interpolation finite elements for the coupled finite element solution of multiphase materials.

Engineering↗

DOE OSTI2020

A least-squares finite element method based on the Helmholtz decomposition for hyperbolic balance laws

In this paper, a least-squares finite element method for scalar nonlinear hyperbolic balance laws is proposed and studied. The approach is based on a formulation that utilizes an appropriate Helmholtz decomposition of the flux vector and is related to the standard notion of a weak solution. This relationship, together with a corresponding connection to negative-norm least-squares, is described in detail. As a consequence, an important numerical conservation theorem is obtained, similar to the famous Lax–Wendroff theorem. The numerical conservation properties of the method in this paper do not fall precisely in the framework introduced by Lax and Wendroff, but they are similar in spirit as they guarantee that when L 2 convergence holds, the resulting approximations approach a weak solution to the hyperbolic problem. The least-squares functional is continuous and coercive in an H -1 -type norm, but not L 2 -coercive. Nevertheless, the L 2 convergence properties of the method are discussed. Convergence can be obtained either by an explicit regularization of the functional, that provides control of the L 2 norm, or by properly choosing the finite element spaces, providing implicit control of the L 2 norm. Numerical results for the inviscid Burgers equation with discontinuous source terms are shown, demonstrating the L 2 convergence of the obtained approximations to the physically admissible solution. The numerical method utilizes a least-squares functional, minimized on finite element spaces, and a Gauss–Newton technique with nested iteration. Finally, we believe that the linear systems encountered with this formulation are amenable to multigrid techniques and combining the method with adaptive mesh refinement would make this approach an efficient tool for solving balance laws (this is the focus of a future study).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Coupling between radiative flux divergence and turbulence near the surface

Near‐surface turbulent flux and radiation divergence field observations are analysed over a grass‐covered surface located at the Wageningen observatory, the Netherlands. Net radiative flux divergence appears to be a large component of the energy budget near the surface, accounting for a cooling rate of several tens of degrees per day. Long‐wave radiation divergence dominates this radiation divergence flux. We show here that long‐wave flux divergence near the surface is strongly coupled to sensible heat flux, except in high relative humidity (>90%) and foggy conditions. The net long‐wave radiative flux divergence exhibits a sharp gradient within the first 20 m above the surface. This flux divergence is itself strongly coupled to sensible heat flux through adjustments in surface‐layer profiles. Nonetheless, no systematic effect of radiation is witnessed on the turbulent temperature spectrum so that the main effect of near‐surface radiation is on the mean heat budget. As typical flux‐gradient relationships are derived based on observations taken in the near‐surface boundary‐layer region where sharp long‐wave divergence is present, we suspect that those relationships implicitly represent some of the long‐wave divergence term. A modification of Monin–Obukhov Similarity Theory to include the effect of radiative divergence is proposed and discussed. This calls for independent measurements of turbulent fluxes and radiative flux divergence near the surface to re‐derive turbulent flux‐gradient relationships independently of radiative effects.

Gentine, Pierre↗

DOE OSTI2018

Exploiting graphical processing units to enable quantum chemistry calculation of large solvated molecules with conductor-like polarizable continuum models

The conductor–like polarizable continuum model (C–PCM) with switching/Gaussian smooth discretization is a widely used implicit solvation model in quantum chemistry. We have previously implemented C–PCM solvation for Hartree–Fock (HF) and density functional theory (DFT) on graphical processing units (GPUs), enabling the quantum mechanical treatment of large solvated biomolecules. Here, we first propose a GPU–based algorithm for the PCM conjugate gradient linear solver that greatly improves the performance for very large molecules. The overhead for PCM–related evaluations now consumes less than 15% of the total runtime for DFT calculations on large molecules. Second, we demonstrate that our algorithms tailored for ground state C–PCM are transferable to excited state properties. Using a single GPU, our method evaluates the analytic gradient of the linear response PCM time–dependent density functional theory energy up to 80× faster than a conventional central processing unit (CPU)–based implementation. In addition, our C–PCM algorithms are transferable to other methods that require electrostatic potential (ESP) evaluations. For example, we achieve speed–ups of up to 130× for restricted ESP–based atomic charge evaluations, when compared to CPU–based codes. As a result, we also summarize and compare the different PCM cavity discretization schemes used in some popular quantum chemistry packages as a reference for both users and developers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2018

Solvation thermodynamics of neutral and charged solutes using the solvation‐layer interface condition continuum dielectric model

Abstract We demonstrate that the solvation‐layer interface condition (SLIC) continuum dielectric model for molecular electrostatics, combined with a simple solvent‐accessible‐surface‐area (SASA)‐proportional model for nonpolar solvent effects, accurately predicts solvation entropies of neutral and charged small molecules. The SLIC/SASA model has only seven fitting parameters in total and achieves this accuracy using a training set with only 20 compounds. Despite this simplicity, solvation free energies and entropies are nearly as accurate as those predicted by the more sophisticated Langevin dipoles solvation model. Surprisingly, the model automatically reproduces the negligible contribution of electrostatics to the solvation of hydrophobic compounds. Opportunities for improvement include nonpolar solvation, anion solvation entropies, and heat capacities. More molecular realism may be needed for these quantities. To enable a future, explicit‐solvent‐based assessment of the SLIC/SASA implicit‐solvent model, we predict solvation entropies for the Mobley test set, which are available as Supporting Information.

Mehdizadeh Rahimi, Ali↗

DOE OSTI2019

A Framework for Distributed Approximation of Moments with Higher-Order Derivatives through Automatic Differentiation

We present a framework for the distributed approximation of moments, enabling the evaluation of the uncertainty in a dynamical system. The first and second moment, mean, and variance are computed with up to third-order Taylor series expansion. The required derivatives for the expansion are generated automatically by automatic differentiation and propagated through an implicit time stepper. The computational kernels are the accumulation of the derivatives (Jacobian, Hessian, tensor) and the covariance matrix. We apply distributed parallelism to the Hessian or third-order tensor, and the user merely has to provide a function for the differential equation, thus achieving similar ease of use as Monte Carlo-based methods. We demonstrate our approach using with benchmarks on Theta, a KNL-based system at the Argonne Leadership Computing Facility.

Automatic Differentiation↗

DOE OSTI2014

AHF: Array-Based Half-Facet Data Structure for Mixed-Dimensional and Non-Manifold Meshes

We present an Array-based Half-Facet mesh data structure, or AHF, for efficient mesh query and modification operations. The AHF extends the compact array-based half-edge and half-face data structures (T.J. Alumbaugh and X. Jiao, Compact array-based mesh data structures, IMR, 2005) to support mixed-dimensional and non-manifold meshes. The design goals of our data structure include generality to support such meshes, efficiency of neighborhood queries and mesh modification, compactness of memory footprint, and facilitation of interoperability of mesh-based application codes. To accomplish these goals, our data structure uses sibling half-facets as a core abstraction, coupled with other explicit and implicit representations of entities. A unique feature of our data structure is a comprehensive implementation in MATLAB, which allows rapid prototyping, debugging, testing, and deployment of meshing algorithms and other mesh-based numerical methods. We have also developed C++ implementation built on top of MOAB (T.J. Tautges, R. Meyers, and K. Merkley, MOAB: A Mesh-Oriented Database, Sandia National Laboratories, 2004). We present some comparisons of the memory requirements and computational costs, and also demonstrate its effectiveness with a few sample applications.

Dyedov, Volodymyr↗

DOE OSTI2017

Interface Metaphors for Interactive Machine Learning

To promote more interactive and dynamic machine learn- ing, we revisit the notion of user-interface metaphors. User-interface metaphors provide intuitive constructs for supporting user needs through interface design elements. A user-interface metaphor provides a visual or action pattern that leverages a user’s knowledge of another domain. Metaphors suggest both the visual representations that should be used in a display as well as the interactions that should be afforded to the user. We argue that user-interface metaphors can also offer a method of extracting interaction-based user feedback for use in machine learning. Metaphors offer indirect, context-based information that can be used in addition to explicit user inputs, such as user-provided labels. Implicit information from user interactions with metaphors can augment explicit user input for active learning paradigms. Or it might be leveraged in systems where explicit user inputs are more challenging to obtain. Each interaction with the metaphor provides an opportunity to gather data and learn. We argue this approach is especially important in streaming applications, where we desire machine learning systems that can adapt to dynamic, changing data.

Interactive machine learning↗

DOE OSTI2018

Four Perspectives on Human Bias in Visual Analytics

Mixed-initiative visual analytic systems steer analytical models and adapt views by making inferences from users' behavioral patterns with the system. Because such systems rely on incorporating implicit and explicit user feedback, they are particularly susceptible to the injection and propagation of human biases. To ultimately guard against the potentially negative effects of systems biased by human users, we must first qualify what we mean by the term bias. Thus, in this paper we describe four different perspectives on human bias that are particularly relevant to visual analytics. We discuss the interplay of human and computer system biases, particularly their roles in mixed-initiative systems. Given that the term bias is used to describe several different concepts, our goal is to encourage mindful consideration of which perspective on bias researchers take in their work to facilitate a common language in research and development efforts going forward.

visual analytics, mixed-initiative systems, cognit↗

DOE OSTI2018

SharP Unified Memory Allocator: An Intent-Based Memory Allocator for Extreme-Scale Systems

The pre-exascale systems will soon be deployed with a deep, complex memory hierarchy composed of many heterogeneous memories. This presents multiple challenges for users including: how to allocate data objects with locality between memories and devices for the various memories in these systems, which includes DRAM, High-bandwidth Memory (HBM), and non-volatile random access memory (NVRAM), and how to perform these allocations while providing portability for their application. Currently, the user can make use of multiple, disjoint libraries to allocate data objects on these memories. However, it is difficult to obtain locality between memories and devices when using libraries that are unaware of each other. This paper presents the Unified Memory Allocator (UMA) of the SHARed data-structure centric Programming abstraction (SharP) library, which provides a unified interface for memory allocations across DRAM, HBM, and NVRAM and is extensible to support future memory types. In addition, the SharP UMA allows for portability between systems by supporting both explicit and implicit, intent-based memory allocations. To demonstrate the ease of use of the SharP UMA, we have extended both Open MPIand OpenSHMEM-Xto support SharP. We validate this work by evaluating the performance implications and intent-based approach with synthetic benchmarks as well as adaptations of the Graph500 benchmark.

Aderholdt, William↗

DOE OSTI2018

Manage OpenMP GPU Data Environment Under Unified Address Space

OpenMP has supported the offload of computations to accelerators such as GPUs since version 4.0. A crucial aspect in OpenMP offloading is to manage the accelerator data environment. Currently, this has to be explicitly programmed by users, which is non-trival and often results in suboptimal performance. The unified memory feature available in recent GPU architectures introduces another option, implicit management. However, our experiments show that it incurs several performance issues, especially under GPU memory oversubscription. In this paper, we propose a compiler and runtime collaborative approach to manage OpenMP GPU data under unified memory. In our framework, the compiler performs data reuse analysis to assist runtime data management. The runtime combines static and dynamic information to make optimized data management decisions.We have implement the proposed technology in the LLVM framework. The evaluation shows our method can achieve significant performance improvement for OpenMP GPU offloading.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Replica wormholes and the black hole interior

Recent work has shown how to obtain the Page curve of an evaporating black hole from holographic computations of entanglement entropy. We show how these computations can be justified using the replica trick, from geometries with a spacetime wormhole connecting the different replicas. In a simple model, we study the Page transition in detail by summing replica geometries with different topologies. We compute related quantities in less detail in more complicated models, including JT gravity coupled to conformal matter and the SYK model. Separately, we give a direct gravitational argument for entanglement wedge reconstruction using an explicit formula known as the Petz map; again, a spacetime wormhole plays an important role. We discuss an interpretation of the wormhole geometries as part of some ensemble average implicit in the gravity description.

2D gravity↗

DOE OSTI2018

BPS equations and non-trivial compactifications

We consider the problem of finding exact, eleven-dimensional, BPS supergravity solutions in which the compactification involves a non-trivial Calabi-Yau manifold, Y, as opposed to simply a T 6 . Since there are no explicitly-known metrics on non-trivial, compact Calabi-Yau manifolds, we use a non-compact “local model” and take the compactification manifold to be Y = M GH × T 2 , where MGH is a hyper-Kähler, Gibbons-Hawking ALE space. We focus on backgrounds with three electric charges in five dimensions and find exact families of solutions to the BPS equations that have the same four supersymmetries as the three-charge black hole. Our exact solution to the BPS system requires that the Calabi-Yau manifold be fibered over the space-time using compensators on Y. The role of the compensators is to ensure smoothness of the eleven-dimensional metric when the moduli of Y depend on the space-time. The Maxwell field Ansatz also implicitly involves the compensators through the frames of the fibration. In conclusion, we examine the equations of motion and discuss the brane distributions on generic internal manifolds that do not have enough symmetry to allow smearing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

On systems of maximal quantum chaos

A remarkable feature of chaos in many-body quantum systems is the existence of a bound on the quantum Lyapunov exponent. An important question is to understand what is special about maximally chaotic systems which saturate this bound. Here we provide further evidence for the ‘hydrodynamic’ origin of chaos in such systems, and discuss hallmarks of maximally chaotic systems. We first provide evidence that a hydrodynamic effective field theory of chaos we previously proposed should be understood as a theory of maximally chaotic systems. We then emphasize and make explicit a signature of maximal chaos which was only implicit in prior literature, namely the suppression of exponential growth in commutator squares of generic few-body operators. We provide a general argument for this suppression within our chaos effective field theory, and illustrate it using SYK models and holographic systems. We speculate that this suppression indicates that the nature of operator scrambling in maximally chaotic systems is fundamentally different to scrambling in non-maximally chaotic systems. We also discuss a simplest scenario for the existence of a maximally chaotic regime at sufficiently large distances even for non-maximally chaotic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2019

Duality web on a 3D Euclidean lattice and manifestation of hidden symmetries

We generalize our previous lattice construction of the abelian bosonization duality in 2 + 1 dimensions to the entire web of dualities as well as the N f = 2 self-duality, via the lattice implementation of a set of modular transformations in the theory space. The microscopic construction provides explicit operator mappings, and allows the manifestation of some hidden symmetries. It also exposes certain caveats and implicit assumptions beneath the usual application of the modular transformations to generate the web of dualities. Lastly, we make brief comments on the non-relativistic limit of the dualities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2012

Unitarity and the Holographic S-Matrix

The bulk S-Matrix can be given a non-perturbative definition in terms of the flat space limit of AdS/CFT. We show that the unitarity of the S-Matrix, ie the optical theorem, can be derived by studying the behavior of the OPE and the conformal block decomposition in the flat space limit. When applied to perturbation theory in AdS, this gives a holographic derivation of the cutting rules for Feynman diagrams. To demonstrate these facts we introduce some new techniques for the analysis of conformal field theories. Chief among these is a method for conglomerating local primary operators O{sub 1} and O{sub 2} to extract the contribution of an individual primary O{sub {Delta},{ell}} in their OPE. This provides a method for isolating the contribution of specific conformal blocks which we use to prove an important relation between certain conformal block coefficients and anomalous dimensions. These techniques make essential use of the simplifications that occur when CFT correlators are expressed in terms of a Mellin amplitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Covariant phase space with boundaries

The covariant phase space method of Iyer, Lee, Wald, and Zoupas gives an elegant way to understand the Hamiltonian dynamics of Lagrangian field theories without breaking covariance. The original literature however does not systematically treat total derivatives and boundary terms, which has led to some confusion about how exactly to apply the formalism in the presence of boundaries. In particular the original construction of the canonical Hamiltonian relies on the assumed existence of a certain boundary quantity “B”, whose physical interpretation has not been clear. We here give an algorithmic procedure for applying the covariant phase space formalism to field theories with spatial boundaries, from which the term in the Hamiltonian involving B emerges naturally. Our procedure also produces an additional boundary term, which was not present in the original literature and which so far has only appeared implicitly in specific examples, and which is already nonvanishing even in general relativity with sufficiently permissive boundary conditions. The only requirement we impose is that at solutions of the equations of motion the action is stationary modulo future/past boundary terms under arbitrary variations obeying the spatial boundary conditions; from this the symplectic structure and the Hamiltonian for any diffeomorphism that preserves the theory are unambiguously constructed. We show in examples that the Hamiltonian so constructed agrees with previous results. We also show that the Poisson bracket on covariant phase space directly coincides with the Peierls bracket, without any need for non-covariant intermediate steps, and we discuss possible implications for the entropy of dynamical black hole horizons.

36 MATERIALS SCIENCE↗