Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Cartesian grids”

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.

63 records · Page 4

A constrained-transport embedded boundary method for compressible resistive magnetohydrodynamics

Motivated by the increased interest in pulsed-power magneto-inertial fusion devices in recent years, we present a method for implementing an arbitrarily shaped embedded boundary on a Cartesian mesh while solving the equations of compressible resistive magnetohydrodynamics. The method is built around a finite volume formulation of the equations in which a Riemann solver is used to compute fluxes on the faces between grid cells, and a face-centered constrained transport formulation of the induction equation. The small time step problem associated with the cut cells is avoided by always computing fluxes on the faces and edges of the Cartesian mesh. We extend the method to model a moving interface between two materials with different properties using a ghost-fluid approach, and show some preliminary results including shock-wave-driven and magnetically-driven dynamical compressions of magnetohydrostatic equilibria. In conclusion, we present a thorough verification of the method and show that it converges at second order in the absence of discontinuities, and at first order with a discontinuity in material properties.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

$κ$monty: a Monte Carlo Compton scattering code including non-thermal electrons

Low-luminosity active galactic nuclei are strong sources of X-ray emission produced by Compton scattering originating from the accretion flows surrounding their supermassive black holes. The shape and energy of the resulting spectrum depend on the shape of the underlying electron distribution function (DF). In this work, we present an extended version of the GRMONTY code, called ΚMONTY. The GRMONTY code previously only included a thermal Maxwell–Jütner electron DF. We extend the GRMONTY code with non-thermal electron DFs, namely the κ and power-law DFs, implement Cartesian Kerr–Schild coordinates, accelerate the code with MPI, and couple the code to the non-uniform adaptive mesh refinement grid data from the general relativistic magnetohydrodynamics code BHAC. For the Compton scattering process, we derive two sampling kernels for both DFs. Finally, we present a series of code tests to verify the accuracy of our schemes. The implementation of non-thermal DFs opens the possibility of studying the effect of non-thermal emission on previously developed black hole accretion models.

79 ASTRONOMY AND ASTROPHYSICS↗

New modelling capabilities in IDT

This work concerns the enhanced modelling capabilities of the discrete ordinates transport solver IDT. The novelties introduced allow for modelling unstructured geometries composed by a collection of X/Y segments and circles, and the use of reciprocity and conservation relations reduce the memory imprint as well as the computational cost of the method. IDT decomposes geometries in modular Cartesian patterns, which are the so-called Heterogeneous Cartesian Cells (HCCs), containing a chunk of the original unstructured geometries. Each HCC can be then discretized by superimposing a XY grid to refine locally the HCC. Unlike the most popular MOC, IDT performs the spatial sweeping by directional collision probabilities instead of trajectories. The sources and interface angular fluxes are expanded up to linear order. The accuracy of ray-tracing, the memory imprints together with the novel mesh refinement capabilities have been verified. A first set of preliminary results on PWR lattice problems will be presented in this paper.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Three-Dimensional Convective–Stratiform Echo-Type Classification and Convectivity Retrieval from Radar Reflectivity

The Echo Classification from COnvectivity (ECCO) algorithm identifies convective and stratiform types of radar echo in three dimensions. It is based on the calculation of reflectivity texture—a combination of the intensity and the heterogeneity of the radar echoes on each horizontal plane in a 3D Cartesian volume. Reflectivity texture is translated into convectivity, which is designed to be a quantitative measure of the convective nature of each 3D radar grid point. It ranges from 0 (100% stratiform) to 1 (100% convective). By thresholding convectivity, a more traditional qualitative categorization is obtained, which classifies radar echoes as convective, mixed, or stratiform. In contrast to previous algorithms, these echo-type classifications are provided on the full 3D grid of the reflectivity field. The vertically resolved classifications, in combination with temperature data, allow for subclassifications into shallow, mid-, deep, and elevated convective features, and low, mid-, and high stratiform regions—again in three dimensions. The algorithm was validated using datasets collected over the U.S. Great Plains during the PECAN field campaign. An analysis of lightning counts shows ~90% of lightning occurring in regions classified as convective by ECCO. A statistical comparison of ECCO echo types with the well-established GPM radar precipitation-type categories show 84% (88%) of GPM stratiform (convective) echo being classified as stratiform (convective) or mixed by ECCO. ECCO was applied to radar grids for the continental United States, the United Arab Emirates, Australia, and Europe, illustrating its robustness and adaptability to different radar grid characteristics and climatic regions.

Radars/Radar observations↗

An Optimized Parameterization of Sub‐Grid Scale Advection for Convection Permitting Models

Convection‐permitting models (CPMs) explicitly resolve deep convection yet under‐resolve the organized lateral exchanges among drafts and their environment that control entrainment/detrainment, precipitation efficiency, and mesoscale structure. In this work, we introduce the Optimized Advection Scheme (OAS), which introduces a small rotation of the Cartesian frame of reference for the horizontal winds relative to other variables used in advection that induces cross‐gradient transport to mimic under‐resolved convective mixing. The rotation angle is selected to minimize the Kullback–Leibler divergence between the simulated and satellite observed precipitation intensity distributions, yielding a physically consistent perturbation that is computationally inexpensive and portable. Optimized Advection Scheme is implemented in WRF and evaluated over Amazon (April 2014). It shifts precipitation–precipitable‐water joint distributions toward lighter rain, reduces overly intense rates, and improves mesoscale convective system (MCS) lifetime and propagation. Mechanistically, the added cross‐gradient transport promotes convective detrainment and environmental mixing, which cools and moistens the mid‐troposphere, weakens downward momentum transport, alleviates excessive downwelling shortwave biases, and warms the surface temperature. The optimized rotation angle yields comparable improvements at 4‐km and 1‐km grid spacing, demonstrating resolution‐independent benefits across the CPM gray zone. By targeting the dynamical root of under‐mixed convective circulations, rather than tuning model microphysics or closures, OAS delivers robust, scale‐aware improvements in precipitation statistics, cloud vertical structure, and characteristics of MCS (MCSs), offering a practical pathway to more reliable CPM simulations for weather and climate applications.

CPM↗

Computational and numerical analysis of AC optimal power flow formulations on large-scale power grids

We report that alternating current optimal power flow (AC-OPF) is a fundamental tool in electric utilities to determine optimal operation of the various resources. Typically, the AC-OPF problem uses power balance formulation containing voltages and power equations. Yet, there is no comprehensive comparison of the different AC-OPF formulations, especially for large-scale networks. This paper presents a detailed comparative evaluation of different formulations of the AC-OPF problem on networks ranging from 9-bus to 25,000 buses. Three different formulations: 1) power balance with polar voltages, 2) power balance with Cartesian voltages, and 3) current balance with Cartesian voltages are discussed in detail by comparing their characteristics, and numerical and computational performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Cartesian-diffusion Langevin method for hybrid kinetic-fluid Coulomb scattering in particle-in-cell plasma simulations

A novel, drag-diffusion Langevin method of hybrid, kinetic-fluid Coulomb scattering in plasmas is presented. Unlike previous methods, the frictional drag is always applied in the simulation frame of reference. The velocity-space diffusion is performed in the stationary-fluid frame of reference when anisotropic, and in the laboratory frame when isotropic. While the general method is mass-ratio independent, we focus on interactions of kinetic-ions and fluid-electrons to show first-order modifications to the electron velocity distribution function that are an important correction for the accurate calculation of electric resistivity. Inclusion of sub-cycling and a limit to the maximum collision frequency is shown to allow for arbitrarily large timesteps without numerical failure. Here the Langevin method is compared with a grid-based binary method and found to require a much less restrictive timestep in cases of ion–electron slowing and temperature equilibration; this finding differs from previous work and is dependent on the mass ratio.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Cholla-MHD: An Exascale-capable Magnetohydrodynamic Extension to the Cholla Astrophysical Simulation Code

Abstract We present an extension of the massively parallel, GPU native, astrophysical hydrodynamics code Cholla to magnetohydrodynamics (MHD). Cholla solves the ideal MHD equations in their Eulerian form on a static Cartesian mesh utilizing the Van Leer + constrained transport integrator, the HLLD Riemann solver, and reconstruction methods at second and third order. Cholla’s MHD module can perform ≈260 million cell updates per GPU-second on an NVIDIA A100 while using the HLLD Riemann solver and second order reconstruction. The inherently parallel nature of GPUs combined with increased memory in new hardware allows Cholla’s MHD module to perform simulations with resolutions ∼500 3 cells on a single high-end GPU (e.g., an NVIDIA A100 with 80 GB of memory). We employ GPU direct Message Passing Interface to attain excellent weak scaling on the exascale supercomputer Frontier, while using 74,088 GPUs and simulating a total grid size of over 7.2 trillion cells. A suite of test problems highlights the accuracy of Cholla’s MHD module and demonstrates that zero magnetic divergence in solutions is maintained to round off error. We also present new testing and CI tools using GoogleTest, GitHub Actions, and Jenkins that have made development more robust and accurate and ensure reliability in the future.

Astronomy & Astrophysics↗

Tensor Network Space-Time Spectral Collocation Method for Time-Dependent Convection-Diffusion-Reaction Equations

Emerging tensor network techniques for solutions of partial differential equations (PDEs), known for their ability to break the curse of dimensionality, deliver new mathematical methods for ultra-fast numerical solutions of high-dimensional problems. Here, we introduce a Tensor Train (TT) Chebyshev spectral collocation method, in both space and time, for the solution of the time-dependent convection-diffusion-reaction (CDR) equation with inhomogeneous boundary conditions, in Cartesian geometry. Previous methods for numerical solution of time-dependent PDEs often used finite difference for time, and a spectral scheme for the spatial dimensions, which led to a slow linear convergence. Spectral collocation space-time methods show exponential convergence; however, for realistic problems they need to solve large four-dimensional systems. We overcome this difficulty by using a TT approach, as its complexity only grows linearly with the number of dimensions. We show that our TT space-time Chebyshev spectral collocation method converges exponentially, when the solution of the CDR is smooth, and demonstrate that it leads to a very high compression of linear operators from terabytes to kilobytes in TT-format, and a speedup of tens of thousands of times when compared to a full-grid space-time spectral method. These advantages allow us to obtain the solutions at much higher resolutions.

97 MATHEMATICS AND COMPUTING↗