SEARCH · Engineering Papers

Results for “Mesh Adaptivity”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 793 records · Page 44

All sources NASA NTRS DOE OSTI

DOE OSTI2014

s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid

Geometric multigrid solvers within adaptive mesh refinement (AMR) applications often reach a point where further coarsening of the grid becomes impractical as individual sub domain sizes approach unity. At this point the most common solution is to use a bottom solver, such as BiCGStab, to reduce the residual by a fixed factor at the coarsest level. Each iteration of BiCGStab requires multiple global reductions (MPI collectives). As the number of BiCGStab iterations required for convergence grows with problem size, and the time for each collective operation increases with machine scale, bottom solves in large-scale applications can constitute a significant fraction of the overall multigrid solve time. In this paper, we implement, evaluate, and optimize a communication-avoiding s-step formulation of BiCGStab (CABiCGStab for short) as a high-performance, distributed-memory bottom solver for geometric multigrid solvers. This is the first time s-step Krylov subspace methods have been leveraged to improve multigrid bottom solver performance. We use a synthetic benchmark for detailed analysis and integrate the best implementation into BoxLib in order to evaluate the benefit of a s-step Krylov subspace method on the multigrid solves found in the applications LMC and Nyx on up to 32,768 cores on the Cray XE6 at NERSC. Overall, we see bottom solver improvements of up to 4.2x on synthetic problems and up to 2.7x in real applications. This results in as much as a 1.5x improvement in solver performance in real applications.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Modeling pre-Exascale AMR Parallel I/O Workloads via Proxy Applications

The present work investigates the modeling of preexascale input/output (I/O) workloads of Adaptive Mesh Refinement (AMR) simulations through a simple proxy application. We collect data from the AMReX Castro framework running on the Summit supercomputer for a wide range of scales and mesh partitions for the hydrodynamic Sedov case as a baseline to provide sufficient coverage to the formulated proxy model. The non-linear analysis data production rates are quantified as a function of a set of input parameters such as output frequency, grid size, number of levels, and the Courant-Friedrichs-Lewy (CFL) condition number for each rank, mesh level and simulation time step. Linear regression is then applied to formulate a simple analytical model which allows to translate AMReX inputs into MACSio proxy I/O application parameters, resulting in a simple “kernel” approximation for data production at each time step. Results show that MACSio can simulate actual AMReX nonlinear “static” I/O workloads to a certain degree of confidence on the Summit supercomputer using the present methodology. The goal is to provide an initial level of understanding of AMR I/O workloads via lightweight proxy applications models to facilitate autotune data management strategies in anticipation of exascale systems.

Godoy, William↗

DOE OSTI2024

A High-Quality Workflow for Multi-Resolution Scientific Data Reduction and Visualization

Multi-resolution methods such as Adaptive Mesh Refinement (AMR) can enhance storage efficiency for HPC applications generating vast volumes of data. However, their applicability is limited and cannot be universally deployed across all applications. Furthermore, integrating lossy compression with multi-resolution techniques to further boost storage efficiency encounters significant barriers. To this end, we introduce an innovative workflow that facilitates high-quality multi-resolution data compression for both uniform and AMR simulations. Initially, to extend the usability of multi-resolution techniques, our workflow employs a compression-oriented Region of Interest (ROI) extraction method, transforming uniform data into a multi-resolution format. Subsequently, to bridge the gap between multi-resolution techniques and lossy compressors, we optimize three distinct compressors, ensuring their optimal performance on multi-resolution data. These optimizations can improve the compression ratio of SOTA approaches by up to 3.3× under the same data quality loss. Lastly, we incorporate an advanced uncertainty visualization method into our workflow to understand the potential impacts of lossy compression. Experimental evaluation demonstrates that our workflow achieves significant compression quality improvements.

Wang, Daoce↗

DOE OSTI2012

The uintah framework: a unified heterogeneous task scheduling and runtime system

The development of a new unified, multi-threaded runtime system for the execution of asynchronous tasks on heterogeneous systems is described in this work. These asynchronous tasks arise from the Uintah framework, which was developed to provide an environment for solving a broad class of fluid-structure interaction problems on structured adaptive grids. Uintah has a clear separation between its MPI-free user-coded tasks and its runtime system that ensures these tasks execute efficiently. This separation also allows for complete isolation of the application developer from the complexities involved with the parallelism Uintah provides. While we have designed scalable runtime systems for large CPU core counts, the emergence of heterogeneous systems, with additional on-node accelerators and co-processors presents additional design challenges in terms of effectively utilizing all computational resources on-node and managing multiple levels of parallelism. Our work addresses these challenges for Uintah by the development of new hybrid runtime system and Unified multi-threaded MPI task scheduler, enabling Uintah to fully exploit current and emerging architectures with support for asynchronous, out-of-order scheduling of both CPU and GPU computational tasks. This design coupled with an approach that uses MPI to communicate between nodes, a shared memory model on-node and the use of novel lock-free data structures, has made it possible for Uintah to achieve excellent scalability for challenging fluid-structure problems using adaptive mesh refinement on as many as 256K cores on the DoE Jaguar XK6 system. This design has also demonstrated an ability to run capability jobs on the heterogeneous systems, Keeneland and TitanDev. In this work, the evolution of Uintah and its runtime system is examined in the context of our new Unified multi-threaded scheduler design. The performance of the Unified scheduler is also tested against previous Uintah scheduler and runtime designs over a range of processor core and GPU counts.

Source record↗

DOE OSTI2017

Optimal Placement of Dynamic Var Sources by Using Empirical Controllability Covariance

In this paper, the empirical controllability covariance (ECC), which is calculated around the considered operating condition of a power system, is applied to quantify the degree of controllability of system voltages under specific dynamic var source locations. An optimal dynamic var source placement method addressing fault-induced delayed voltage recovery (FIDVR) issues is further formulated as an optimization problem that maximizes the determinant of ECC. The optimization problem is effectively solved by the NOMAD solver, which implements the mesh adaptive direct search algorithm. The proposed method is tested on an NPCC 140-bus system and the results show that the proposed method with fault specified ECC can solve the FIDVR issue caused by the most severe contingency with fewer dynamic var sources than the voltage sensitivity index (VSI)-based method. The proposed method with fault unspecified ECC does not depend on the settings of the contingency and can address more FIDVR issues than the VSI method when placing the same number of SVCs under different fault durations. It is also shown that the proposed method can help mitigate voltage collapse.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2011

An examination of magnetized outflows from active galactic nuclei in galaxy clusters: Magnetized outflows in galaxy clusters

We present 3D adaptive mesh refinement magnetohydrodynamic (MHD) simulations of an isolated galaxy cluster that include injection of kinetic, thermal and magnetic energy via a central active galactic nucleus (AGN) in order to study and evaluate the role that AGN may play in producing the observed cluster-wide magnetic fields. Using the MHD solver in flash 3.3, we compare several subresolution approaches to the evolution of AGN, specifically focusing on large-scale jet and bubble models. We examine the effects of magnetized outflows on the accretion history of the black hole and cluster thermodynamic properties, discuss the ability of various models to magnetize the cluster medium, and assess the sensitivity of these models to their underlying subgrid parameters. We find that magnetized jet-based models suffer a severe reduction in accretion rate compared to hydrodynamic jets; however, bubble models remain largely unaffected. While both jets and sporadically placed bubbles have difficulty reproducing the observed strength and topology of cluster magnetic fields, models based on centrally located bubbles come closest to observations. Finally, whereas jet models are relatively insensitive to changes in their subgrid parameters, the accretion rate and average magnetic field produced by the bubbles vary by as much as an order of magnitude depending on the grid resolution and accretion strength.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Large-Eddy Simulation Study of Flow and Combustion Dynamics in a Full-Scale Hydrogen–Air Rotating Detonation Combustor-Stator Integrated System

In the present work, a first-of-its-kind three-dimensional (3D) large-eddy simulation (LES) study is conducted to numerically investigate the combustion dynamics as well as aero-thermal phenomena in a full-scale nonpremixed hydrogen–air rotating detonation engine (RDE) (with a diverging-shaped lower-end wall), when integrated with nozzle guide vanes (NGV) acting as the turbine stator. The wall-modeled LES framework incorporates hydrogen–air detailed chemical kinetics and adaptive mesh refinement (AMR). A comparative analysis is carried out for two operating conditions with different fuel/air mass flow rates but global equivalence ratio of unity, and considering RDE configurations without and with stator. The LES model is validated against available experimental data for the low mass flux condition with respect to detonation wave speed/height, wave dynamics, and axial static pressure distribution. Numerical results indicate significant deflagrative combustion occurring in the fill region near the inner wall due to formation of recirculation zones in the injection near-field driven by the backward facing step. The leading detonation wave is found to be trailed by an azimuthal reflected-shock combustion (ARSC) wave, consistent with experimental observations, which consumes unburned vitiated reactants that leak through the main detonation wave. The main detonation wave characteristics, such as detonation wave speed/height and combustion efficiency, do not change appreciably with the presence of NGV. A novel combustion diagnostic technique based on chemical explosive mode analysis (CEMA) is employed to quantify the fraction of heat release occurring in the detonative mode versus deflagrative mode for the simulated conditions. The exit flow is found to be nearly fully subsonic and supersonic for the low and high mass flux conditions, respectively. Further analysis of the exit flow profiles shows that the presence of NGV renders the flow more axial and significantly impacts the exit Mach number and total pressure, while the total temperature shows negligible change. In addition, the low mass flux operating point, despite exhibiting more deflagrative losses within the combustor, yields overall lower pressure drop from plenum to exhaust, which is mainly attributed to lower pressure drop across the injectors. Lastly, the rotating detonation engine-nozzle guide vanes (RDE-NGV) configuration exhibits higher total pressure loss compared to rotating detonation engine (RDE) without stator across both the mass flux conditions. In conclusion, this study extends the state-of-the-art in numerical modeling of pressure gain combustion (PGC) systems by demonstrating high-fidelity 3D reacting LES of full-scale RDE-NGV systems relevant to RDE-turbine integration for stationary power generation.

Combustion↗

DOE OSTI2018

Detailed Chemical Kinetics Based Simulation of Detonation-Containing Flows

Reliable and robust simulations of detonations in inhomogeneous and turbulent environments are of direct importance in the design of rotating detonation engines (RDEs). In particular, computational models will be especially useful in designing and optimizing discrete injectors that introduce fuel and air separately into the detonation chamber, but ensure appropriate level of mixing to sustain detonations but minimize backflow of detonation products and pressure waves into the feed plenums. Since the structure of detonations itself is non-ideal, models have to include a detailed description of this reacting flow in order to be predictive in nature. Here, a highly-scalable open source based solver has been developed for complex detonating flows such that a) the detonation processes are described using detailed chemical kinetics, b) the method is computationally efficient through the introduction of adaptive mesh refinement, and c) the solver can handle complex geometries of relevance to RDE design. Grid convergence of key metrics for detonations is evaluated using canonical flows. Further, the importance of the use of detailed chemical kinetics is illustrated by extracting the composition structure behind a two-dimensional detonation front. Finally, simulations of a practical RDE configuration are used to demonstrate the applicability of this solver to analyzing geometries. The simulation captures the general trends of the experiment well. It is found that the detonation occurs under partially-premixed conditions. Propagation of pressure waves to the injection system is observed which could influence flow behavior in the oxidizer plenum.

03 NATURAL GAS↗

DOE OSTI2015

LES FOR SIMULATING THE GAS EXCHANGE PROCESS IN A SPARK IGNITION ENGINE

The gas exchange process is known to be a significant source of cyclic variability in Internal Combustion Engines (ICE). Traditionally, Large Eddy Simulations (LES) are expected to capture these cycle-to-cycle variations. This paper reports a numerical effort to establish best practices for capturing cyclic variability with LES tools in a Transparent Combustion Chamber (TCC) spark ignition engine. The main intention is to examine the sensitivity of cycle averaged mean and Root Mean Square (RMS) flow fields and Proper Orthogonal Decomposition (POD) modes to different computational hardware, adaptive mesh refinement (AMR) and LES sub-grid scale (SGS) models, since these aspects have received little attention in the past couple of decades. This study also examines the effect of near-wall resolution on the predicted wall shear stresses. LES is pursued with commercially available CONVERGE code. Two different SGS models are tested, a one-equation eddy viscosity model and dynamic structure model. The results seem to indicate that both mean and RMS fields without any SGS model are not much different than those with LES models, either one-equation eddy viscosity or dynamic structure model. Computational hardware results in subtle quantitative differences, especially in RMS distributions. The influence of AMR on both mean and RMS fields is negligible. The predicted shear stresses near the liner walls is also found to be relatively insensitive to near-wall resolution except in the valve curtain region.

Ameen, Muhsin M↗

DOE OSTI2016

SU-F-J-211: Scatter Correction for Clinical Cone-Beam CT System Using An Optimized Stationary Beam Blocker with a Single Scan

Purpose: X-ray scatter photons result in significant image quality degradation of cone-beam CT (CBCT). Measurement based algorithms using beam blocker directly acquire the scatter samples and achieve significant improvement on the quality of CBCT image. Within existing algorithms, single-scan and stationary beam blocker proposed previously is promising due to its simplicity and practicability. Although demonstrated effectively on tabletop system, the blocker fails to estimate the scatter distribution on clinical CBCT system mainly due to the gantry wobble. In addition, the uniform distributed blocker strips in our previous design results in primary data loss in the CBCT system and leads to the image artifacts due to data insufficiency. Methods: We investigate the motion behavior of the beam blocker in each projection and design an optimized non-uniform blocker strip distribution which accounts for the data insufficiency issue. An accurate scatter estimation is then achieved from the wobble modeling. Blocker wobble curve is estimated using threshold-based segmentation algorithms in each projection. In the blocker design optimization, the quality of final image is quantified using the number of the primary data loss voxels and the mesh adaptive direct search algorithm is applied to minimize the objective function. Scatter-corrected CT images are obtained using the optimized blocker. Results: The proposed method is evaluated using Catphan@504 phantom and a head patient. On the Catphan©504, our approach reduces the average CT number error from 115 Hounsfield unit (HU) to 11 HU in the selected regions of interest, and improves the image contrast by a factor of 1.45 in the high-contrast regions. On the head patient, the CT number error is reduced from 97 HU to 6 HU in the soft tissue region and image spatial non-uniformity is decreased from 27% to 5% after correction. Conclusion: The proposed optimized blocker design is practical and attractive for CBCT guided radiation therapy. This work is supported by grants from Guangdong Innovative Research Team Program of China (Grant No. 2011S013), National 863 Programs of China (Grant Nos. 2012AA02A604 and 2015AA043203), the National High-tech R&D Program for Young Scientists by the Ministry of Science and Technology of China (Grant No. 2015AA020917)

60 APPLIED LIFE SCIENCES↗

DOE OSTI2019

Simulation of Magnetic Systems in the Domain with a Corner

Numerical simulation of magnetic systems having corner points is considered. The literature on this topic is reviewed. A method of encapsulating the function behavior near corner points in the difference scheme is proposed for numerical solution of the 2D magnetostatic problem in the iron domain. For the 3D magnetostatic problem in the iron/vacuum domain, the increase in the magnetic field near the corner point is estimated, and a method for construction of an adaptive mesh is proposed. A parallel algorithm is implemented on the graphics-processing unit (GPU) architecture for faster search for the numerical solution of the magnetostatic problem. Numerical simulation is performed for the magnetic system of the SPD detector to be used at the NICA complex (JINR, Dubna).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2021

AIR Algebraic Multigrid for a Space-Time Hybridizable Discontinuous Galerkin Discretization of Advection(-Diffusion)

This article investigates the efficiency, robustness, and scalability of approximate ideal restriction (AIR) algebraic multigrid as a preconditioner in the all-at-once solution of a space-time hybridizable discontinuous Galerkin discretization of advection-dominated flows. The motivation for this study is that the time-dependent advection-diffusion equation can be seen as a “steady” advection-diffusion problem in $(d+1)$-dimensions and AIR has been shown to be a robust solver for steady advection-dominated problems. Numerical examples demonstrate the effectiveness of AIR as a preconditioner for advection-diffusion problems on fixed and time-dependent domains, using both slab-by-slab and all-at-once space-time discretizations, and in the context of uniform and space-time adaptive mesh refinement. A closer look at the geometric coarsening structure that arises in AIR also explains why AIR can provide robust, scalable, space-time convergence on advective and hyperbolic problems, while most multilevel parallel-in-time schemes struggle with such problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Coordination of Behind-the-Meter Energy Storage and Building Loads: Optimization with Deep Learning Models*

With the increasing penetration of renewable energy systems and energy storage systems in buildings, it is critical to optimize system operation. In this paper, we develop an optimization strategy to minimize the operation cost as well as maintain indoor thermal comfort, for a building integrated with battery and PV. A Recurrent Neural Network (RNN) is used to predict building thermal load and zone temperatures. A black-box optimization algorithm known as nonlinear optimization by mesh adaptive direct search (NOMADS) is employed in simulation to provide look-ahead optimal battery dispatch and zone temperature set-point schedules so that the operation cost is minimized. Field data collected from a medium sized office building at Pacific Northwest National Laboratory (PNNL) integrated with Photovoltaic (PV) system model and battery storage system model is used to demonstrate the proposed methodology. Compared with rule based methods, the optimization strategy obtained a lower cost of operation while satisfying comfort constraints.

Chen, Yimin↗

DOE OSTI2025

Scaling Uintah on the Aurora Exascale System up to 122,880 Intel Ponte Vecchio Xe Stacks

The challenge of being able to scale application codes based on the Asynchronous Many-Task (AMT) Uintah framework on the Department of Energy (DOE) Aurora exascale system is addressed in this work by considering a challenging Reverse Monte Carlo Ray Tracing radiation benchmark calculation. This benchmark involves potentially global all-to-all communication and uses adaptive mesh refinement and ray tracing to achieve scalability. This benchmark has been used as part of previous scalability studies on a number of pre-exascale systems and on the DOE Frontier exascale system. This paper describes steps taken to enable this benchmark to run successfully on up to 10,240 nodes and 122,880 Intel® Ponte Vecchio Xe stacks on the DOE Aurora exascale system. This scalability was achieved through a limited number of experiments on Aurora, given machine loads and its uniqueness. These experiments constitute valuable lessons learned to achieve scalability at this level. The resulting scalability runs, while few in number, demonstrate relatively good strong-scaling characteristics. A detailed analysis of these results provides important indications about the path to scalability on Aurora for future work. Overall, these results continue the remarkable ability of this AMT approach to produce scalable solutions for challenging problems at extreme scale on heterogeneous architectures.

Garcia, Marta [Argonne National Laboratory (ANL)]↗

DOE OSTI2014

miniAMR

miniAMR is a "miniapp" which will be added to the Mantevo project. It provides a platform to experiment with different aspects of Adaptive Mesh Refinement (AMR). The calculations are performed on random data and the refinement is driven by simple objects moving through the mesh, so no real problem is solved. By having a small code that runs quickly, we can use to study different aspects of AMR and easily port the code to new testbed machines

Barrett, Richard↗

DOE OSTI2017

PeleC [SWR-17-35]

PeleC is an adaptive-mesh compressible hydrodynamics code for reacting flows. It solves the compressible Navier-Stokes with multispecies transport in a block structured framework. The resulting algorithm is well suited for flows with localized resolution requirements and robust to discontinuities. User controllable refinement crieteria has the potential to result in extremely small numerical dissipation and dispersion, making this code appropriate for both research and applied usage. The code is built on the AMReX library which facilitates hierarchical parallelism and manages distributed memory parallism. PeleC algorithms are implemented to express shared memory parallelism.

Source record↗

DOE OSTI2014

Snow Micro-Structure Model

PIKA is a MOOSE-based application for modeling micro-structure evolution of seasonal snow. The model will be useful for environmental, atmospheric, and climate scientists. Possible applications include application to energy balance models, ice sheet modeling, and avalanche forecasting. The model implements physics from published, peer-reviewed articles. The main purpose is to foster university and laboratory collaboration to build a larger multi-scale snow model using MOOSE. The main feature of the code is that it is implemented using the MOOSE framework, thus making features such as multiphysics coupling, adaptive mesh refinement, and parallel scalability native to the application. PIKA implements three equations: the phase-field equation for tracking the evolution of the ice-air interface within seasonal snow at the grain-scale; the heat equation for computing the temperature of both the ice and air within the snow; and the mass transport equation for monitoring the diffusion of water vapor in the pore space of the snow.

Micah Johnson, AndrewSlaughter↗

DOE OSTI2018

Mota Mapper: A Multi-Objective Topology-Aware Mapper Library

Mota is a library that provides several heuristics for mapping tasks to compute ranks (processes) on a networked computer cluster or supercomputer. It was originally designed for task placement of adaptive mesh refinement codes (AMR). It is multi-objective in the sense that it simultaneously balances (potentially multiple types of) computational load on each rank as well as the communication traffic between the boxes. The heuristics used for mapping include algorithms such as greedy list assignment and space-filling curves, as well as algorithms from graph analysis such as adjacency matrix bandwidth reduction, recursive bisection, and greedy graph placement.

Chan, Cy↗