Search NASA⌕ Search

SEARCH · Search NASA

Results for “mesh data structures”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
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 OSTI2019

AMReX: a framework for block-structured adaptive mesh refinement

AMReX is a C++ software framework that supports the development of block-structured adaptive mesh refinement (AMR) algorithms for solving systems of partial differential equations (PDEs) with complex boundary conditions on current and emerging architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving the local descriptions of different physical processes in complex multiphysics algorithms. Current AMReX-based application codes span a number of areas, including atmospheric modeling, astrophysics, combustion, cosmology, fluctuating hydrodynamics, multiphase flows, and particle accelerators. In particular, the AMReX-Astro GitHub repository holds a number of astrophysical modeling tools based on AMReX. The origins of AMReX trace back to the BoxLib software framework. AMReX supports a number of different time-stepping strategies and spatial discretizations. Solution strategies supported by AMReX range from level-by-level approaches (with or without subcycling in time) with multilevel synchronization to full-hierarchy approaches, and any combination thereof. User-defined kernels that operate on patches of data can be written in C++ or Fortran; there is also a Fortran-interface functionality which wraps the core C++ data structures and operations in Fortran wrappers so that an application code based on AMReX can be written entirely in Fortran.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

COMBUSTION AND EMISSION CHARACTERISTICS OF A LEAN AXIAL-STAGE COMBUSTOR

Gas turbine engines with high operational flexibility represent an important area of research. In support of this, the reduction of NOx emissions at high-temperature, full-load conditions are the main target of this research study. To overcome the challenge of decreasing the residence time of hot exhaust gas in the burner, the approach of axial-staged combustion has been used, which aims to burn at lean conditions. A main combustion stage with a conventional burner is followed by a jet-in-crossflow (JIC) stage downstream. This second combustion stage, the test section, burns well over a third of the total fuel amount, which is added by a jet inlet. A steady Computational Fluid Dynamics (CFD) model in Star-CCM+ was created to analyze the JIC stage. A structured mesh grid with 1.7 million cells and local refinement domains was used along with RANS equations, Realizable k-ε turbulence, Complex Chemistry model with Laminar Flame Concept (LFC) applied. The findings of the computational model include a detailed description of the flow field, focusing on vortex formation and penetration depth. Three vortex types and local pressure losses of up to 6% in the mixing domain were identified. Results were compared with similar data from literature and a very good match was yielded. Optical laser diagnostics should work well to capture the predicted flow penetration. The highest local reaction rates were observed inside a thin flame front, 4 to 6 diameters downstream of the jet. The jet showed a limited expansion into the available channel domain, resulting in low heat release and a methane conversion of only 52%. Providing an enhanced amount of oxygen was proven to increase the CH4 conversion significantly. Emissions were analyzed for an estimated species composition from the main burner. A CO production of 9.85‰ and the reduction of an incoming NOx amount by 15% were determined, outlining the potential of axial-staged combustion. Further numerical investigation along with experimental verification is in progress.

03 NATURAL GAS↗
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 OSTI2014

HDRMC, an accelerated Monte Carlo dose calculator for high dose rate brachytherapy with CT-compatible applicators

Purpose: To present a new accelerated Monte Carlo code for CT-based dose calculations in high dose rate (HDR) brachytherapy. The new code (HDRMC) accounts for both tissue and nontissue heterogeneities (applicator and contrast medium). Methods: HDRMC uses a fast ray-tracing technique and detailed physics algorithms to transport photons through a 3D mesh of voxels representing the patient anatomy with applicator and contrast medium included. A precalculated phase space file for the{sup 192}Ir source is used as source term. HDRM is calibrated to calculated absolute dose for real plans. A postprocessing technique is used to include the exact density and composition of nontissue heterogeneities in the 3D phantom. Dwell positions and angular orientations of the source are reconstructed using data from the treatment planning system (TPS). Structure contours are also imported from the TPS to recalculate dose-volume histograms. Results: HDRMC was first benchmarked against the MCNP5 code for a single source in homogenous water and for a loaded gynecologic applicator in water. The accuracy of the voxel-based applicator model used in HDRMC was also verified by comparing 3D dose distributions and dose-volume parameters obtained using 1-mm{sup 3} versus 2-mm{sup 3} phantom resolutions. HDRMC can calculate the 3D dose distribution for a typical HDR cervix case with 2-mm resolution in 5 min on a single CPU. Examples of heterogeneity effects for two clinical cases (cervix and esophagus) were demonstrated using HDRMC. The neglect of tissue heterogeneity for the esophageal case leads to the overestimate of CTV D90, CTV D100, and spinal cord maximum dose by 3.2%, 3.9%, and 3.6%, respectively. Conclusions: A fast Monte Carlo code for CT-based dose calculations which does not require a prebuilt applicator model is developed for those HDR brachytherapy treatments that use CT-compatible applicators. Tissue and nontissue heterogeneities should be taken into account in modern HDR brachytherapy planning.

61 RADIATION PROTECTION AND DOSIMETRY↗
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 OSTI2015

Molecular-dynamics study of amorphous SiO{sub 2} relaxation

Using Molecular-Dynamics simulation we observed the generation of amorphous SiO{sub 2} target from a randomly distributed Si and O atoms. We applied a sequence of annealing of the target with various temperature and quenching to room temperature. The relaxation time required by the system to form SiO{sub 4} tetrahedral mesh after a relatively long simulation time, is studied. The final amorphous target was analyzed using the radial distribution function method, which can be compared with the available theoretical and experimental data. We found that up to 70% of the target atoms form the tetrahedral SiO{sub 4} molecules. The number of formed tetrahedral increases following the growth function and the rate of SiO{sub 4} formation follows Arrhenius law, depends on the annealing temperature. The local structure of amorphous SiO{sub 2} after this treatment agrees well with those reported in some literatures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2018

A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices

We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D sparse LU algorithm uses a three-dimensional MPI process grid, aggressively exploits elimination tree parallelism and trades off increased memory for reduced per-process communication. We also analyze the asymptotic improvements for planar graphs (e.g., from 2D grid or mesh domains) and certain non-planar graphs (specifically for 3D grids and meshes). For planar graphs with n vertices, our algorithm reduces communication volume asymptotically in n by a factor of O{log n} and latency by a factor of O{log n}. For non-planar cases, our algorithm can reduce the per-process communication volume by 3× and latency by O{n^1/3} times. In all cases, the memory needed to achieve these gains is a constant factor. We implemented our algorithm by extending the 2D data structure used in superLU. Our new 3D code achieves speedups up to 27× for planar graphs and up to 3.3× for non-planar graphs over the baseline 2D superLU when run on 24,000 cores of a Cray XC30.

Sao, Piyush↗
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 OSTI2017

Self-Excited, Multi-kHz Dynamics in a Linear, Semi-Bounded Detonation Channel

A linear, semi-bounded detonation channel was studied to characterize the injection, mixing, and ignition process in a two dimensional analog of a rotating detonation wave combustor (RDWC). The linear channel was developed to provide large optical accessibility in support of high-fidelity diagnostics. The canonical geometry was also chosen to support the generation of future numerical validation. A high degree of modularity was designed into the combustor to allow for testing multiple injector con figurations, and for reconfiguring the high-frequency instrumentation and optical window locations. Initial experiments have shown the presence of self-excited, multi-kHz combustion waves that bear the distinct characteristics of detonation waves. High-frequency pressure data details the dynamic response to detonation propagation in the combustor. The role of manifold-chamber coupling is investigated as the mechanism behind the formation of self-excited detonation waves in the combustor. We explore the formation of the waves using Schlieren imaging techniques and examine the structures present within the reaction zone and the interface between reactants and products. Companion computations were carried out using an in-house CFD solver GEMS(General Equations and Mesh Solver) to develop understanding of the structure and dynamics of the flow, flame, and their coupled interactions.

Schwinn, Kyle S.↗
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 OSTI2018

Towards district scale flood simulations using conventional and anisotropic porosity shallow water models with high-resolution topographic information

Current topographic survey technology provides high-resolution (HR) datasets for urban environments. Incorporating this HR information in models aiming to provide flood risk assessment is desirable because the flood wave propagation is depending on the urban topographic features, i.e. buildings, bridges and street networks. Conceptual, numerical and practical challenges arise from the application of shallow water models to HR urban flood modeling. For example, numerical challenges are occurrence of wet-dry fronts, geometric discontinuities in the urban environment and discontinuous solutions, i.e. shock waves. These challenges can be overcome by using a Godunov-type scheme. However, the computational cost of this type of schemes is high, such that HR two-dimensional shallow water simulations with practical relevance have to be run on supercomputers. The porous shallow water model is an alternative approach that aims to reduce computational cost by using a coarse resolution and accounting for unresolved processes by means of the porosity terms. Usually, a speedup between two and three orders of magnitude in comparison to HR simulations can be obtained. This study presents preliminary results of a practical test case concerning pluvial flooding in a district of the city of Nice, France, caused by the intense rainfall event on October 3rd, 2015. HR topography data set on a 1 m resolution is available for the district, whereby street features of infra-metric dimensions have been included. A reference solution is calculated by a HR shallow water model on a 1 m by 1 m structured computational grid. The porous shallow water model is run on a 10 m by 10 m grid and the influence of the drag source term is studied. The model calculations show a large deviation, which is caused by the poor meshing strategy of the porous shallow water (AP) model. The study also summarizes practical challenges that arise during the application of the AP and HR models to a large urban catchment. The main difficulty is to obtain a good mesh. In smaller scale investigations, the mesh is currently constructed by hand such that the cell edges align with buildings. This approach is not feasible for large scale urban catchments with a large number of buildings. Future steps that have to be taken, such as a strategy for automatic mesh generation, are reported on.

42 ENGINEERING↗
DOE OSTI2015

Micro-CT analysis and mechanical properties of Ti spherical and polyhedral void composites made with saccharose as a space holder material

The paper describes the formation, morphology and mechanical properties of Ti void composites. The Ti void composites were made using 100 and 325 mesh Ti powder for solid scaffold formation. The spherical and polyhedral voids (pores) were formed using saccharose particles (table sugar) of different shapes. The Ti void composite morphology was investigated by microcomputed tomography and scanning electron microscopy. The Ti void composites of designed porosity of 50–70% were made. Compression test was applied for mechanical properties estimation. It has been found, that Ti void composites made from 100 mesh Ti and those having spherical pores have a higher strength and elastic modulus, i.e. for the designed porosity of 50% for 100 and 325 mesh Ti void composites, a compressive strength was 32.32 and 20.13 MPa, respectively. It has been shown that this is related to better sintering of the 100 mesh Ti powders compared with the 325 mesh Ti powders. A correlation between microcomputed tomography data and mechanical properties has also been shown. The Ti void composites, made with the use of saccharose as a space holder, described in this work should be a promising material for biomedical applications, where interconnected pores and good mechanical properties are required. - Highlights: • Ti scaffolds of the porosity of 50–70% were made. • Saccharose particles as space holder were applied. • The voids in the scaffolds were designed with spherical and polyhedral shape. • The scaffold structure was investigated by SEM and micro-CT. • Micro-CT data and mechanical properties of the Ti scaffold have been correlated.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Parallel Block Structured Adaptive Mesh Refinement on Graphics Processing Units

Block-structured adaptive mesh refinement is a technique that can be used when solving partial differential equations to reduce the number of zones necessary to achieve the required accuracy in areas of interest. These areas (shock fronts, material interfaces, etc.) are recursively covered with finer mesh patches that are grouped into a hierarchy of refinement levels. Despite the potential for large savings in computational requirements and memory usage without a corresponding reduction in accuracy, AMR adds overhead in managing the mesh hierarchy, adding complex communication and data movement requirements to a simulation. In this paper, we describe the design and implementation of a native GPU-based AMR library, including: the classes used to manage data on a mesh patch, the routines used for transferring data between GPUs on different nodes, and the data-parallel operators developed to coarsen and refine mesh data. We validate the performance and accuracy of our implementation using three test problems and two architectures: an eight-node cluster, and over four thousand nodes of Oak Ridge National Laboratory’s Titan supercomputer. Our GPU-based AMR hydrodynamics code performs up to 4.87× faster than the CPU-based implementation, and has been scaled to over four thousand GPUs using a combination of MPI and CUDA.

97 MATHEMATICS AND COMPUTING↗