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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A Condensed Constrained Nonconforming Mortar-Based Approach for Preconditioning Finite Element Discretization Problems

This paper presents and studies an approach for constructing auxiliary space preconditioners for finite element problems using a constrained nonconforming reformulation that is based on a proposed modified version of the mortar method. The well-known mortar finite element discretization method is modified to admit a local structure, providing an element-by-element or subdomain-by-subdomain assembly property. This is achieved via the introduction of additional trace finite element spaces and degrees of freedom (unknowns) associated with the interfaces between adjacent elements or subdomains. The resulting nonconforming formulation and a reduced-via-static-condensation Schur complement form on the interfaces are used in the construction of auxiliary space preconditioners for a given conforming finite element discretization problem. Overall, the properties of these preconditioners are studied and their performance is illustrated on model second order scalar elliptic problems utilizing high order elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Memory access optimization for particle operations in computational fluid dynamics-discrete element method simulations

Computational Fluid Dynamics - Discrete Element Method is used to model gas-solid systems in several applications in energy, pharmaceutical and petrochemical industries. Computational performance bottlenecks often limit the problem sizes that can be simulated at industrial scale. The data structures used to store several millions of particles in such large-scale simulations have a large memory footprint that does not fit into the processor cache hierarchies on current high-performance-computing platforms, leading to reduced computational performance. This paper specifically addresses this aspect of memory access bottlenecks in industrial scale simulations. The use of space-filling curves to improve memory access patterns is described and their impact on computational performance is quantified in both shared and distributed memory parallelization paradigms. The Morton space filling curve applied to uniform grids and k-dimensional tree partitions are used to reorder the particle data-structure thus improving spatial and temporal locality in memory. The performance impact of these techniques when applied to two benchmark problems, namely the homogeneous-cooling-system and a fluidized-bed, are presented. We report these optimization techniques lead to approximately two-fold performance improvement in particle focused operations such as neighbor-list creation and data-exchange, with ~ 1.5 times overall improvement in a fluidization simulation with 1.27 million particles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Emergent Properties from Three-Dimensional Assemblies of (Nano)particles in Confined Spaces

The assembly of (nano)particles into compact hierarchical structures yields emergent properties not found in the individual constituents. The formation of these structures relies on a profound knowledge of the nanoscale interactions between (nano)particles, which are often designed by researchers aided by computational studies. These interactions have an effect when the (nano)particles are brought into close proximity, yet relying only on diffusion to reach these closer distances may be inefficient. Recently, physical confinement has emerged as an efficient methodology to increase the volume fraction of (nano)particles, rapidly accelerating the time scale of assembly. Specifically, the high surface area of droplets of one immiscible fluid into another facilitates the controlled removal of the dispersed phase, resulting in spherical, often ordered, (nano)particle assemblies. In this review, we discuss the design strategies, computational approaches, and assembly methods for (nano)particles in confined spaces and the emergent properties therein, such as trigger-directed assembly, lasing behavior, and structural photonic color. Finally, we provide a brief outlook on the current challenges, both experimental and computational, and farther afield application possibilities.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Auxiliary Space Preconditioning of Finite Element Equations Using a Nonconforming Interior Penalty Reformulation and Static Condensation

We modify the well-known interior penalty finite element discretization method so that it allows for element-by-element assembly. This is possible due to the introduction of additional unknowns associated with the interfaces between neighboring elements. The resulting bilinear form, and a Schur complement (reduced) version of it, are utilized in a number of auxiliary space preconditioners for the original conforming finite element discretization problem. Furthermore, these preconditioners are analyzed on the fine scale, and their performance is illustrated on model second order scalar elliptic problems discretized with high order elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Graph neural networks for CO 2 solubility predictions in Deep Eutectic Solvents

Deep Eutectic Solvents (DESs) are a promising class of solvents for CO 2 capture. DESs are complex mixtures that can be designed to optimize CO solubility and overall capture process efficiency. However, the vast design landscape of DES mixtures makes experimental investigation prohibitive; as such, there is a need for computational models that can quickly and efficiently navigate the design space and inform data collection efforts. In this work, we propose Graph Neural Network (GNN) models for predicting CO 2 solubility for DESs; the GNN leverages a mixture graph representation that captures the molecular structure of the DES components as well as their intermolecular interactions. Here, we compare the GNN framework against alternative architectures (neural networks, graph convolution networks, and random forests) and data representations (molecular fingerprints, sigma profiles, and graphs). We show that the proposed approach offers superior predictive performance; specifically, we show that solubility can be predicted reliably directly from molecular structure (without the need of using sigma profiles as proposed in previous studies). This result is important, as obtaining sigma profiles requires expensive density functional theory computations. We also explored the ability of GNNs to predict solubility for new DES mixtures and operating conditions. We found that the model extrapolates across temperature reliably. However, we also found deficiencies in the ability of the model to predict solubility for DES mixtures, pressures, and molar ratio not included in the training sets; we show that this is due to an inherent lack of chemical diversity in datasets available in the literature. The proposed computational capabilities can thus help navigate the design space of DES and inform data collection efforts. Our models, data, and benchmarks are shared as Python code implemented in Jupyter notebooks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Crystal mechanics-based thermo-elastic constitutive modeling of orthorhombic uranium using generalized spherical harmonics and first-order bounding theories

In earlier works, a mathematical procedure for invertible microstructure-property linkages was developed using computationally efficient spectral methods for polycrystalline cubic and hexagonal metals. This paper formulates such invertible microstructure–property linkages for orthorhombic polycrystalline metals relying on the generalized spherical harmonics (GSH) spectral basis. The procedure is used to compute property closures of orthorhombic polycrystals. The closures represent the complete set of theoretically possible combinations of effective properties for a selected material. The procedure relies on the first-order bounding theories and considers orientation distribution functions (ODFs) as the main microstructural descriptor influencing homogenized properties. Numerous examples of these closures involving second-rank thermal expansion and fourth-rank elastic stiffness tensorial properties over a broad range of temperatures are presented for α-uranium (α-U). In doing so, certain key properties of these closures are exploited to facilitate their computation with drastically reduced computational effort. Along with the recently developed GSH-based interpolation procedure for ODFs from coarsely spaced experimental measurement grids to finely spaced finite element mesh resolution grids presented in Barrett et al., the developed computationally efficient ODF-effective property linkages are used to establish a crystal mechanics-based simulation framework coupled with the finite element method (FEM). The ODF dependent thermal expansion and elastic stiffness tensors are efficiently calculated at every integration point and used by the FEM to predict the overall distortion of a hemispherical part made of α-U during heating. In conclusion, it is shown that the developed framework can be used to simulate microstructurally heterogeneous components under thermo-mechanical loadings in a computationally efficient manner.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Large scale multi-node simulations of $\mathbb{Z}_2$ gauge theory quantum circuits using Google Cloud Platform

Simulating quantum field theories on a quantum computer is one of the most exciting fundamental physics applications of quantum information science. Dynamical time evolution of quantum fields is a challenge that is beyond the capabilities of classical computing, but it can teach us important lessons about the fundamental fabric of space and time. Whether we may answer scientific questions of interest using near-term quantum computing hardware is an open question that requires a detailed simulation study of quantum noise. Here we present a large scale simulation study powered by a multi-node implementation of qsim using the Google Cloud Platform. We additionally employ newly-developed GPU capabilities in qsim and show how Tensor Processing Units -- Application-specific Integrated Circuits (ASICs) specialized for Machine Learning -- may be used to dramatically speed up the simulation of large quantum circuits. We demonstrate the use of high performance cloud computing for simulating $\mathbb{Z}_2$ quantum field theories on system sizes up to 36 qubits. We find this lattice size is not able to simulate our problem and observable combination with sufficient accuracy, implying more challenging observables of interest for this theory are likely beyond the reach of classical computation using exact circuit simulation.

Gustafson, Erik↗
DOE OSTI2025

The Profiled Feldman-Cousins Method for Confidence Interval Construction for the Nova 3-Flavor Oscillation Analysis

The small interaction cross-section of neutrinos makes experimental neutrino physics particularly responsive to technological advancements. A significant development leveraged by the NOvA experiment is large-scale parallel processing, enabling novel computational approaches to longstanding experimental challenges. Central to managing the resulting high-throughput data is NOvA’s implementation of the Freight Train model, designed for efficient data production and handling.This dissertation details the methodology and execution of the NOvA 2024 3-Flavor Oscillation Analysis, supported by a comprehensive dataset spanning ten years. It emphasizes frequentist results refined through the Feldman-Cousins (FC) technique, specifically addressing confidence interval corrections in parameter estimation. The computational intensity associated with Feldman-Cousins arises from extensive Monte Carlo simulations, which were substantially mitigated through parallel computing on the Perlmutter supercomputer at the National Energy Research Scientific Computing Center (NERSC), employing the MPI framework.To further enhance computational efficiency, an Importance Sampling method is introduced and evaluated, demonstrating significant potential to reduce complexity, particularly in exploring extreme parameter space regions. This thesis presents both the successful application of advanced computational resources and the development of sophisticated statistical techniques, aiming to enhance the precision and scope of neutrino oscillation analyses.

Dye ajdye11190@gmail.com, Andrew Joseph [Mississip↗
DOE OSTI2026

PRISMA: PARALLEL REFINEMENT AND INTEGRATION SYSTEM FOR MULTI-AZIMUTHAL ANALYSIS

The Parallel Refinement and Integration System for Multi-azimuthal Analysis (PRISMA, version 1.1.0) is a Python application for processing X-ray diffraction (XRD) image data. PRISMA wraps GSAS-II to perform azimuthally-binned peak refinement, computes per-frame strain and d-spacing from those fits, and provides three PyQt5 graphical interfaces: (1) a Recipe Builder for selecting GSAS-II control (.imctrl) files, optional mask (.immask) files or threshold-ased masking, reference and experiment image sets, peaks, zimuthal range and bin size, and an optional ceria-based auto-calibration; (2) a Batch Processor that uses Dask on local workstations and pure MPI (mpi4py.futures.MPICommExecutor) on HPC to distribute GSAS-II refinement across cores or compute nodes and write results to a 4-dimensional (peaks x frames x azimuths x measurements) Zarr dataset; and (3) a Data Analyzer that renders heatmaps of fit parameters, strain, frame-to-frame deltas, and percent-change-vs-reference, and exports user-defined subsections to CSV or Excel. The peak-refinement algorithm is deterministic. Benchmark on ALCF Crux: a 20,000-image set, single-peak fit in frame mode with 44 azimuthal bins on 128 nodes x 128 workers, 48 seconds total wall time.

Lorenzo Martin, Maria De La Cinta [Argonne Nationa↗
DOE OSTI2026

The emergent photophysics and photochemistry of molecular polaritons: a theoretical and computational investigation (Final Technical Report)

When molecules are placed between closely spaced mirrors, they interact strongly with the photons that are trapped between them, generating new quantum states which are no longer exclusively material nor photonic alone, but rather, coherent superpositions of both. These hybrid states are known as molecular polaritons, given that they arise from the strong interaction between the electric field of light and the electrical polarization of the molecules. Recently, experimental advances in nano‐ and microfabrication of molecular polariton architectures have successfully demonstrated their feasibility to control the rate and outcome of a certain class of chemical reactions in condensed phases. Importantly, these reactions proceed in strongly dissipative environments such as liquid solvents and lossy mirrors that allow for photons to escape from their confinement. The purpose of this research is to formulate quantum mechanical theories and computational tools that can elucidate the origin of these intriguing phenomena and simultaneously predict capabilities that this new generation of molecular materials affords. Attention is placed on harnessing polaritons to carry out photophysics and photochemistry that challenge currently existing paradigms, such as the optimization of energy conversion processes in organic solar cell or light‐emitting devices, or unconventional phenomena such as long‐range excitation energy transfer, remote control of chemical reactions, and a new quantum mechanical regime of chemical reactivity due to wavefunction overlaps amongst a large number of molecular polaritons (Bose condensation). This research explores a frontier of Chemistry and Physics where electrons, vibrations, and photons interact strongly with each other to generate emergent behavior that can be creatively exploited to address contemporary challenges in Basic Energy Sciences.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Higher spin partition functions via the quasinormal mode method in de Sitter quantum gravity

In this note we compute the 1-loop partition function of spin- s s fields on Euclidean de Sitter space S^{2n+1} S 2 n + 1 using the quasinormal mode method. Instead of computing the quasinormal mode frequencies from scratch, we use the analytic continuation prescription L_{\text{AdS}}\to iL_{\text{dS}} L AdS → i L dS , appearing in the dS/CFT correspondence, and Wick rotate the normal mode frequencies of fields on thermal \text{AdS}_{2n+1} AdS 2 n + 1 into the quasinormal mode frequencies of fields on de Sitter space. We compare the quasinormal mode and heat kernel methods of calculating 1-loop determinants, finding exact agreement, and furthermore explicitly relate these methods via a sum over the conformal dimension. We discuss how the Wick rotation of normal modes on thermal \text{AdS}_{2n+1} AdS 2 n + 1 can be generalized to calculating 1-loop partition functions on the thermal spherical quotients S^{2n+1}/\mathbb{Z}_{p} S 2 n + 1 / ℤ p . We further show that the quasinormal mode frequencies encode the group theoretic structure of the spherical spacetimes in question, analogous to the analysis made for thermal AdS in [1-3] .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Transport barriers to self-propelled particles in fluid flows

Here, we present theory and experiments demonstrating the existence of invariant manifolds that impede the motion of microswimmers in two-dimensional fluid flows. One-way barriers are apparent in a hyperbolic fluid flow that block the swimming of both smooth-swimming and run-and-tumble Bacillus subtilis bacteria. We identify key phase-space structures, called swimming invariant manifolds (SwIMs), that serve as separatrices between different regions of long-time swimmer behavior. When projected into xy space, the edges of the SwIMs act as one-way barriers, consistent with the experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Navigating Uncertainty: Challenges in Visualizing Ensemble Data and Surrogate Models for Decision Systems

Uncertainty visualization plays a critical role in transforming ensemble simulation data into actionable insights by effectively communicating various dimensions of uncertainty within a system. The emergence of artificial intelligence-driven surrogate models trained on multirun ensemble data offers a transformative opportunity to replace computationally intensive simulations with fast estimates, enabling users to explore data spaces with unprecedented depth and interactivity. However, integrating ensemble data and surrogate models into decision-making workflows and tools introduces novel challenges for uncertainty visualization. These include reconciling and clearly communicating the unique uncertainties associated with ensembles and their surrogate model estimates, and leveraging these approximations to inform actionable decisions. This work explores these challenges in the context of high-dimensional data visualization, bridging discrete datasets with their continuous representations and addressing the complexities of systems that support iterative navigation between input and output spaces. We evaluate the role of uncertainty visualization in fostering intuitive, actionable interactions and identify critical hurdles in advancing this frontier of computational simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

$\text{GPLaSDI}$: Gaussian Process-based interpretable Latent Space Dynamics Identification through deep autoencoder

Numerically solving partial differential equations (PDEs) can be challenging and computationally expensive. This has led to the development of reduced-order models (ROMs) that are accurate but faster than full order models (FOMs). Recently, machine learning advances have enabled the creation of non-linear projection methods, such as Latent Space Dynamics Identification (LaSDI). LaSDI maps full-order PDE solutions to a latent space using autoencoders and learns the system of ODEs governing the latent space dynamics. By interpolating and solving the ODE system in the reduced latent space, fast and accurate ROM predictions can be made by feeding the predicted latent space dynamics into the decoder. In this paper, we introduce GPLaSDI, a novel LaSDI-based framework that relies on Gaussian process (GP) for latent space ODE interpolations. Using GPs offers two significant advantages. First, it enables the quantification of uncertainty over the ROM predictions. Second, leveraging this prediction uncertainty allows for efficient adaptive training through a greedy selection of additional training data points. This approach does not require prior knowledge of the underlying PDEs. Consequently, GPLaSDI is inherently non-intrusive and can be applied to problems without a known PDE or its residual. Here we demonstrate the effectiveness of our approach on the Burgers equation, Vlasov equation for plasma physics, and a rising thermal bubble problem. Our proposed method achieves between 200 and 100,000 times speed-up, with up to 7% relative error.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Light scalars at the cosmological collider

We study the self-energies of weakly interacting scalar fields in de Sitter space with one field much lighter than the Hubble scale. We argue that self-energies drastically simplify in this light limit. We illustrate this in theories with two scalar fields, one heavy and one light, interacting with one another through either cubic or quartic interactions. To regulate infrared divergences, we compute these self-energies in Euclidean de Sitter space and then carefully analytically continue to Lorentzian signature. In particular, we do this for the most general renormalizable theory of two scalar fields with even interactions to leading order in the coupling and the mass of the light field. These self-energies are determined by de Sitter sunset diagrams, whose analytic structure and UV divergences we derive. Even at very weak couplings, the light field can substantially change how the heavy field propagates over long distances. The light field’s existence may then be inferred from how it modifies the heavy field’s oscillatory contribution to the primordial bispectrum in the squeezed limit, i.e. its cosmological collider signal.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Ultrastrong magnon-magnon coupling and chiral spin-texture control in a dipolar 3D multilayered artificial spin-vortex ice

Strongly-interacting nanomagnetic arrays are ideal systems for exploring reconfigurable magnonics. They provide huge microstate spaces and integrated solutions for storage and neuromorphic computing alongside GHz functionality. These systems may be broadly assessed by their range of reliably accessible states and the strength of magnon coupling phenomena and nonlinearities. Increasingly, nanomagnetic systems are expanding into three-dimensional architectures. This has enhanced the range of available magnetic microstates and functional behaviours, but engineering control over 3D states and dynamics remains challenging. Here, we introduce a 3D magnonic metamaterial composed from multilayered artificial spin ice nanoarrays. Comprising two magnetic layers separated by a non-magnetic spacer, each nanoisland may assume four macrospin or vortex states per magnetic layer. This creates a system with a rich 16 N microstate space and intense static and dynamic dipolar magnetic coupling. The system exhibits a broad range of emergent phenomena driven by the strong inter-layer dipolar interaction, including ultrastrong magnon-magnon coupling with normalised coupling rates of $\frac{Δf}{v}$ = 0.57, GHz mode shifts in zero applied field and chirality-control of magnetic vortex microstates with corresponding magnonic spectra.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Matrix-free preconditioning for high-order H (curl) discretizations

The greater arithmetic intensity of high-order finite element discretizations makes them attractive for implementation on next-generation hardware, but assembly of high-order finite element operators as matrices is prohibitively expensive. As a result, the development of general algebraic solvers for such operators has been an open research challenge. Fast matrix-free application of high-order operators has received significant attention in the literature in the context of Poisson-type problems, but preconditioners and solvers for inverting more general operators are not very well-developed. In this paper, we consider the problem of preconditioning a definite Maxwell operator at high polynomial order without assembling a matrix. We show that given efficient preconditioners for high-order H 1 finite element problems on the same mesh, efficient H(curl) preconditioners can be constructed in an auxiliary space framework. We demonstrate the resulting preconditioners in a practical setting with tensor-product basis functions on an unstructured mesh of quadrilaterals. Overall, our approach uses a sparsified H 1 solver constructed on a low-order mesh of the nodal points of the underlying high-order space, and we show that the resulting H(curl) preconditioner is effective at very high polynomial orders for two-dimensional model problems with complicated geometry, varying piecewise constant coefficients, and curved elements. The resulting preconditioner scales with nearly optimal O(p d+1 ) floating point operation count and optimal O(p d ) memory transfer requirements, outperforming existing Maxwell preconditioners in the high-order regime.

97 MATHEMATICS AND COMPUTING↗