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.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Addition of tabulated equation of state and neutrino leakage support to illinoisgrmhd

Here we have added support for realistic, microphysical, finite-temperature equations of state (EOS) and neutrino physics via a leakage scheme to illinoisgrmhd, an open-source GRMHD code for dynamical spacetimes in the einstein toolkit. These new features are provided by two new, nrpy+-based codes: nrpyeos, which performs highly efficient EOS table lookups and interpolations, and nrpyleakage, which implements a new, adaptive mesh refinement (AMR)-capable neutrino leakage scheme in the einstein toolkit. We have performed a series of strenuous validation tests that demonstrate the robustness of these new codes, particularly on the Cartesian AMR grids provided by carpet. Furthermore, we show results from fully dynamical GRMHD simulations of single unmagnetized neutron stars, and magnetized binary neutron star mergers. This new version of illinoisgrmhd, as well as nrpyeos and nrpyleakage, is pedagogically documented in jupyter notebooks and fully open source. The codes will be proposed for inclusion in an upcoming version of the einstein toolkit.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

A Hybrid Finite-Volume, Discontinuous Galerkin Discretization for the Radiative Transport Equation

In this report we propose a hybrid spatial discretization for the radiative transport equation that combines a second-order discontinuous Galerkin (DG) method and a second-order finite-volume (FV) method. The strategy relies on a simple operator splitting that has been used previously to combine different angular discretizations. Unlike standard FV methods with upwind fluxes, the hybrid approach is able to accurately simulate problems in scattering dominated regimes. However, it requires less memory and yields a faster computational time than a uniform DG discretization. In addition, the underlying splitting allows naturally for hybridization in both space and angle. Numerical results are given to demonstrate the efficiency of the hybrid approach in the context of discrete ordinate angular discretizations and Cartesian spatial grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A 6th Order Mehrstellen Finite Volume Discretization of Poisson's Equation in Three Dimensions

We discuss the derivation of a new, sixth-order finite volume scheme for Poisson’s equation on 3D Cartesian equispaced grids. The scheme is based on a discretization of the Laplace operator with a compact (Mehrstellen) 27-point stencil. To achieve sixth order convergence the right hand side of the equation is replaced with a discrete operator that involves the discrete Laplace and Biharmonic operators and the sum of discrete fourth-order cross derivatives applied to the charge function. Numerical tests demonstrate the superiority of the proposed method compared to the well known schemes associated with the 7-point and 19-point discretizations of the Laplacian.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Achieving Higher Order Accuracy in Space in Hydrodynamic Simulations of Self-Gravitating Gas

Modern astrophysical simulation codes employ a variety of numerical algorithms capable of achieving higher-order accuracy in both space and time. Albeit they succeed in achieving an effective higher spatial resolution and in suppressing the numerical damping of waves, to our knowledge, all current astrophysical simulations invoking self-gravity are limited to second-order accuracy in space. If we can devise an algorithm to evaluate self-gravity with a higher-order spatial accuracy, we can better the evaluation of the gravitational acceleration and gravitational energy release which dictate the evolution of many astrophysical systems. Herein, we present a numerical algorithm for self-gravitating hydrodynamics capable of achieving fourth order accuracy for a given density distribution on a Cartesian uniform grid. First, we derive the cell-averaged gravitational potential at fourth-order accuracy from the cell-averaged density by solving the Poisson equation. Next, we obtain the cell average of the product of the density and gravitational acceleration, which differs from the cell-averaged density multiplied by the cell-averaged gravitational acceleration. We then show the verification of the algorithm by applying it to critical test problems: (1) maintaining equilibria of self-gravitating slabs, even upon advection, (2) evolving a polytropic sphere with a massive power-law envelope, and (3) conservation of specific entropy during the propagation of a sound wave.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Multi-Doppler radar analysis from CSAPR, CHIVO, COW, and RMA-1 radars during the CACTI/RELAMPAGO experiments in Argentina in 2018

This data set contains multi-Doppler radar analysis from CSAPR-2, CSU-CHIVO, COW, and RMA-1 radars. These radars were collecting dual-polarization data during the CACTI/RELAMPAGO experiments in Argentina in 2018. Doppler analysis is systematically conducted for 31 days with convection. Three-dimensional wind fields are retrieved using the PyDDA algorithm. Dual-polarization information is also included in the data set.

3D cartesian gridded corrected mean Doppler veloci↗
DOE OSTI2020

xsacrgridrhi.c1

Cartesian Cloud Cover Gridding Product for X-Band Scanning ARM Cloud Radar with calibrated input, RHI scan mode at CACTI, MOSAIC, COMBLE, etc.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

kasacrgridrhi.c1

Cartesian Cloud Cover Gridding Product for Ka-Band Scanning ARM Cloud Radar from calibrated input, RHI scan mode at CACTI, MOSAIC, COMBLE, etc.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

xsacrgridppi.c0

This datastream is made by xsacrgridppi VAP. It has (time, Y, X) gridded Ka-band PPI radar data, using nearest neighbor algorithm, with uncalibrated (.a1) input.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

kasacrgridppi.c1

This datastream is made by kasacrgridppi VAP. It has (time, Y, X) gridded Ka-band PPI radar data, using nearest neighbor algorithm, with calibrated (.b1) input. This datastream is very similar to kasacrgridrhi, with the output grid changed from (time, height, h_distance) to (time, Y, X). output c1 level data use calibrated b1 data as input.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

xsacrgridppi.c1

This datastream is made by xsacrgridppi VAP. It has (time, Y, X) gridded Ka-band PPI radar data, using nearest neighbor algorithm, with calibrated (.b1) input.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

CurvilinearGrids.jl: A Julia package for curvilinear coordinate transformations

Finite-difference discretizations of partial differential equations are widespread throughout the scientific community. Oftentimes finite-differences are used to compute spatial gradients of fields on a discrete grid, which is typically a uniform or rectilinear Cartesian mesh. Arbitrary multidimensional geometry is difficult to discretize directly with finite differences, however, due to non-uniform grid spacing and non-orthogonality. Curvilinear coordinate transformations can be used as a strategy to enable arbitrary geometry. While these curvilinear transformations are straightforward, the governing PDEs require additional terms (metrics) and must adhere to strict conservation laws; these criteria complicate the application of the transformation and require careful implementation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Entity—Hardware-agnostic Particle-in-cell Code for Plasma Astrophysics. I. Curvilinear Special Relativistic Module

Entity is a new-generation, fully open-source particle-in-cell (PIC) code developed to overcome key limitations in astrophysical plasma modeling, particularly the extreme separation of scales and the performance challenges associated with evolving, GPU-centric computing infrastructures. It achieves hardware-agnostic performance portability across various GPU and CPU architectures using the Kokkos library. Crucially, Entity maintains a high standard for usability, clarity, and customizability, offering a robust and easy-to-use framework for developing new algorithms and grid geometries, which allows extensive control without requiring edits to the core source code. This paper details the core general-coordinate special relativistic module. Entity is the first PIC code designed to solve the Vlasov–Maxwell system in general coordinates, enabling a coordinate-agnostic framework that provides the foundational structure for straightforward extension to arbitrary coordinate geometries. The core methodology achieves numerical stability by solving particle equations of motion in the global orthonormal Cartesian basis, despite using generalized coordinates like Cartesian, axisymmetric spherical, and quasi-spherical grids. Charge conservation is ensured via a specialized current deposition technique using conformal currents. The code exhibits robust scalability and performance portability on major GPU platforms (AMD MI250X, NVIDIA A100, and Intel Max Series), with the 3D particle pusher and the current deposition operating efficiently at about 2 ns per particle per time step. Functionality is validated through a comprehensive suite of standard Cartesian plasma tests and the accurate modeling of relativistic magnetospheres in curvilinear axisymmetric geometries.

Hakobyan, Hayk [Flatiron Institute, New York, NY (↗
DOE OSTI2022

High-order dimensionally-split Cartesian embedded boundary method for non-dissipative schemes

Centered finite-difference schemes are commonly used for high-fidelity turbulent flow simulations in canonical configurations because of their non-dissipative property and computational efficiency. However, their use in flow simulations over complex geometries is limited by the requirements of a structured grid and a stable boundary treatment in the absence of artificial (numerical) dissipation. Cartesian embedded boundary (EB) approaches provide an efficient structured-grid framework to apply difference schemes over complex domains. However, they are often restricted to low orders of accuracy because of numerical instabilities at the embedded boundaries and the issues of small-cell problem that are difficult to address with high-order accuracy. The present work discusses a systematic approach to obtain high-order EB methods with non-dissipative centered schemes in the interior. This approach, based on satisfying the primary and secondary conservation conditions, is employed to derive EB schemes that are up to sixth-order accurate in the interior and fourth-order accurate globally for hyperbolic, parabolic as well as incompletely parabolic problems. The proposed finite-difference discretization is, by construction, dimensionally split and addresses the small-cell problem without any cell/geometry transformations, thus, highly simplifying implementation in a flow solver. Various linear and non-linear numerical tests are performed to evaluate the stability and the accuracy of the proposed EB schemes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Nonlinear convergence in contact mechanics: Immersed boundary finite volume

In this report we present an immersed boundary finite volume (IBM) method for simulating quasistatic contact mechanics of linearly elastic domains at small strains. In IBM, all external boundaries and internal contacts of an object are represented by embedded surfaces inside a Cartesian mesh, which need not conform to the grid lines. The contact constraints consist of the non-penetrability condition and Coulomb’s friction law, which are discretized using special interpolation stencils and enforced via penalty parameters. The resulting nonlinear system depends on displacement unknowns only. To solve it, we use the Newton method but find that it diverges frequently. To understand the divergence pattern, we analyze a simplified 2-cell problem and show that the global convergence of Newton cannot be ensured for any choice of penalty parameters. We thus propose a modified Newton solver, which guarantees convergence for the 2-cell problem and is numerically verified to converge for all the challenging simulations considered herein. While both 1 st - and 2 nd -order variants of IBM, in displacement unknowns, are proposed, the modified Newton solver applies only to the 1 st -order variant.

42 ENGINEERING↗
DOE OSTI2021

Preliminary Implementation of Two-Dimensional Cartesian Solver in CTF-R

Sub-channel codes are one of the the modeling and simulation tools used for thermal-hydraulic analysis of nuclear reactors. A few examples of such sub-channel codes are the COolant Boiling in Rod Arrays (COBRA) family of codes. The approximations that are used to simplify the fluid conservation equations into sub-channel form, mainly that of axially-dominated flow, lead to noticeable limitations on sub-channels solvers for problems with significant flow in lateral directions. In this report, a two-dimensional Cartesian solver is developed and implemented within CTF-R, which is the residual solver in the North Carolina State University version of COBRA-TF (CTF). The new solver will enable CTF to simulate flow that is not axially-dominated. The appropriate Cartesian forms of the conservation equations are derived and implemented in the solver. Once the conservation equations are established, the process of constructing the matrix system was altered to solve a two-dimensional staggered grid system. A simple case was used to test that the two-dimensional Cartesian solver is accurate. The test problem does not include any source terms or flow in the lateral direction. The results show that the solver was able to run the simple case and converge to a steady-state solution. Future work will focus on testing existing capabilities by using test cases that include transients and equation cross-terms. Future work will also include adding additional capabilities such as enabling the solver to include cases with source terms and three dimensional cases.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Time-explicit Darwin PIC algorithm

A new approach to Darwin particle-in-cell plasma simulation is described. Using a finite-element approach, the vector potential is assured to be exactly solenoidal. This allows writing the system of multi-species particles as an action-at-a-distance Hamiltonian system. Applying recently-developed explicit symplectic methods to this gives a time-explicit algorithm with all desired properties. Elliptic systems for the electrostatic and magneto-static portions of the problem are inverted efficiently by an algebraic multi-grid algorithm. The algorithm is implemented in a two-dimensional Cartesian-geometry code and tested by application to Weibel instability and to Alfvén wave dynamics. Results show the effectiveness of this approach. Extensions to arbitrary meshes and to a partially time-implicit scheme are briefly discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

An Infinite Domain 3D Poisson Solver Based on the Barnes-Hut Algorithm

We present a domain decomposition method for the solution of the 3D Poisson equation with infinite domain boundary conditions. The method is based on an application of the Barnes-Hut tree particle scheme adapted to gridded data. Long range interactions are computed using the first two terms in the Cartesian multipole expansion of Green’s function convoluted with the charge while short range computations are performed using Hockney’s domain doubling algorithm. A standard domain decomposition strategy requires O(N 2 ) applications of Hockney’s algorithm, where N is the number of subdomains that intersect that charge support, while in the present approach only O(Nlog 2 N) such computations suffice. The discretization scheme employed is a sixth order Mehrstellen approximation of the 3D Laplace opera tor. The method exhibits satisfactory accuracy at a substantially reduced computational cost compared to the full domain decomposition Hockney’s algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

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↗