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 19 records

GSRP/David Marshall: Fully Automated Cartesian Grid CFD Application for MDO in High Speed Flows

With the renewed interest in Cartesian gridding methodologies for the ease and speed of gridding complex geometries in addition to the simplicity of the control volumes used in the computations, it has become important to investigate ways of extending the existing Cartesian grid solver functionalities. This includes developing methods of modeling the viscous effects in order to utilize Cartesian grids solvers for accurate drag predictions and addressing the issues related to the distributed memory parallelization of Cartesian solvers. This research presents advances in two areas of interest in Cartesian grid solvers, viscous effects modeling and MPI parallelization. The development of viscous effects modeling using solely Cartesian grids has been hampered by the widely varying control volume sizes associated with the mesh refinement and the cut cells associated with the solid surface. This problem is being addressed by using physically based modeling techniques to update the state vectors of the cut cells and removing them from the finite volume integration scheme. This work is performed on a new Cartesian grid solver, NASCART-GT, with modifications to its cut cell functionality. The development of MPI parallelization addresses issues associated with utilizing Cartesian solvers on distributed memory parallel environments. This work is performed on an existing Cartesian grid solver, CART3D, with modifications to its parallelization methodology.

Source record↗

Mapped Moments to a Cartesian Grid (MMCG) Value-Added Product Report

Objective analysis (OA) is a method of mapping unstructured data to a structured grid. In the context of scanning radar data, OA is used to interpolate data in antenna coordinates (range, azimuth, and elevation) onto a regularly spaced Cartesian grid (Trapp and Doswell 2000). The U.S. Department of Energy Atmospheric Radiation Measurement (ARM) user facility’s Mapped Moments to a Cartesian Grid (MMCG) Value-Added Product (VAP) uses the Python ARM Radar Toolkit (Py-ART), a data model-driven interactive architecture for working with weather radar data, to map the data to a Cartesian grid (Helmus and Collis 2016). MMCG, with Py-ART built in, has the ability to take radar data in antenna coordinates and map the gates to a Cartesian grid using inverse distance weight functions such as Cressman (square) and Barnes (exponential), but also can filter the data during the interpolation. MMCG also allows arbitrary formulations for the radius of influence, which are matched to particular radar scanning strategies. This creates a complex parameter space for optimizing the retention of storm structure detail while minimizing artifacts. MMCG takes data processed with ARM’s Corrected Precipitation Radar Moments in Antenna Coordinates (CMAC) VAP and maps it to a Cartesian grid as the output product. A variety of fields that have been mapped to the Cartesian grid are then saved to plots to complement each grid file.

54 ENVIRONMENTAL SCIENCES↗

Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces

To compute the non-oscillating mutual interaction for a systems with N points, the fast multipole method (FMM) has an efficiency that scales linearly with the number of points. Specifically, for Coulomb interaction, FMM can be constructed using either the spherical harmonic functions or the totally symmetric Cartesian tensors. In this paper, we will present that the effciency of the Cartesian tensor-based FMM for the Coulomb interaction can be significantly improved by implementing the traces of the Cartesian tensors in calculation to reduce the independent elements of the n-th rank totally symmetric Cartesian tensor from (n + 1)(n + 2)=2 to 2n + 1. The computation complexity for the operations in FMM are analyzed and expressed as polynomials of the highest rank of the Cartesian tensors. For most operations, the complexity is reduced by one order. Numerical examples regarding the convergence and the effciency of the new algorithm are demonstrated. As a result, a reduction of computation time up to 50% has been observed for a moderate number of points and rank of tensors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automatic off-body overset adaptive Cartesian mesh method based on an octree approach

This paper describes a method for generating adaptive structured Cartesian grids within a near-body/off-body mesh partitioning framework for the flow simulation around complex geometries. The off-body Cartesian mesh generation derives from an octree structure, assuming each octree leaf node defines a structured Cartesian block. This enables one to take into account the large scale discrepancies in terms of resolution between the different bodies involved in the simulation, with minimum memory requirements. Two different conversions from the octree to Cartesian grids are proposed: the first one generates Adaptive Mesh Refinement (AMR) type grid systems, and the second one generates abutting or minimally overlapping Cartesian grid set. We also introduce an algorithm to control the number of points at each adaptation, that automatically determines relevant values of the refinement indicator driving the grid refinement and coarsening. An application to a wing tip vortex computation assesses the capability of the method to capture accurately the flow features.

97 MATHEMATICS AND COMPUTING↗

SU-E-I-41: Non-Cartesian MR Image Reconstruction with Integrated Gradient Non-Linearity Correction

Purpose: Nonlinearities in the spatial encoding gradients of MRI systems cause geometric distortion in images. Typically, this is retrospectively corrected via image-domain interpolation (a.k.a., “gradwarp”) albeit with a loss of spatial resolution. For non-Cartesian MRI, the latter problem is exaggerated by noise and undersampling artifact. In this study, we describe a novel correction strategy that accounts for gradient nonlinearities during — rather than after — non-Cartesian MRI reconstruction, and demonstrate that this approach mitigates the resolution loss that can occur with standard methods. Methods: To test the proposed method, the American College of Radiology (ACR) quality control phantom was scanned on at 1.5 T (General Electric, v16.0, “zoom” gradient) using a 1.6x undersampled 3D non- Cartesian Shells trajectory (GRE, FOV=24 cm3, 120 shells, 16552 shots, 512 readout, matrix=2403). Image reconstruction was first performed via standard k-space density-compensated gridding and retrospectively corrected via cubic spline interpolation. Image reconstruction was then separately performed using a k-space and image-domain densitycompensated type-3 non-uniform fast Fourier transform (NUFFT), which provides a direct mapping between non-Cartesian k-space samples and warped image space voxel locations. Thus, no separate distortion correction procedure is needed for the proposed approach. The gradient distortion field was determined using vendor provided calibration data. Results: Phantom scan results show that both processing approaches successfully correct geometric distortion. However, visual inspection of the ACR phantom spatial resolution inserts shows that the proposed strategy preserves the resolution of the nominal (uncorrected) reconstruction while “gradwarp” imparts marked spatial blurring (especially for the 1.0 and 1.1 mm inserts) and thus resolution loss. Conclusion: We've presented a novel reconstruction strategy for non-Cartesian MRI that corrects for gradient nonlinearities during — rather than after — reconstruction, and thus better preserves image resolution than traditional interpolation-based methods. This approach is expected to be especially advantageous when imaging with non-standard magnet geometries. NIH RR018898; NIH EB10065.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Protostellar hydrodynamics: Constructing and testing a spacially and temporally second-order accurate method. 2: Cartesian coordinates

In Boss & Myhill (1992) we described the derivation and testing of a spherical coordinate-based scheme for solving the hydrodynamic equations governing the gravitational collapse of nonisothermal, nonmagnetic, inviscid, radiative, three-dimensional protostellar clouds. Here we discuss a Cartesian coordinate-based scheme based on the same set of hydrodynamic equations. As with the spherical coorrdinate-based code, the Cartesian coordinate-based scheme employs explicit Eulerian methods which are both spatially and temporally second-order accurate. We begin by describing the hydrodynamic equations in Cartesian coordinates and the numerical methods used in this particular code. Following Finn & Hawley (1989), we pay special attention to the proper implementations of high-order accuracy, finite difference methods. We evaluate the ability of the Cartesian scheme to handle shock propagation problems, and through convergence testing, we show that the code is indeed second-order accurate. To compare the Cartesian scheme discussed here with the spherical coordinate-based scheme discussed in Boss & Myhill (1992), the two codes are used to calculate the standard isothermal collapse test case described by Bodenheimer & Boss (1981). We find that with the improved codes, the intermediate bar-configuration found previously disappears, and the cloud fragments directly into a binary protostellar system. Finally, we present the results from both codes of a new test for nonisothermal protostellar collapse.

Myhill, Elizabeth A.↗

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

Nemec, Marian↗

Adjoint Sensitivity Computations for an Embedded-Boundary Cartesian Mesh Method and CAD Geometry

Cartesian-mesh methods are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm included the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach. Thereafter, we focus on a shape optimization problem for an Apollo-like reentry capsule. The optimization seeks to enhance the lift-to-drag ratio of the capsule by modifyjing the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design. This abstract presents only a brief outline of the numerical method and results; full details will be given in the final paper.

Nemec, Marian↗

Multivariate Normality of Cartesian-Framed Covariances: Evaluation and Operational Significance

Collision avoidance relies on representative Cartesian uncertainty volumes in order to calculate probabilities of collision. Among the potential shortcomings of a covariance matrix representation of state errors, the most worrisome is the coordinate mismatch between the Cartesian framework in which these matrices are distributed and the curvilinear path that satellite orbits actually follow. The present study compares curvilinear-based and Cartesian covariance representations for ~50,000 conjunctions to determine the frequency in which significant deviations from Gaussianity are observed, then compares the 2-D Pc result from the Cartesian covariance to a Monte Carlo Pc conducted in element space to assess operational significance.

Lechtenberg, Travis F.↗

Multivariate Normality of Cartesian Frame Covariances: Evaluation and Operational Significance

Collision avoidance relies on representative Cartesian uncertainty volumes in order to calculate probabilities of collision. Among the potential shortcomings of a covariance matrix representation of state errors, the most worrisome is the coordinate mismatch between the Cartesian framework in which these matrices are distributed and the curvilinear path that satellite orbits actually follow. The present study compares curvilinear-based and Cartesian covariance representations for ~50,000 conjunctions to determine the frequency in which significant deviations from Gaussianity are observed, then compares the 2-D Pc result from the Cartesian covariance to a Monte Carlo Pc conducted in element space to assess operational significance.

Lechtenberg, Travis F.↗

ARM X-SAPR Mapped Moments to a Cartesian Grid (MMCG)

Mapped Moments to a Cartesian Grid (MMCG), is taking geographic or polar coordinates and mapping the radar data to a Cartesian grid. Such a method, is useful to data users who are not familiar with radar coordinates. It is also useful to map radar data from radar coordinates to Cartesian coordinates, because some schemes for data assimilation require a level of objective analysis.

54 ENVIRONMENTAL SCIENCES↗

Performance Evaluation of a Cartesian Move Algorithm for the LSMS Family of Cable-Driven Cranes

The Lightweight Surface Manipulation System, or LSMS, is a family of cable-actuated cranes, designed for surface operations on the Moon and Mars. Its structural design focuses on three fundamental traits for space environments: a high payload-to-mass ratio to reduce launch costs, compactness for space travel in reduced cargo bays, and self-erecting capabilities for operations before astronauts arrive. The resulting design confers nonlinear and switched dynamics to the LSMS, making these cranes an interesting challenge for autonomous and teleoperated applications. One of the protocols required for these applications is a Cartesian move algorithm. This algorithm is responsible for placing the end effector of the crane at a desired location, specified in Cartesian coordinates. This paper evaluates the performance of a Cartesian move algorithm developed for the LSMS at the NASA Langley Research Center. To this end, several payload manipulation tasks were performed with LSMS-L35, the smallest version within the LSMS family. The evaluated algorithm can place the end effector with accuracy, as shown in the hardware and simulation tests.

cable-actuated↗

Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors

Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A software library based on this algorithm has been implemented in C++11 and has been released.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Aeroelastic Analysis Using Deforming Cartesian Grids

Ongoing work in air-vehicle design illustrates the potential of advanced concepts to provide significant improvements in efficiency; but with their incorporation of lightweight flexible structures, such configurations may require active control systems to ensure reliability and safety. However, many contemporary analysis methods are inefficient for aeroelastic analysis and design of such configurations. This paper describes the development of a new approach that automates the geometry setup, mesh generation, and assembly of fluid–structural coupling interfaces to enable efficient aeroelastic and aeroservoelastic analysis of advanced concepts. The core elements for this approach are a cut-cell Cartesian grid-based computational fluid dynamics solver, a nonlinear beam element structural model, a conservative fluid–structural interface treatment, and the formulation and implementation of a new deforming grid capability within the cut-cell Cartesian grid solver. In this paper, emphasis is on this latter component with detailed description given of the mesh motion strategy, evaluation of fluxes and structural loads at the surface, and computation of geometrical properties such as cell volume, directed face areas, centroids, and motion-induced fluxes for deforming Cartesian grids required to advance the flow states. Aeroelastic simulations exercising the capability show favorable agreement with data and predictions in the literature for subsonic and supersonic applications.

97 MATHEMATICS AND COMPUTING↗

A Cartesian parametrization for the numerical analysis of material instability

We examine four parametrizations of the unit sphere in the context of material stability analysis by means of the singularity of the acoustic tensor. We then propose a Cartesian parametrization for vectors that lie a cube of side length two and use these vectors in lieu of unit normals to test for the loss of the ellipticity condition. This parametrization is then used to construct a tensor akin to the acoustic tensor. It is shown that both of these tensors become singular at the same time and in the same planes in the presence of a material instability. Furthermore, the performance of the Cartesian parametrization is compared against the other parametrizations, with the results of these comparisons showing that in general, the Cartesian parametrization is more robust and more numerically efficient than the others.

36 MATERIALS SCIENCE↗

Density- and wavefunction-normalized Cartesian spherical harmonics for l ≤ 20

The widely used pseudoatom formalism in experimental X-ray charge-density studies makes use of real spherical harmonics when describing the angular component of aspherical deformations of the atomic electron density in molecules and crystals. The analytical form of the density-normalized Cartesian spherical harmonic functions for up to l ≤ 7 and the corresponding normalization coefficients were reported previously by Paturle & Coppens. It was shown that the analytical form for normalization coefficients is available primarily for l ≤ 4. Only in very special cases it is possible to derive an analytical representation of the normalization coefficients for 4 < l ≤ 7. In most cases for l > 4 the density normalization coefficients were calculated numerically to within seven significant figures. In this study we review the literature on the density-normalized spherical harmonics, clarify the existing notations, use the Paturle–Coppens method in the Wolfram Mathematica software to derive the Cartesian spherical harmonics for l ≤ 20 and determine the density normalization coefficients to 35 significant figures, and computer-generate a Fortran90 code. The article primarily targets researchers who work in the field of experimental X-ray electron density, but may be of some use to all who are interested in Cartesian spherical harmonics.

74 ATOMIC AND MOLECULAR PHYSICS↗

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↗