Coupling Kinetic PIC to Multi-Fluid Plasma Models using Compatible Discretizations.
Abstract not provided.
SEARCH · Engineering Papers
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.
Abstract not provided.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
SAND2024-01324O MrHyDE, which stands for Multi-resolution Hybridized Differential Equations, is a general-purpose C++ package for the solution of coupled multiphysics and multiscale systems on massively parallel computing systems. MrHyDE is designed to enable moving beyond forward simulation for multiscale applications which includes optimization, control, uncertainty quantification, and stochastic inversion. The framework provides interfaces to several packages within the Trilinos framework and leverages automatic differentiation to enable adjoint capabilities for large-scale, gradient-based optimization. MrHyDE provides automated multiscale capabilities through a subgrid model interface and multiscale Dirichlet-to-Neumann maps. For extreme-scale applications, MrHyDE provides in situ data-compression algorithms to reduce memory requirements while maintaining performance. MrHyDE is a general-purpose, computational framework for the solution of multiscale and multiphysics applications. It uses a combination of structure-preserving, physics-compatible discretizations, fully implicit methods, multi-resolution schemes, or fully explicit methods. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
Nonlocal models naturally handle a range of physics of interest to SNL, but discretization of their underlying integral operators poses mathematical challenges to realize the accuracy and robustness commonplace in discretization of local counterparts. This project focuses on the concept of asymptotic compatibility, namely preservation of the limit of the discrete nonlocal model to a corresponding well-understood local solution. We address challenges that have traditionally troubled nonlocal mechanics models primarily related to consistency guarantees and boundary conditions. For simple problems such as diffusion and linear elasticity we have developed complete error analysis theory providing consistency guarantees. We then take these foundational tools to develop new state-of-the-art capabilities for: lithiation-induced failure in batteries, ductile failure of problems driven by contact, blast-on-structure induced failure, brittle/ductile failure of thin structures. We also summarize ongoing efforts using these frameworks in data-driven modeling contexts. This report provides a high-level summary of all publications which followed from these efforts.
A global-local approach was proposed to solve dynamic problems involving truss beams. A continuum Timoshenko beam was used to model sections of truss beams wherever possible and accurate. Near applied loads the continuum model was not adequate and detailed truss finite elements (discrete model) were employed. This approach was also proven efficient for an odd-shaped truss structure connected to a truss beam. Between the continuum model and the discrete model, compatibility conditions were derived.
There is a growing need to build energy infrastructure at massive scale on both Earth and in space. On Earth, increasing electricity demand from applications such as AI data centers is driving rapid expansion of power systems, while in space, long-duration missions such as lunar operations require reliable and resilient energy infrastructure that can be deployed quickly. These needs outpace the capabilities of conventional construction methods. Robotic construction offers a path to faster, lower-cost, and more consistent deployment, yet most existing approaches focus on automating individual tasks rather than end-to-end assembly. The Industrialized Construction Innovation (ICI) team at the National Laboratory of the Rockies (NLR), in collaboration with the Colorado School of Mines, has been investigating robotics and automation strategies for rapid end-to-end energy infrastructure construction. This paper presents a pilot study demonstrating level 3-4 semi-autonomous, end-to-end robotic assembly of a reduced-scale photovoltaic power plant prototype under terrestrial conditions. The approach combines hardware redesign of photovoltaic components for robotic compatibility, discrete-event and physics-based robotic simulations in synthetic environments, and sim-to-real deployment to execute end-to-end robotic assembly of[NM1.1][NM1.2] tracking components, structural members, photovoltaic modules, and embedded electrical connections. The pilot identifies key limitations like tolerance management, perception and localization, end effector capability, fastening methods, and multi-physics simulation fidelity, that must be addressed to enable end-to-end robotic assembly of full-scale energy infrastructure. The study highlights how these insights inform scaling strategies for terrestrial energy infrastructure and adaptation to unstructured and extreme environments, including off-world scenarios such as robotic assembly of vertical tall lunar towers.
Abstract not provided.
Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. Here, in this work, we analyze many-body quantum systems with Coulomb interactions, which are fundamental to electronic and molecular systems. We prove that Trotterization for such unbounded Hamiltonians achieves a 1/4-order convergence rate, with explicit polynomial dependence on the number of particles. The result holds for all initial wavefunctions in the domain of the Hamiltonian, and the 1/4-order convergence rate is optimal, as previous work has numerically demonstrated that it can be saturated by a specific initial ground state. The main challenges arise from the many-body structure and the singular nature of the Coulomb potential. Our proof strategy differs from prior state-of-the-art Trotter analyses, addressing both difficulties in a unified framework. Our analysis treats the Coulomb potential as an unbounded operator without modification or regularization, and does not rely on spatial discretization, making it compatible with both first- and second-quantized circuit constructions.
Here, we introduce a mathematically rigorous formulation for a nonlocal interface problem with jumps and propose an asymptotically compatible finite element discretization for the weak form of the interface problem. After proving the well-posedness of the weak form, we demonstrate that solutions to the nonlocal interface problem converge to the corresponding local counterpart when the nonlocal data are appropriately prescribed. Several numerical tests in one and two dimensions show the applicability of our technique, its numerical convergence to exact nonlocal solutions, its convergence to the local limit when the horizons vanish, and its robustness with respect to the patch test.
Important characteristics of the aeroacoustic wave propagation are mostly encoded in their dispersion relations. Hence, a computational aeroacoustic (CAA) algorithm, which reasonably preserves these relations, was investigated. It was derived using an optimization procedure to ensure, that the numerical derivatives preserved the wave number and angular frequency of the differential terms in the linearized, 2-D Euler equations. Then, simulations were performed to validate the scheme and a compatible set of discretized boundary conditions. The computational results were found to agree favorably with the exact solutions. The boundary conditions were transparent to the outgoing waves, except when the disturbance source was close to a boundary. The time-domain data generated by such CAA solutions were often intractable until their spectra was analyzed. Therefore, the relative merits of three different methods were included in the study. For simple, periodic waves, the periodogram method produced better estimates of the steep-sloped spectra than the Blackman-Tukey method. Also, for this problem, the Hanning window was more effective when used with the weighted-overlapped-segment-averaging and Blackman-Tukey methods gave better results than the periodogram method. Finally, it was demonstrated that the representation of time domain-data was significantly dependent on the particular spectral analysis method employed.
Here, we present compatible finite element space discretizations for the ideal compressible magnetohydrodynamic equations. The magnetic field is considered both in div- and curl-conforming spaces, leading to a strongly or weakly preserved zero-divergence condition, respectively. The equations are discretized in space such that transfers between the kinetic, internal, and magnetic energies are consistent, leading to a preserved total energy. We also discuss further adjustments to the discretization required to additionally achieve magnetic helicity preservation. Finally, we describe new transport stabilization methods for the magnetic field equation which maintain the zero-divergence and energy conservation properties, including one method which also preserves magnetic helicity. The methods' preservation and improved stability properties are confirmed numerically using a steady state and a magnetic dynamo test case.
The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.
Landing aircraft on board carriers is a most delicate phase of flight operations at sea. The ability to predict the aircraft carrier's motion over an interval of several seconds within reasonable error bounds may allow an improvement in touchdown dispersion and reduce the value of the ramp clearance due to a smoother aircraft trajectory. Also, improved information to the landing signal officer should decrease the number of waveoffs substantially. This paper indicates and shows quantitatively that, based upon the power density spectrum data for pitch and heave measured for various ships and sea conditions, the motion can be predicted well, for up to 15 s. Moreover, the zero crossover times for both pitch and heave motions can be predicted with impressive accuracy. The predictor was designed on the basis of Kalman's optimum filtering theory (the discrete time case), being compatible with real-time digital computer operation.
In this paper, we present a new space-time Galerkin-like method, where we treat the discretization of spatial and temporal domains simultaneously. This method utilizes a mixed formulation of the tensor-train (TT) and quantized tensor-train (QTT) (please see Section Tensor-Train Decomposition), designed for the finite element discretization (Q1-FEM) of the time-dependent convection–diffusion–reaction (CDR) equation. We reformulate the assembly process of the finite element discretized CDR to enhance its compatibility with tensor operations and introduce a low-rank tensor structure for the finite element operators. Recognizing the banded structure inherent in the finite element framework’s discrete operators, we further exploit the QTT format of the CDR to achieve greater speed and compression. Additionally, we present a comprehensive approach for integrating variable coefficients of CDR into the global discrete operators within the TT/QTT framework. The effectiveness of the proposed method, in terms of memory efficiency and computational complexity, is demonstrated through a series of numerical experiments, including a semi-linear example.
Watershed delineation and flow direction representation are the foundations of streamflow routing in spatially distributed hydrologic modeling. A recent study showed that hexagon-based watershed discretization has several advantages compared to the traditional Cartesian (latitude–longitude) discretization, such as uniform connectivity and compatibility with other Earth system model components based on unstructured mesh systems (e.g., oceanic models). Despite these advantages, hexagon-based discretization has not been widely adopted by the current generation of hydrologic models. One major reason is that there is no existing model that can delineate hexagon-based watersheds while maintaining accurate representations of flow direction across various spatial resolutions. In this study, we explored approaches such as spatial resampling and hybrid breaching-filling stream burning techniques to improve watershed delineation and flow direction representation using a newly developed hexagonal mesh watershed delineation model (HexWatershed). We applied these improvements to the Columbia River basin and performed 16 simulations with different configurations. The results show that (1) spatial resampling modulates flow direction around headwaters and provides an opportunity to extract subgrid information; and (2) stream burning corrects the flow directions in mountainous areas with complex terrain features.
One of the fundamental factors contributing to the spatiotemporal inaccuracy in climate modeling is the mapping of solution field data between different discretizations and numerical grids used in the coupled component models. The typical climate computational workflow involves evaluation and serialization of the remapping weights during the preprocessing step, which is then consumed by the coupled driver infrastructure during simulation to compute field projections. Tools like Earth System Modeling Framework (ESMF) and TempestRemap offer capability to generate conservative remapping weights, while the Model Coupling Toolkit (MCT) that is utilized in many production climate models exposes functionality to make use of the operators to solve the coupled problem. However, such multistep processes present several hurdles in terms of the scientific workflow and impede research productivity. In order to overcome these limitations, we present a fully integrated infrastructure based on the Mesh Oriented datABase (MOAB) library, which allows for a complete description of the numerical grids and solution data used in each submodel. Through a scalable advancing-front intersection algorithm, the supermesh of the source and target grids are computed, which is then used to assemble the high-order, conservative, and monotonicity-preserving remapping weights between discretization specifications. The Fortran-compatible interfaces in MOAB are utilized to directly link the submodels in the Energy Exascale Earth System Model (E3SM) to enable online remapping strategies in order to simplify the coupled workflow process. We demonstrate the superior computational efficiency of the remapping algorithms in comparison with other state-of-the-science tools and present strong scaling results on large-scale machines for computing remapping weights between the spectral element atmosphere and finite volume discretizations on the polygonal ocean grids.