Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “space 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 109 records · Page 6

FLAMES─Fast, Low-Storage, Accurate, and Memory-Efficient Adaptive Sampling─Approach to Resolve Spatially Dependent Dynamics of Molecular Liquids

Many critical phenomena in soft matter occur at large length scales, necessitating the resolution of their structure and dynamics at low wavenumbers. However, resolving wavenumber-dependent dynamics computationally via molecular dynamics simulations presents significant challenges, as these phenomena span several orders of magnitude in both time and length scales, resulting in high computational costs and memory demands. Here, this work highlights the computational and memory challenges associated with analyzing molecular trajectories in reciprocal space and demonstrates a method to address them. We introduce FLAMESFast, Low-storage, Accurate, and Memory-Efficient adaptive Sampling, which is a direct method for calculation of structure factors, allowing us to select only the required number of wavevectors for binning. We also use wavenumber-dependent time steps to extract dynamics. Our FLAMES approach effectively mitigates computational and memory/storage bottlenecks. We demonstrate the method using simulations of a model system, liquid octane, at various temperatures. Comparisons with experimental data and real space computation show that the FLAMES technique achieves high accuracy in resolving temperature- and spatially dependent dynamics while being significantly more computationally efficient and requiring less memory and storage than methods based on a uniform wavevector grid and fixed temporal spacing.

Chen, Guang [Argonne National Laboratory (ANL), Ar↗

Inverse design of two-dimensional materials with invertible neural networks

The ability to readily design novel materials with chosen functional properties on-demand represents a next frontier in materials discovery. However, thoroughly and efficiently sampling the entire design space in a computationally tractable manner remains a highly challenging task. To tackle this problem, we propose an inverse design framework (MatDesINNe) utilizing invertible neural networks which can map both forward and reverse processes between the design space and target property. This approach can be used to generate materials candidates for a designated property, thereby satisfying the highly sought-after goal of inverse design. We then apply this framework to the task of band gap engineering in two-dimensional materials, starting with MoS 2 . Within the design space encompassing six degrees of freedom in applied tensile, compressive and shear strain plus an external electric field, we show the framework can generate novel, high fidelity, and diverse candidates with near-chemical accuracy. We extend this generative capability further to provide insights regarding metal-insulator transition in MoS 2 which are important for memristive neuromorphic applications, among others. This approach is general and can be directly extended to other materials and their corresponding design spaces and target properties.

36 MATERIALS SCIENCE↗

Benchmarking Quantum Chemistry Computations with Variational, Imaginary Time Evolution, and Krylov Space Solver Algorithms

Quantum chemistry is a key application area for noisy-intermediate scale quantum (NISQ) devices, and therefore serves as an important benchmark for current and future quantum computer performance. Previous benchmarks in this field have focused on variational methods for computing ground and excited states of various molecules, including a benchmarking suite focused on the performance of computing ground states for alkali-hydrides under an array of error mitigation methods. State-of-the-art methods to reach chemical accuracy in hybrid quantum-classical electronic structure calculations of alkali hydride molecules on NISQ devices from IBM are outlined here. Here it is demonstrated how to extend the reach of variational eigensolvers with symmetry preserving Ansätze. Next, it is outlined how to use quantum imaginary time evolution and Lanczos as a complementary method to variational techniques, highlighting the advantages of each approach. Finally, a new error mitigation method is demonstrated which uses systematic error cancellation via hidden inverse gate constructions, improving the performance of typical variational algorithms. These results show that electronic structure calculations have advanced rapidly, to routine chemical accuracy for simple molecules, from their inception on quantum computers a few short years ago, and they point to further rapid progress to larger molecules as the power of NISQ devices grows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The lattice extraction of the TMD soft function using the auxiliary field representation of the Wilson line

The transverse momentum dependent (TMD) soft function can be obtained by formulating the Wilson line in terms of auxiliary 1-dimensional fermion fields on the lattice. In this formulation, the directional vector of the auxiliary field in Euclidean space has the form ˜ 𝑛 = ¹𝑖𝑛0– ®0?– 𝑛3º, where the time component is purely imaginary. The components of these complex directional vectors in the Euclidean space can be mapped directly to the rapidities of the Minkowski space soft function. We present the results of the one-loop calculation of the Euclidean space analog to the soft function using these complex directional vectors. As a result, we show that the calculation is valid only when the directional vectors obey the relation: j𝑟 j = j𝑛3𝑛0j ¡ 1, and that this result corresponds to a computation in Minkowski space with space-like directed Wilson lines. Finally, we show that a lattice calculable object can be constructed that has the desired properties of the soft function.

Francis, Anthony↗

Crosslinking and Gelation of Polymer Brushes and Free Polymer Chains in a Confined Space during Controlled Radical Polymerization-A Computer Simulation Study

The confinement effect on crosslinking and gelation during controlled/living copolymerization of a monovinyl and a divinyl monomer was studied by Monte Carlo computer simulation using the dynamic lattice liquid method. The simulated reactions took place in plane-parallel slits of various widths for various grafting densities (GDs) and various initial initiator/crosslinker ratios ([X] 0 /[Ini] 0 ). Monomers and crosslinkers were initially randomly distributed in the slit, but initiators were either anchored to one solid plane (polymer brushes) or randomly distributed (free chains). For brushes, the gel point (GP) depended on GD and [X] 0 /[Ini] 0 . The higher these parameters, the lower was the gel point. The gel point was also affected by the slit width. For free, nongrafted chains, the dependence of GP on slit width was negligible. For brushes, a nonuniform density of crosslinks was found, the highest density was close to the wall. This asymmetry was high at the gel point and decreased at higher conversions.

36 MATERIALS SCIENCE↗

Coordinate versus momentum cuts and effects of collective flow on critical fluctuations

We analyze particle number fluctuations in the crossover region near the critical endpoint of a first-order phase transition by utilizing molecular dynamics simulations of the classical Lennard-Jones fluid. We extend our previous study [V. A. Kuznietsov , ] by incorporating longitudinal collective flow. The scaled variance of particle number distribution inside different coordinate and momentum space acceptances is computed through ensemble averaging and found to agree with earlier results obtained using time averaging, validating the ergodic hypothesis for fluctuation observables. Presence of a sizable collective flow is found to be essential for observing large fluctuations from the critical point in momentum space acceptances. We discuss our findings in the context of heavy-ion collisions. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Reduced Order Model to Predict Dispersion of Flammable Refrigerant into a Space

As the HVAC&R industry mobilizes to deploy more low-GWP refrigerants, relevant standards are being continually reviewed and updated. Those include the general safety standards ISO 5149 and ASHRAE 15, and the equipment standards IEC and UL. The standards systematically set the allowable maximum amount of refrigerant that should be used in different equipment types and different applications. To do so, they rely on predictions of how a leaked refrigerant mass will disperse into a space. Dispersion characteristics, such as total flammable volume and its residence time, determine the risk associated with the presence of the flammable refrigerant. The standards have included provisions for the use of flammable refrigerants for approximately two decades. They relied on limited analytical analyses and test cases in their development. Dispersion of a refrigerant into a space is complex. Computational fluid dynamics (CFD) are the most accurate in predicting a given problem. However, CFD is computationally expensive and requires specialized expertise and resources and is not suitable for use by standards development working group as prediction tool. This paper presents the development of a reduced order model (ROM) that predicts the key dispersion characteristics relevant to the dispersion of a leaked refrigerant into a space for any combination of input variables. The inputs are the refrigerant release height, the total released refrigerant mass and its release flow rate, the refrigerant molecular weight, the ventilation flow rate, the floor area and height of the space, recirculation air flow rate, and the tightness of the space. The outputs are histograms of volume fraction of the room in prescribed concentration bins and the total mass of the refrigerant in each bin normalized by the total refrigerant charge at 13 prescribed simulation time stamps between 1 and 900 seconds. The ROM is constructed from a set of CFD simulations with carefully chosen combinations of input parameters. The selection if done using a multidimensional sparse grid which is a generalization of the classical tensor approach but offers additional flexibility and thus can be more carefully tuned towards a specific model. The tuning is done to improve the accuracy, measured in the difference between the output values of the ROM and the CFD model, while minimizing the computational cost, measured in number of CFD simulations which is orders of magnitude more expensive than the processing the training data.

Edwards, Dean↗

Accelerating high-order continuum kinetic plasma simulations using multiple GPUs

Kinetic plasma simulations solve the Vlasov-Poisson or Vlasov-Maxwell equations to evolve scalar-variable distribution functions in position-velocity phase space and vector-variable electromagnetic fields in configuration space. The immense computational cost of evolving high-dimensional variables, and their large number of degrees of freedom, often limits the utility of continuum kinetic simulations and presents a challenge when it comes to accurately simulating real-world physical phenomena. To address this challenge, we present techniques that accelerate and minimize the computational work required for a scalable Vlasov-Poisson solver. We show theoretical hardware compute and communication bounds for solving a fourth-order finite-volume Vlasov-Poisson system. These bounds are then used to inform and evaluate the design of performance portable algorithms for a multiple graphics processing unit (GPU) accelerated version of the Vlasov-Poisson solver VCK-CPU [1]. We demonstrate that the multi-GPU Vlasov solver implementation, VCK-GPU, simultaneously minimizes required inter-process data transfer while also being bounded by the machine network performance limits. This results in an overall strong scaling speedup per timestep of up to 40x in three-dimensional phase space (one position, two velocity coordinates) and 54x in four dimensional phase space (two position, two velocity coordinates) and a 341x increase in simulation throughput of the GPU accelerated code over the existing CPU code. The GPU code is also able to weak scale up to 256 compute nodes and 1024 GPUs. In conclusion, we demonstrate that the improved compute performance enables exploring configurations which were previously computationally infeasible, including resolving fine-scale distribution function filamentation and multi-species dynamics with realistic electron-proton mass ratios.

Continuum kinetics↗

Integrating Ultra-Coarse-Grained Protein Models into Accessible Workflows for Multiscale Molecular Dynamics

To capture protein conformational transitions using molecular dynamics (MD), several simulation resolutions covering different spatial and temporal scales are typically needed. All-atom (AA) simulations provide fine resolution, but are computationally infeasible for large systems over longer durations. Coarse-grained (CG) and ultra-coarse-grained (UCG) models have a lower resolution and computational cost while still being able to conserve essential protein features. Prior work on a Multiscale Machinelearned Modeling Infrastructure (MuMMI) combined both AA and CG simulations to study RAS-RAF protein interactions, leveraging CG models for longer time scales and using AA to investigate unusual conformations in greater detail. However, MuMMI is still resource-intensive, and this study aims to maximize exploration of the protein conformational space while reducing computational cost. In this paper, we build on prior work that integrates UCG models based on heterogeneous elastic network modeling (hENM) into the MuMMI workflow. We demonstrate that UCG models enable accurate sampling of protein conformations, focusing on simulating RAS-RAF protein interactions. Using higher-resolution CG Martini simulation data, we can automatically refine intramolecular interactions in UCG models. We present a scalable Python package that uses fluctuations observed in higher-resolution CG Martini simulations to estimate bond coefficients of the UCG model. We built novel machine learning-based backmapping methods to recover more detailed CG Martini structures from UCG structures, using diffusion models to learn the mapping between scales. Finally, we present UCG-mini-MuMMI, an accessible and less compute-intensive version of MuMMI as a resource for the scientific community. Incorporating UCG models into MD studies is applicable to a broad range of systems and proteins, and our study offers insights into the advantages and limitations of these methods.

Chemical structure↗

Sparsity for Gradient-Based Optimization of Wind Farm Layouts

Optimizing wind farm layouts is an important step in designing an efficient wind farm. Optimizing wind farm layouts is also a difficult task due to computation times increasing with the number of turbines present in the farm. The most computationally expensive part of gradient-based optimization is calculating the gradient. In order to reduce the expense of gradient calculation, we performed a study on the use of sparsity in wind farm layout optimization. This paper presents the findings of the sparsity study and provides a method to use sparsity in wind farm layout optimization. We tested this sparsity method by optimizing multiple farms with sparse methods and compared the results to optimizations of the same farms using traditional methods. By using the sparse method to optimize multiple farms, we found that the objective results were comparable between sparse and traditional methods and that sparse methods were 4 times faster than traditional methods on average. We expect more speedups with improved methodology and larger wind farms. By using sparse methods, it is possible to solve the wind farm layout optimization problem more efficiently, thus allowing for a more thorough study of the wind farm layout design space without excessive computational costs. Further work is required to refine the method and prepare for testing on real-world wind farm layout applications.

gradient↗

STITCHES: creating new scenarios of climate model output by stitching together pieces of existing simulations

Abstract. Climate model output emulation has long been attempted to support impact research, mainly to fill in gaps in the scenario space. Given the computational cost of running coupled earth system models (ESMs), which are usually the domain of supercomputers and require on the order of days to weeks to complete a century-long simulation, only a handful of different scenarios are usually chosen to externally force ESM simulations. An effective emulator, able to run on standard computers in times of the order of minutes rather than days could therefore be used to derive climate information under scenarios that were not run by ESMs. Lately, the necessity of accounting for internal variability has also made the availability of initial-condition ensembles, under a specific scenario, important, further increasing the computational demand. At least so far, emulators have been limited to simplified ESM-like output, either seasonal, annual, or decadal averages of basic quantities, like temperature and precipitation, often emulated independently of one another. With this work, we propose a more comprehensive solution to ESM output emulation. Our emulator, STITCHES, uses existing archives of earth system models' (ESMs) scenario experiments to construct ESM-like output under new scenarios or enrich existing initial-condition ensembles, which is what other emulators also aim to do. Importantly, however, STITCHES' output has the same characteristics of the ESM output it sets out to emulate: multivariate, spatially resolved, and high frequency, representing both the forced component and the internal variability around it. STITCHES extends the idea of time sampling – according to which climate outcomes are stratified by the global warming level at which they manifest themselves, irrespective of the scenario and time at which they occur – to the construction of a continuous history of ESM-like output over the whole 21st century, consistent with a 21st-century trajectory of global surface air temperature (GSAT) derived from the scenario that has been chosen as the target of the emulation. STITCHES does so by first splitting the target GSAT trajectory into decade-long windows, then matching each window in turn to a decade-long window within an existing model simulation from the available scenario runs according to its proximity to the target in absolute size of the temperature anomaly and its rate of change. A look-up table is therefore created of a sequence of existing experiment–time-window combinations that, when stitched together, create a GSAT trajectory “similar” to the target. Importantly, we can then stitch together much more than GSAT from these windows, i.e., any output that the ESM has saved for these existing experiment–time-window combinations, at any frequency and spatial scale available in its archive. We show that the stitching does not introduce artifacts in the great majority of cases (we look at temperature and precipitation at monthly frequency and on the native grid of the ESM and at an index of ENSO activity, the Southern Oscillation Index). This is true even if the criteria for the identification of the decades to be stitched together are chosen to work for a smoothed time series of annual GSAT, a result we expect given the larger amount of noise affecting most other variables at finer spatial scales and higher frequencies, which therefore are more “forgiving” of the stitching. We successfully test the method's performance over many ESMs and scenarios. Only a few exceptions surface, but these less-than-optimal outcomes are always associated with a scarcity of the archived simulations from which we can gather the decade-long windows that form the building blocks of the emulated time series. In the great majority of cases, STITCHES' performance is satisfactory according to metrics that reward consistency in trends, interannual and inter-ensemble variance, and autocorrelation structure of the time series stitched together. The method therefore can be used to create ESM-like output according to new scenarios, on the basis of a trajectory of GSAT produced according to that scenario, which could be easily obtained by a simple climate model. It can also be used to increase the size of existing initial-condition ensembles. There are aspects of our emulator that will immediately disqualify it for specific applications, like when climate information is needed whose characteristics result from accumulated quantities over windows of times longer than those used as pieces by STITCHES, droughts longer than a decade for example. But for many applications, we argue that a stitched product can satisfy the climate information needs of impact researchers. STITCHES cannot emulate ESM output from scenarios that result in GSAT trajectories outside of the envelope available in the archive, nor can it emulate trajectories with shapes different from existing ones (overshoots with negative derivative, for example). Therefore, the size and characteristics of the available archives of ESM output are the principal limitations for STITCHES' deployment. Thus, we argue for the possibility of designing scenario experiments within, for example, the next phase of the Coupled Model Intercomparison Project according to new principles, relieved of the need to produce a number of similar trajectories that vary only in radiative forcing strength but more strategically covering the space of temperature anomalies and rates of change.

54 ENVIRONMENTAL SCIENCES↗

Interface conformal anomalies

We consider two d ≥ 2 conformal field theories (CFTs) glued together along a codimension one conformal interface. The conformal anomaly of such a system contains both bulk and interface contributions. In a curved-space setup, we compute the heat kernel coefficients and interface central charges in free theories. The results are consistent with the known boundary CFT data via the folding trick. In d = 4, two interface invariants generally allowed as anomalies turn out to have vanishing interface charges. These missing invariants are constructed from components with odd parity with respect to flipping the orientation of the defect. We conjecture that all invariants constructed from components with odd parity may have vanishing coefficient for symmetric interfaces, even in the case of interacting interface CFT.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dispersive sum rules in AdS 2

Dispersion relations for S-matrices and CFT correlators translate UV consistency into bounds on IR observables. In this note, we construct dispersive sum rules for 1D CFTs. We use them to prove bounds on higher-derivative couplings in weakly-coupled non-gravitational EFTs in AdS2. At the leading order in the bulk-point limit, the bounds agree with the flat-space result. We compute the leading universal effect of finite AdS radius on the bounds. Along the way, we give an explicit formula for anomalous dimensions in general higher-derivative contact Witten diagrams in AdS 2 .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Yet another parameter-free shape optimization method

The use of node coordinates as design variables in shape optimization offers a larger design space than computer-aided design (CAD)-based shape parameterizations. It also allows for the optimization of legacy designs, i.e., a finite element mesh from an existing design can be readily optimized to meet new performance requirements without involving a CAD model. However, it is well known that the node coordinate parameterization method is fraught with numerical difficulties, which makes it impractical to use. This has led to several of “parameter-free” shape optimization methods that seek the advantages and avoid the pitfalls of the naïve node coordinate parameterization method. These methods come in two main varieties: sensitivity filtering (or gradient smoothing) and consistent filtering. The latter is analogous to the density filter method used in topology optimization (TO). In this work, we use the PDE filter from TO and energy-based filters to implement consistent shape optimization filtering schemes easily and efficiently. Numerical experiments demonstrate that consistent methods are more robust than sensitivity filtering methods.

42 ENGINEERING↗

A scalable exponential-DG approach for nonlinear conservation laws: With application to Burger and Euler equations

In this work, we propose an Exponential DG framework for partial differential equations. We decompose 7 governing equations into linear and nonlinear parts to which we apply the discontinuous Galerkin 8 (DG) spatial discretization. In particular, we construct the linear part using Jacobian that effectively 9 capture stiff characteristics in the system. The former is integrated analytically, whereas the latter 10 is approximated. This approach i) is stable with a large Courant number (Cr > 1); ii) supports 11 high-order solutions both in time and space; iii) is computationally favorable compared to IMEX 12 DG methods with no preconditioner; iv) becomes comparable to explicit RKDG methods on uniform 13 mesh and beneficial on non-uniform grid for Euler equations; v) is scalable in a modern massively 14 parallel computing architecture due to its explicit nature of exponential time integrators and com15 pact communication stencil of DG method. Numerical results demonstrate the performance of our 16 proposed methods through various examples. We also discuss the stability and convergence analysis 17 for our exponential DG scheme in the context of Burgers equation.

42 ENGINEERING↗

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗

Random Phase Approximation Correlation Energy Using Real-Space Density Functional Perturbation Theory

We present a real-space method for computing the random phase approximation (RPA) correlation energy within Kohn–Sham density functional theory, leveraging the low-rank nature of the frequency-dependent density response operator. In particular, we employ a cubic-scaling formalism based on density functional perturbation theory that circumvents the calculation of the response function matrix, instead relying on the ability to compute its product with a vector through the solution of the associated Sternheimer linear systems. We develop a large-scale parallel implementation of this formalism using the subspace iteration method in conjunction with the spectral quadrature method while employing the Kronecker product-based method for the application of the Coulomb operator and the conjugate orthogonal conjugate gradient method for the solution of the linear systems. We demonstrate convergence with respect to key parameters and verify the method’s accuracy by comparing with plane-wave results. We show that the framework achieves good strong scaling to many thousands of processors, reducing the time to solution for a lithium hydride system with 128 electrons to around 150 s on 4608 processors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗