Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mesh data structure”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

HfTi_BCC_SolidSolution_128atoms_VASP6

We performed density functional theory (DFT) calculations for body-centered-cubic (BCC) structures with 128 lattices sites of solid solution binary alloys hafnium-titanium (Hf-Ti). The electronic structures of alloys have been calculated using Vienna Ab initio Simulation Package (VASP). Within this package the DFT approach is used to reduce many-body Schrodinger equation to set of single particle Kohn-Sham (KS) equations. The generalized electronic exchange-correlation functional is described by generalized gradient approximation with the Perdew-Burke-Ernzerhof parametrization. The electron-ion interactions is described by pseudopotentials developed within the plane-wave basis projector augmented-wave (PAW) approach. These pseudopotentials are available at the VASP portal (http://cms.mpi.univie.ac.at/vasp/). Our calculations have been run with the pseudopotentials treating s and p semi-core states as valence in case for the elements Hf and Ti. The electronic densities and potentials are expanded over plane-waves with energy cutoff of 350 eV. 2x2x2 k-mesh and normal precision were used. The alloys were modeled by supercell containing 128 randomly distributed atoms. At initial step the atoms occupy perfect bcc lattice cites. This initial structure was optimized until energy changes less than 1e-6 eV, while forces acting on atoms don't exceed 1e-2 eV/angstrom. The electron-ion interaction is described by PAW pseudopotentials. The calculations have been collected by sampling chemical compositions across the entire compositional range. The chemical compositions have been sampled by progressively changing the number of atoms per constituent by 4. For each chemical composition of binaries and ternaries, the first-principle calculations have been run for 100 randomized arrangements of the constituents on the BCC lattice sites. We collected data for a total of 3,100 randomized atomic structures over 31 chemical compositions. The calculations have been collected on Air Force HPC11 cluster using the VASP 6.5.1. Additional methodology and file structure information is available in the dataset README.txt file.

36 MATERIALS SCIENCE↗
DOE OSTI2026

TiV_BCC_SolidSolution_128atoms_VASP6

We performed density functional theory (DFT) calculations for body-centered-cubic (BCC) structures with 128 lattices sites of solid solution binary alloys titanium-vanadium (Ti-V). The electronic structures of alloys have been calculated using Vienna Ab initio Simulation Package (VASP). Within this package the DFT approach is used to reduce many-body Schrodinger equation to set of single particle Kohn-Sham (KS) equations. The generalized electronic exchange-correlation functional is described by generalized gradient approximation with the Perdew-Burke-Ernzerhof parametrization. The electron-ion interactions is described by pseudopotentials developed within the plane-wave basis projector augmented-wave (PAW) approach. These pseudopotentials are available at the VASP portal (http://cms.mpi.univie.ac.at/vasp/). Our calculations have been run with the pseudopotentials treating s and p semi-core states as valence in case for the elements Ti and V. The electronic densities and potentials are expanded over plane-waves with energy cutoff of 350 eV. 2x2x2 k-mesh and normal precision were used. The alloys were modeled by supercell containing 128 randomly distributed atoms. At initial step the atoms occupy perfect bcc lattice cites. This initial structure was optimized until energy changes less than 1e-6 eV, while forces acting on atoms don't exceed 1e-2 eV/angstrom. The electron-ion interaction is described by PAW pseudopotentials. The calculations have been collected by sampling chemical compositions across the entire compositional range. The chemical compositions have been sampled by progressively changing the number of atoms per constituent by 4. For each chemical composition of binaries and ternaries, the first-principle calculations have been run for 100 randomized arrangements of the constituents on the BCC lattice sites. We collected data for a total of 3,100 randomized atomic structures over 31 chemical compositions. The calculations have been collected on Air Force HPC11 cluster using the VASP 6.5.1. Additional methodology and file structure information is available in the dataset README.txt file.

36 MATERIALS SCIENCE↗
DOE OSTI2026

NbTi_BCC_SolidSolution_128atoms_VASP6

We performed density functional theory (DFT) calculations for body-centered-cubic (BCC) structures with 128 lattices sites of solid solution binary alloys niobium-titanium (Nb-Ti). The electronic structures of alloys have been calculated using Vienna Ab initio Simulation Package (VASP), https://github.com/ORNL/ScalableWorkflow_VASP_Calculations. Within this package the DFT approach is used to reduce many-body Schrodinger equation to set of single particle Kohn-Sham (KS) equations. The generalized electronic exchange-correlation functional is described by generalized gradient approximation with the Perdew-Burke-Ernzerhof parametrization. The electron-ion interactions is described by pseudopotentials developed within the plane-wave basis projector augmented-wave (PAW) approach. These pseudopotentials are available at the VASP portal (http://cms.mpi.univie.ac.at/vasp/). Our calculations have been run with the pseudopotentials treating s and p semi-core states as valence in case for the elements Nb and Ti. The electronic densities and potentials are expanded over plane-waves with energy cutoff of 350 eV. 2x2x2 k-mesh and normal precision were used. The alloys were modeled by supercell containing 128 randomly distributed atoms. At initial step the atoms occupy perfect bcc lattice cites. This initial structure was optimized until energy changes less than 1e-6 eV, while forces acting on atoms don't exceed 1e-2 eV/angstrom. The electron-ion interaction is described by PAW pseudopotentials. The calculations have been collected by sampling chemical compositions across the entire compositional range. The chemical compositions have been sampled by progressively changing the number of atoms per constituent by 4. For each chemical composition of binaries and ternaries, the first-principle calculations have been run for 100 randomized arrangements of the constituents on the BCC lattice sites. We collected data for a total of 3,100 randomized atomic structures over 31 chemical compositions. The calculations have been collected on Air Force HPC11 cluster using the VASP 6.5.1. Additional methodology and file structure information is available in the dataset README.txt file.

36 MATERIALS SCIENCE↗
DOE OSTI2025

High fidelity blade-resolved and actuator line data from a 16 turbine wind farm simulation using ExaWind

This data was generated with the ExaWind code suite (https://github.com/Exawind) as a demonstration of a large, 16 turbine wind farm simulation, calculated using two different levels of fidelity. The lower level of fidelity approach uses an actuator line approach to represent the turbines, and was simulated with AMR-Wind (https://github.com/Exawind/amr-wind/) as the background flow solver, coupled to OpenFAST (https://github.com/OpenFAST/openfast). The higher level of fidelity simulation uses a blade-resolved approach, and is done using AMR-Wind, Nalu-Wind (https://github.com/Exawind/nalu-wind), OpenFAST, and TIOGA (https://github.com/Exawind/tioga). In the blade-resolved simulation, ExaWind couples together a background flow solver, AMR-Wind, and a near-body solver, Nalu-Wind, through an overset technique from the TIOGA application. OpenFAST handles the structural dynamics of the turbine blades and towers, which informs the fluid-structure interaction of the wind turbines with the flow solvers. In the actuator line simulation, a mesh of 295M elements was used for a 5km x 5km domain, and it was simulated using 256 nodes (2048 GPU's) on the Oak Ridge Leadership Computing Facility Frontier supercomputer. For the blade-resolved simulation, 1.5B element mesh was used in the AMR-Wind background 5km x 5km domain, and 16M elements were used for each turbine in the Nalu-Wind domains, for a total of 1.7B elements. This was simulated using 384 nodes on Frontier, with each node using 56 cores for Nalu-Wind and 8 GPU cores. The data in this archive includes the turbine outputs from OpenFAST, 2D sampling planes from AMR-Wind, and full-field solution files from AMR-Wind and Nalu-Wind.

17 WIND ENERGY↗
DOE OSTI2022

Numerical and experimental investigation of the flame kernel growth in a methane/air mixture near the lean flammability limit

Lean combustion has the potential to improve the thermal efficiency of spark-ignition engines, but it faces the significant challenge of increased cycle-to-cycle variation due to low mixture reactivity and unstable flame dynamics. Computational fluid dynamics (CFD) employing predictive models can guide engine design and optimize operating strategies for lean combustion. However, ignition and combustion models have rarely been validated at fuel-lean conditions, and a fundamental understanding of the early flame kernel growth process is also lacking for a successful sub-model development. Here, the present study develops a numerical simulation framework used to investigate early flame kernel growth in methane/air mixtures. A nanosecond-pulsed discharge (NPD) approach is employed to effectively decouple the flame kernel growth from the electrical discharge due to their difference in timescales, and equivalence ratios near the experimentally measured lean flammability limit (LFL) are selected to focus on challenging mixture conditions. Three numerical investigations, such as the choice of turbulence modeling, grid size, and grid control strategies, are examined to match both LFL and flame kernel structure measured from experiments. It is demonstrated that a quasi-direct numerical simulation (QDNS) with a fixed grid embedding of 10 μm can predict the LFL as φ CFD =0.61 and match the displacement speed of the kernel’s boundary marked in schlieren images. To predict the LFL and flame kernel shape, a fine grid (Δ≤12.5 μm) is needed to capture the consumption of formaldehyde (CH 2 O) in kernel’s reaction branches attached to the anode, and adaptive mesh refinement is replaced with the fixed embedding due to loss of simulation accuracy. Also, it is found that a large-eddy simulation (LES) using the Dynamic Structure model is not suitable for the NPD-induced flame kernel simulation because artificial sub-grid turbulent kinetic energy induced by shock dynamics alters the flow velocity calculation, resulting in divergence of LES from QDNS. Lastly, the simulation well matches the experimental data for the flame kernel evolution in three mixture conditions (φ = 0.7, 0.61, 0.55), showing toroidal flame kernel expansion and flame kernel growth/extinction.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

AMReX and pyAMReX: Looking beyond the exascale computing project

AMReX is a software framework for the development of block-structured mesh applications with adaptive mesh refinement (AMR). AMReX was initially developed and supported by the AMReX Co-Design Center as part of the U.S. DOE Exascale Computing Project (ECP), and is continuing to grow post-ECP. In addition to adding new functionality and performance improvements to the core AMReX framework, we have also developed a Python binding, pyAMReX, that provides a bridge between AMReX-based application codes and the data science ecosystem. pyAMReX provides zero-copy application GPU data access for AI/ML, in situ analysis and application coupling, and enables rapid, massively parallel prototyping. In this paper we review the overall functionality of AMReX and pyAMReX, focusing on new developments, new functionality, and optimizations of key operations. We also summarize capabilities of ECP projects that used AMReX and provide an overview of new, non-ECP applications.

Myers, Andrew↗
DOE OSTI2020

Scalable line and plane relaxation in a parallel structured multigrid solver

The efficient solution of sparse, linear systems that arise through the discretization of partial differential equations remains a key challenge for a range of high performance scientific simulations. One approach for reducing data movement and improving performance is by exposing and exploiting structure in a problem through the use of robust structured multilevel solvers. By choosing coarsening that preserves the structure of the problem, these methods maintain efficient structured computation and communication throughout the multigrid hierarchy. However, when coarsening is not permitted to be dependent on the operator, anisotropy must be addressed by the smoother — producing error compatible for coarse-grid correction with structured coarsening. Here, the components required in a scalable parallel structured solver are described with a focus on memory and communication efficiency of robust smoothers. While the implementation of communication and memory reduction techniques in smoothers integrated in a complete 3D solver present a significant engineering challenge, a novel approach is proposed that addresses these challenges systematically through a change to the solver’s execution model. Enabled by user-level threading paired with a set of data and communication abstractions, this approach permits seamless aggregation of communication in plane smoothers — directly reusing code for a 2D distributed multilevel cycle. Results show an effective reduction in communication costs for coarse-grid problems, and result in a speedup of 8.7x in smoothing routines shown in Fig. 12 using this approach. This produces a significant improvement to strong scalability while maintaining favorable weak scaling behavior. Finally, a parallel scaling study using a series of refined meshes is included that demonstrates the effectiveness of this approach in an application of interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A multiphysics coupling framework for exascale simulation of fracture evolution in subsurface energy applications

Predicting the evolution of fractured media is challenging due to coupled thermal, hydrological, chemical and mechanical processes that occur over a broad range of spatial scales, from the microscopic pore scale to field scale. We present a software framework and scientific workflow that couples the pore scale flow and reactive transport simulator Chombo-Crunch with the field scale geomechanics solver in GEOS to simulate fracture evolution in subsurface fluid-rock systems. This new multiphysics coupling capability comprises several novel features. An HDF5 data schema for coupling fracture positions between the two codes is employed and leverages the coarse resolution of the GEOS mechanics solver which limits the size of data coupled, and is, thus, not taxed by data resulting from the high resolution pore scale Chombo-Crunch solver. The coupling framework requires tracking of both before and after coarse nodal positions in GEOS as well as the resolved embedded boundary in Chombo-Crunch. We accomplished this by developing an approach to geometry generation that tracks the fracture interface between the two different methodologies. The GEOS quadrilateral mesh is converted to triangles which are organized into bins and an accessible tree structure; the nodes are then mapped to the Chombo representation using a continuous signed distance function that determines locations inside, on and outside of the fracture boundary. The GEOS positions are retained in memory on the Chombo-Crunch side of the coupling. The time stepping cadence for coupled multiphysics processes of flow, transport, reactions and mechanics is stable and demonstrates temporal reach to experimental time scales. The approach is validated by demonstration of 9 days of simulated time of a core flood experiment with fracture aperture evolution due to invasion of carbonated brine in wellbore-cement and sandstone. We also demonstrate usage of exascale computing resources by simulating a high resolution version of the validation problem on OLCF Frontier.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗
DOE OSTI2024

MOSCATO Development and Integration in Fiscal Year 2024

MOSCATO (Molten Salt Chemistry and Transport) is a multiphysics code that provides high-fidelity, coupled simulations of fluid flow, heat transfer, mass transfer, chemistry, electrochemical phenomena, and alloy evolution for molten salt equipment. In FY24, significant developments were made to the code package, enhancing its capabilities in many aspects. The improvements and advancements can be summarized as follows: 1. Implementation of tritium transport capabilities and validation with experimental data: To enable modeling of tritium and other fission gases within MSRs, we implemented gas transport within MOSCATO via inclusion of couple mass transport equations within the salt and structural alloys. Comparisons to experimental data from literature showed good agreement with respect to tritium release rates. 2. Preliminary implementation of two-phase flow models in MOSCATO: To model tritium and other gases above their solubility limits, we implemented preliminary two-phase flow models within MOSCATO to account for bubble transport. The first model adopted was the Level-Set approach, which can handle the high void fraction regime, but with a requirement for high mesh resolution thus high computational expense. In this report, we present a verification of the Level-Set method using a simple benchmark case. We also performed a demonstration of the code as applied to an experimental case involving cover gas flow through salt in an experimental vessel. The second model adopted was the Eulerian-Eulerian dispersed flow model, which is computationally cheaper but limited to low void fraction regimes, such as bubbly flow. Validation and verification have not yet been performed for the Eulerian-Eulerian approach, but a preliminary implementation was completed. 3. Validation with static corrosion experiments: Static corrosion experimental data for stainless steel coupons within molten salts was used to further validate the corrosion model in MOSCATO. To do so, we leveraged the existing models in MOSCATO and simulated the sample mass loss and mass gain phenomena. Several ion species, including Cr 2+ , Fe 2+ and H + , were simulated in salt using the PNP solver, while Cr 0 and Fe 0 were simulated with a diffusion solver in stainless steel. The mass loss of the samples was compared with experimental data, and good agreement was achieved. These combined activities served to further expand the capabilities of MOSCATO and make it more generally applicable to the full range of phenomena that can control chemistry and corrosion in molten salt reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Parallelization and Performance Portability in Hydrodynamics Codes

With the eve of Exascale computing, performance and portability are at the forefront of all scientific codes. Adding more cores and more energy to a system is no longer a sustainable way to achieve performance, and extra effort must now be made to improve performance in all areas of code and code development. Using hydrodynamic codes as a basis, this work explores numerous techniques to achieve performance in different ways. Adaptive mesh refinement (AMR) is a necessary technique to improve memory optimization in mesh-based simulations. However it is invasive and conventionally difficult to integrate into existing applications, so we present a new branch of AMR to create a smooth transition to these optimizations, which not only improves performance, but also greatly reduces developer effort. We introduce the concept of this improvement as Phantom-Cell AMR, and assess theoretically the improvements, as well as present an application of its use. Other work included involves and investigation into an efficient data structure that ensures optimal memory layout for cache performance, with a target of making codes performant and portable across all architectures. All of the work targets both performance and portability, not just on CPU hardware, but specifically across GPU architectures. Parallel performance is key to all of the methods presented, but the research makes a great effort to improve the portability of all applications to prepare for current high performance computing systems and those on the horizon.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Automated segmentation of soft X-ray tomography: Native cellular structure with submicron resolution at high-throughput for whole-cell quantitative imaging in yeast

Soft X-ray tomography (SXT) is an invaluable tool for quantitatively analyzing cellular structures at suboptical isotropic resolution. However, it has traditionally depended on manual segmentation, limiting its scalability for large datasets. Here, we leverage a deep learning-based autosegmentation pipeline to segment and label cellular structures in hundreds of cells across three Saccharomyces cerevisiae strains. This task-based pipeline uses manual iterative refinement to improve segmentation accuracy for key structures, including the cell body, nucleus, vacuole, and lipid droplets, enabling high-throughput and precise phenotypic analysis. Using this approach, we quantitatively compared the three-dimensional (3D) whole-cell morphometric characteristics of wild-type, VPH1-GFP, and vac14 strains, uncovering detailed strain-specific cell and organelle size and shape variations. We show the utility of SXT data for precise 3D curvature analysis of entire organelles and cells and detection of fine morphological features using surface meshes. Our approach facilitates comparative analyses with high spatial precision and statistical throughput, uncovering subtle morphological features at the single-cell and population level. This workflow significantly enhances our ability to characterize cell anatomy and supports scalable studies on the mesoscale, with applications in investigating cellular architecture, organelle biology, and genetic research across diverse biological contexts.

Chen, Jianhua [Lawrence Berkeley National Laborato↗
DOE OSTI2026

Reduced-Order CFD Modeling to Support Waste Loading Optimization in Hanford WTP Vitrification

The U.S. DOE Hanford Site stores over 56 million gallons of radioactive liquid tank waste that must be treated and immobilized for long-term disposal The Waste Treatment and Immobilization Plant (WTP) will vitrify this waste by feeding it into Joule-heated melters, where it is incorporated into a stable borosilicate glass Computational fluid dynamics (CFD) simulations of glass melters can provide insight into the maximum achievable waste loading under varying melter operating conditions Fully resolved VOF multiphase simulations were used as the reference model to capture bubble-driven convection in the melter, including bubble formation, rise behavior, and induced glass melt circulation Effective bubble column diameter and rise velocity were extracted from the resolved simulations, compared with empirical correlations, and refit across relevant viscosity and gas flow rate conditions Explicit gas–liquid interface tracking was replaced with a single-phase momentum source term model, enabling faster steady-state CFD simulations while preserving the dominant hydrodynamic effects of bubbling New empirical correlations were developed for effective bubble column diameter and bubble rise velocity by fitting resolved simulation data across expected melter viscosity and gas flow rate ranges, providing improved inputs for the momentum source term model compared with existing literature correlations The momentum source term model reduced fluid-domain mesh size by 89% and achieved an 8.4× computational speedup relative to resolved bubbling simulations The validated momentum source term approach enables prediction of process-relevant heat transfer behavior in the integrated melter model, including heat transfer from the molten glass to the cold cap, plenum, refractory walls, and surrounding structural regions under varying melter operating conditions

12 - MGMT OF RADIOACTIVE AND NON-RADIOACTIVE WASTE↗
DOE OSTI2022

Volumetric Rendering on Wavelet-Based Adaptive Grid

Numerical modeling of physical phenomena frequently involves processes across a wide range of spatial and temporal scales. In the last two decades, the advancements in wavelet-based numerical methodologies to solve partial differential equations, combined with the unique properties of wavelet analysis to resolve localized structures of the solution on dynamically adaptive computational meshes, make it feasible to perform large-scale numerical simulations of a variety of physical systems on a dynamically adaptive computational mesh that changes both in space and time. Volumetric visualization of the solution is an essential part of scientific computing, yet the existing volumetric visualization techniques do not take full advantage of multi-resolution wavelet analysis and are not fully tailored for visualization of a compressed solution on the wavelet-based adaptive computational mesh. Our objective is to explore the alternatives for the visualization of time-dependent data on space-time varying adaptive mesh using volume rendering while capitalizing on the available sparse data representation. Two alternative formulations are explored. The first one is based on volumetric ray casting of multi-scale datasets in wavelet space. Rather than working with the wavelets at the finest possible resolution, a partial inverse wavelet transform is performed as a preprocessing step to obtain scaling functions on a uniform grid at a user-prescribed resolution. As a result, a solution in physical space is represented by a superposition of scaling functions on a coarse regular grid and wavelets on an adaptive mesh. An efficient and accurate ray casting algorithm is based just on these coarse scaling functions. Additional details are added during the ray tracing by taking an appropriate number of wavelets into account based on support overlap with the interpolation point, wavelet coefficient magnitude, and other characteristics, such as opacity accumulation (front to back ordering) and deviation from frontal viewing direction. The second approach is based on complementing of wavelet-based adaptive mesh to the traditional Adaptive Mesh Refinement (AMR) mesh. Both algorithms are illustrated and compared to the existing volume visualization software for Rayleigh-Benard thermal convection and electron density data sets in terms of rendering time and visual quality for different data compression of both wavelet-based and AMR adaptive meshes.

Vezolainen, Alexei V.↗
DOE OSTI2021

Complex Fault Geometry of the 2020 M ww 6.5 Monte Cristo Range, Nevada, Earthquake Sequence

On 15 May 2020 an M ww 6.5 earthquake occurred beneath the Monte Cristo Range in the Mina Deflection region of western Nevada. Rapid deployment of eight temporary seismic stations enabled detailed analysis of its productive and slowly decaying aftershock sequence (p=0.8), which included ~18,000 autodetected events in 3.5 months. Double-difference, waveform-based relative relocation of 16,714 earthquakes reveals a complex network of faults, many of which cross the inferred 35-km-long east–northeast-striking, left-lateral mainshock rupture. Seismicity aligns with left-lateral, right-lateral, and normal mechanism moment tensors of 128 of the largest earthquakes. The mainshock occurred near the middle of the aftershock zone at the intersection of two distinct zones of seismicity. In the western section, numerous subparallel, shallow, north-northeast-striking faults form a broad flower-structure-like fault mesh that coalesces at depth into a near-vertical, left-lateral fault. We infer the near-vertical fault to be a region of significant slip in the mainshock and an eastward extension of the left-lateral Candelaria fault. Near the mainshock hypocenter, seismicity occurs on a northeast-striking, west-dipping structure that extends north from the eastern Columbus Salt Marsh normal fault. Together, these two intersecting structures bound the Columbus Salt Marsh tectonic basin. East of this intersection and the mainshock hypocenter, seismicity occurs in a narrow, near-vertical, east-northeast-striking fault zone through to its eastern terminus. At the eastern end, the aftershock zone broadens and extends northwest toward the southern extension of the northwest-striking, right-lateral Petrified Springs fault system. The eastern section hosts significantly fewer aftershocks than the western section, but has more moment release. We infer that shallow aftershocks throughout the system highlight fault-fracture meshes that connect mapped fault systems at depth. Here, comparing earthquake data with surface ruptures and a simple geodetic fault model sheds light on the complexity of this recent M 6.5 Walker Lane earthquake.

58 GEOSCIENCES↗
DOE OSTI2023

Learning Distribution Grid Topologies: A Tutorial

Unveiling feeder topologies from data is of paramount importance to advance situational awareness and proper utilization of smart resources in power distribution grids. This tutorial summarizes, contrasts, and establishes useful links between recent works on topology identification and detection schemes that have been proposed for power distribution grids. The primary focus is to highlight methods that overcome the limited availability of measurement devices in distribution grids, while enhancing topology estimates using conservation laws of power-flow physics and structural properties of feeders. Grid data from phasor measurement units or smart meters can be collected either passively in the traditional way, or actively, upon actuating grid resources and measuring the feeder's voltage response. Analytical claims on feeder identifiability and detectability are reviewed under disparate meter placement scenarios. Such topology learning claims can be attained exactly or approximately so via algorithmic solutions with various levels of computational complexity, ranging from least-squares fits to convex optimization problems, and from polynomial-time searches over graphs to mixed-integer programs. Although the emphasis is on radial single-phase feeders, extensions to meshed and/or multiphase circuits are sometimes possible and discussed. Here this tutorial aspires to provide researchers and engineers with knowledge of the current state-of-the-art in tractable distribution grid learning and insights into future directions of work.

24 POWER TRANSMISSION AND DISTRIBUTION↗