Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cartesian”

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 91 records · Page 5

Cartesian Off-Body Grid Adaption for Viscous Time- Accurate Flow Simulation

An improved solution adaption capability has been implemented in the OVERFLOW overset grid CFD code. Building on the Cartesian off-body approach inherent in OVERFLOW and the original adaptive refinement method developed by Meakin, the new scheme provides for automated creation of multiple levels of finer Cartesian grids. Refinement can be based on the undivided second-difference of the flow solution variables, or on a specific flow quantity such as vorticity. Coupled with load-balancing and an inmemory solution interpolation procedure, the adaption process provides very good performance for time-accurate simulations on parallel compute platforms. A method of using refined, thin body-fitted grids combined with adaption in the off-body grids is presented, which maximizes the part of the domain subject to adaption. Two- and three-dimensional examples are used to illustrate the effectiveness and performance of the adaption scheme.

Buning, Pieter G.↗

Lattice Boltzmann and Navier-Stokes Cartesian CFD Approaches for Airframe Noise Predictions

Lattice Boltzmann (LB) and compressible Navier-Stokes (NS) equations based computational fluid dynamics (CFD) approaches are compared for simulating airframe noise. Both LB and NS CFD approaches are implemented within the Launch Ascent and Vehicle Aerodynamics (LAVA) framework. Both schemes utilize the same underlying Cartesian structured mesh paradigm with provision for local adaptive grid refinement and sub-cycling in time. We choose a prototypical massively separated, wake-dominated flow ideally suited for Cartesian-grid based approaches in this study - The partially-dressed, cavity-closed nose landing gear (PDCC-NLG) noise problem from AIAA's Benchmark problems for Airframe Noise Computations (BANC) series of workshops. The relative accuracy and computational efficiency of the two approaches are systematically compared. Detailed comments are made on the potential held by LB to significantly reduce time-to-solution for a desired level of accuracy within the context of modeling airframes noise from first principles.

Airframe Noise Prediction↗

Cartesian Mesh Simulations for the Third AIAA Sonic Boom Prediction Workshop

Simulation results are presented for all cases from the Third AIAA Sonic Boom Prediction Workshop. An inviscid, embedded-boundary Cartesian-mesh flow solver is used in conjunction with adjoint-based mesh adaptation to compute nearfield pressure signatures. Specialized techniques are applied to maximize accuracy and minimize cost on Cartesian meshes. The Richardson-based error estimate highlights regions of the signatures most sensitive to mesh refinement. Timing results and coarse, medium, and fine mesh sizes for nearfield cases demonstrate that the parallel decomposition approach is efficient in both computational time and wall-clock. Pressure signals are propagated to the ground using an augmented Burgers’ equation solver to predict boom carpets. Ground signatures and loudness metrics are presented for a standard atmosphere as well as more realistic atmospheric profiles, which affect overall noise levels and can significantly widen the boom carpet. Mesh convergence studies show that high sampling frequencies, around 500 kHz, are required for propagation, and the sampling frequency increases at large off-track angles with longer acoustic ray paths and propagation times. The numerical methods yield accurate results for predicting low sonic boom signatures while being among the least computationally expensive of the workshop.

ARMD↗

Wall-Modeled LES of a Swept Wing with Leading-Edge Ice Using LAVA Curvilinear, Unstructured, and Cartesian Solvers

Wall-modeled large-eddy simulation (LES) of a swept wing with leading-edge ice build up is performed using three mesh paradigms and associated flow solvers and compared to experimental results. The study focuses on an 8.9% scale model of the CRM65 swept wing featuring both high-fidelity and smooth leading-edge ice shapes. The assessment is conducted using the Launch, Ascent, and Vehicle Aerodynamics (LAVA) framework using the three actively supported meshing paradigms in LAVA: structured curvilinear overset, unstructured, andCartesian. For the iced configurations, these paradigms use hybrid body-fitted/source-term immersed-boundary, body-fitted, and ghost-cell immersed-boundary strategies, respectively.The unstructured and Cartesian mesh paradigms are particularly attractive for complex ice shapes as they avoid the manual mesh generation effort associated with the curvilinear approach. For the high-fidelity ice shape, good agreement with the experiment can be obtained with all three strategies; however, the curvilinear method is particularly sensitive to the source-term immersed-boundary timescale and span wise mesh resolution, and the Cartesian implementation is sensitive to the choice of numerical flux. For the smooth ice, larger discrepancies are observed across all methods. However, a mesh refinement study guided by flow visualizations leads to an improved comparison with the experiment that is particularly pronounced for the unstructured mesh paradigm.

TTT↗

A Cut-Cell Approach for 2D Cartesian Meshes that Preserves Orthogonal Grid Sweep Ordering

In this paper, we present a cut-cell methodology for solving the two-dimensional neutral-particle transport equation on an orthogonal Cartesian grid. We allow the rectangular cell to be subdivided into two polygonal subcells. We ensure that this division (or cut) conserves the volumes of the materials in the subcells and we utilize a step-characteristics (SC) slice balance approach (SBA) to calculate the angular fluxes exiting the cell as well as the average scalar fluxes in each subcell. Solving the discrete ordinates transport equation on an arbitrary mesh has historically been difficult to parallelize while maintaining good parallel efficiency. However on Cartesian meshes, the KBA algorithm maintains good parallel efficiency using a direct solve. The ability to preserve this algorithm was a driving factor in the development of our cut-cell method. This method also provides a more accurate depiction of a material interface in a cell, which leads to more accurate solutions downstream of this cell. As a result, fewer spatial cells can be utilized, resulting in reduced memory requirements. We apply this approach in the 2D/3D discrete ordinates neutral-particle transport code Denovo, where we analyze a 2D 3 x 3 lattice of pincells. We show that, for eigenvalue problems, a significant increase in accuracy for a given mesh size is gained by utilizing the cut-cell, SC equations instead of the standard homogenized-cell, SC equations.

99 GENERAL AND MISCELLANEOUS↗

11-th order of accuracy for numerical solution of 3-D Poisson equation with irregular interfaces on unfitted Cartesian meshes

For the first time the optimal local truncation error method (OLTEM) with 125-point stencils and unfitted Cartesian meshes has been developed in the general 3-D case for the Poisson equation for heterogeneous materials with smooth irregular interfaces. The 125-point stencils equations that are similar to those for quadratic finite elements are used for OLTEM. The interface conditions for OLTEM are imposed as constraints at a small number of interface points and do not require the introduction of additional unknowns, i.e., the sparse structure of global discrete equations of OLTEM is the same for homogeneous and heterogeneous materials. The stencils coefficients of OLTEM are calculated by the minimization of the local truncation error of the stencil equations. These derivations include the use of the Poisson equation for the relationship between the different spatial derivatives. Such a procedure provides the maximum possible accuracy of the discrete equations of OLTEM. In contrast to known numerical techniques with quadratic elements and third order of accuracy on conforming and unfitted meshes, OLTEM with the 125-point stencils provides 11-th order of accuracy, i.e., an extremely large increase in accuracy by 8 orders for similar stencils. The numerical results show that OLTEM yields much more accurate results than high-order finite elements with much wider stencils. The increased numerical accuracy of OLTEM leads to an extremely large increase in computational efficiency. Additionally, a new post-processing procedure with the 125-point stencil has been developed for the calculation of the spatial derivatives of the primary function. The post-processing procedure includes the minimization of the local truncation error and the use of the Poisson equation. It is demonstrated that the use of the partial differential equation (PDE) for the 125-point stencils improves the accuracy of the spatial derivatives by 6 orders compared to post-processing without the use of PDE as in existing numerical techniques. At an accuracy of 0.1% for the spatial derivatives, OLTEM reduces the number of degrees of freedom by 900 - 4∙10 6 times compared to quadratic finite elements. The developed post-processing procedure can be easily extended to unstructured meshes and can be independently used with existing post-processing techniques (e.g., with finite elements).

97 MATHEMATICS AND COMPUTING↗

Accelerated Cartesian expansion (ACE) based framework for the rapid evaluation of diffusion, lossy wave, and Klein-Gordon potentials

Diffusion, lossy wave, and Klein–Gordon equations find numerous applications in practical problems across a range of diverse disciplines. The temporal dependence of all three Green’s functions are characterized by an infinite tail. This implies that the cost complexity of the spatio-temporal convolutions, associated with evaluating the potentials, scales as O(N s 2 N t 2 ), where N s and N t are the number of spatial and temporal degrees of freedom, respectively. In this paper, we discuss two new methods to rapidly evaluate these spatio-temporal convolutions by exploiting their block-Toeplitz nature within the framework of accelerated Cartesian expansions (ACE). The first scheme identifies a convolution relation in time amongst ACE harmonics and the fast Fourier transform (FFT) is used for efficient evaluation of these convolutions. The second method exploits the rank deficiency of the ACE translation operators with respect to time and develops a recursive numerical compression scheme for the efficient representation and evaluation of temporal convolutions. It is shown that the cost of both methods scales as O(N s N t log 2 N t ). Furthermore, several numerical results are presented for the diffusion equation to validate the accuracy and efficacy of the fast algorithms developed here.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An arbitrarily high-order three-dimensional Cartesian-grid method for reconstructing interfaces from volume fraction fields

Here Tthis work describes a newly developed, arbitrarily high-order Cartesian-grid method for reconstructing material interfaces from a volume fraction field. The method begins by identifying all of the grid cells in the volume fraction field that are intersected by the interface and need to be approximated by the reconstruction scheme. Finite-differences are used to calculate the gradient of the volume fraction field and provide an estimate of the surface normal in all of the interfacial grid cells. Groups of connected grid cells are then identified which all have the same dominant component of the normal vector. This grouping by orientation determines the proper dependent variable to use in the surface reconstruction (e.g. for a 2D curve, this step determines if the surface will be approximated by a function of x or y). A cumulative integral over the surface is constructed and fit using b-splines for two-dimensional problems or tensor-product b-splines for three-dimensional problems. This construction allows for the interface to be recovered through application of the second fundamental theorem of calculus. Fitting the cumulative integral with $\mathscr{N}$ th-order b-splines (or tensor-product b-splines) yields an ($\mathscr{N}$-1) th-order convergence rate of the interface shape. Differentiation of the b-spline interface function(s) allows for the high-order approximation of the normal vector and curvature to be obtained directly anywhere along b-spline. Together, the proposed reconstruction technique can achieve arbitrarily high mesh convergence rates. Validation tests are presented with mesh convergence rates ranging from fourth- to tenth-order.

97 MATHEMATICS AND COMPUTING↗

Static Aeroelastic Analysis with an Inviscid Cartesian Method

An embedded-boundary, Cartesian-mesh flow solver is coupled with a three degree-of-freedom structural model to perform static, aeroelastic analysis of complex aircraft geometries. The approach solves a nonlinear, aerostructural system of equations using a loosely-coupled strategy. An open-source, 3-D discrete-geometry engine is utilized to deform a triangulated surface geometry according to the shape predicted by the structural model under the computed aerodynamic loads. The deformation scheme is capable of modeling large deflections and is applicable to the design of modern, very-flexible transport wings. The coupling interface is modular so that aerodynamic or structural analysis methods can be easily swapped or enhanced. After verifying the structural model with comparisons to Euler beam theory, two applications of the analysis method are presented as validation. The first is a relatively stiff, transport wing model which was a subject of a recent workshop on aeroelasticity. The second is a very flexible model recently tested in a low speed wind tunnel. Both cases show that the aeroelastic analysis method produces results in excellent agreement with experimental data.

Aeroelastic↗

Extending a CAD-Based Cartesian Mesh Generator for the Lattice Boltzmann Method

This paper describes the development of a custom preprocessor for the PaRAllel Thermal Hydraulics simulations using Advanced Mesoscopic methods (PRATHAM) code based on an open-source mesh generator, CartGen [1]. PRATHAM is a three-dimensional (3D) lattice Boltzmann method (LBM) based parallel flow simulation software currently under development at the Oak Ridge National Laboratory. The LBM algorithm in PRATHAM requires a uniform, coordinate system-aligned, non-body-fitted structured mesh for its computational domain. CartGen [1], which is a GNU-licensed open source code, already comes with some of the above needed functionalities. However, it needs to be further extended to fully support the LBM specific preprocessing requirements. Therefore, CartGen is being modified to (i) be compiler independent while converting a neutral-format STL (Stereolithography) CAD geometry to a uniform structured Cartesian mesh, (ii) provide a mechanism for PRATHAM to import the mesh and identify the fluid/solid domains, and (iii) provide a mechanism to visually identify and tag the domain boundaries on which to apply different boundary conditions.

Cartesian Grid↗

Parallel transport sweeps on two-dimensional cartesian and hexagonal grids

This paper aims to provide a proof of concept for parallel transport sweeps on two-dimensional hexagonal grids for the discrete ordinates transport equation. While the method is an extension of the popular and well-established Koch-Baker-Alcoulffe (KBA) algorithm, there are significant differences between the cartesian and hexagonal grid and thereafter sweep. The most important is the three-way connectivity of hexagons within the grid which creates greater dependencies between the elements. The KBA method in structured orthogonal grids was first implemented in the DRAGON5 code and the method is first described here. The differences in implementation for the hexagonal grid are also described. Benchmark results are also presented, showing roughly 10 times speedup in computational times with roughly 100 processors, in both cases. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

An adaptive fast multipole method in Cartesian basis, enabled by algorithmic differentiation

A novel form of the fast multipole method is realized by the combination of adaptive data structures with implementation of the multipole expansions and their translations in Cartesian basis, and enabled by algorithmic differentiation. It may be possible to generalize it to any kernel that allows its formulation as a function of small quantities with respect to which they can be expanded. There is no hard and fast rule recipe that works for all cases. However, it is shown how to do it for the softened Coulomb kernel, which is different from the Coulomb kernel. The characteristics and performance of the method are mapped and shown to provide an attractive option for a generic fast multipole algorithm in a wide region of the parameter space. The algorithm is illustrated with a beam dynamics application.

97 MATHEMATICS AND COMPUTING↗

Numerical studies of heterogeneous reaction in stagnation flows using one-dimensional and two-dimensional Cartesian models

Flow over a thin strip is one of the major experimental configurations in the study of catalytic combustion. 1D laminar stagnation-flow models are generally employed to investigate the catalytic combustion characteristics in this experimental configuration. In this study, a 2D Cartesian model is developed to examine the conditions under which 1D models are applicable. The results show that the 1D model is only appropriate in the experimental configurations with a length-to-width ratio less than 1 to 3 (depending on the flow conditions). The 1D model failed because of the neglecting of transverse diffusive mass transfer (at Re < 30) and of the oversimplified convective mass transfer (at Re > 60). The calculations of the 1D and 2D models are also compared against the OH measurements performed in a typical stagnation-flow reactor with a length-to-width ratio of 16. The results show that the computations of the 2D model are in better agreement with the experimental data. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Solution of the Skyrme-Hartree-Fock-Bogolyubov equations in the Cartesian deformed harmonic-oscillator basis. (VI) HFODD (v2.40h): A new version of the program

We describe the new version (v2.40h) of the code hfodd which solves the nuclear Skyrme-Hartree-Fock or Skyrme-Hartree-Fock-Bogolyubov problem by using the Cartesian deformed harmonic-oscillator basis. In the new version, we have implemented: (i) projection on good angular momentum (for the Hartree-Fock states), (ii) calculation of the GCM kernels, (iii) calculation of matrix elements of the Yukawa interaction, (iv) the BCS solutions for state-dependent pairing gaps, (v) the HFB solutions for broken simplex symmetry, (vi) calculation of Bohr deformation parameters, (vii) constraints on the Schiff moments and scalar multipole moments, (viii) the D{sub 2h}{sup T} transformations and rotations of wave functions, (ix) quasiparticle blocking for the HFB solutions in odd and odd-odd nuclei, (x) the Broyden method to accelerate the convergence, (xi) the Lipkin-Nogami method to treat pairing correlations, (xii) the exact Coulomb exchange term, (xiii) several utility options, and we have corrected three insignificant errors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Solution of the Skyrme-Hartree-Fock-Bogolyubov equations in the Cartesian deformed harmonic-oscillator basis. (VII) HFODD (v2.49t): A new version of the program

We describe the new version (v2.49t) of the code HFODD which solves the nuclear Skyrme Hartree-Fock (HF) or Skyrme Hartree-Fock-Bogolyubov (HFB) problem by using the Cartesian deformed harmonic-oscillator basis. In the new version, we have implemented the following physics features: (i) the isospin mixing and projection, (ii) the finite temperature formalism for the HFB and HF+BCS methods, (iii) the Lipkin translational energy correction method, (iv) the calculation of the shell correction. A number of specific numerical methods have also been implemented in order to deal with large-scale multi-constraint calculations and hardware limitations: (i) the two-basis method for the HFB method, (ii) the Augmented Lagrangian Method (ALM) for multi-constraint calculations, (iii) the linear constraint method based on the approximation of the RPA matrix for multi-constraint calculations, (iv) an interface with the axial and parity-conserving Skyrme-HFB code HFBTHO, (v) the mixing of the HF or HFB matrix elements instead of the HF fields. Special care has been paid to using the code on massively parallel leadership class computers. For this purpose, the following features are now available with this version: (i) the Message Passing Interface (MPI) framework, (ii) scalable input data routines, (iii) multi-threading via OpenMP pragmas, (iv) parallel diagonalization of the HFB matrix in the simplex breaking case using the ScaLAPACK library. Finally, several little significant errors of the previous published version were corrected.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗