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 37 records · Page 2

Simplified Cartesian Basis Model for Intrapolyad Emission Intensities in the Bent-to-Linear Electronic Transition of Acetylene

The acetylene emission spectrum from the trans-bent electronically excited à state to the linear ground electronic $\tilde{X}$ state has attracted considerable attention because it grants Franck–Condon access to local bending vibrational levels of the $\tilde{X}$ state with large-amplitude motion along the acetylene ⇌ vinylidene isomerization coordinate. For emission from the ground vibrational level of the à state, there is a simplifying set of Franck–Condon propensity rules that gives rise to only one zero-order bright state per conserved vibrational polyad of the $\tilde{X}$ state. Unfortunately, when the upper level involves excitation in the highly admixed ungerade bending modes, ν 4 ' and ν 6 ' , the simplifying Franck–Condon propensity rule breaks down—as long as the usual polar basis (with v and l quantum numbers) is used to describe the degenerate bending vibrations of the $\tilde{X}$ state—and the intrapolyad intensities result from complicated interference patterns between many zero-order bright states. In this article, we show that, when the degenerate bending levels are instead treated in the Cartesian two-dimensional harmonic oscillator basis (with v x and v y quantum numbers), the propensity for only one zero-order bright state (in the Cartesian basis) is restored, and the intrapolyad intensities are simple to model, as long as corrections are made for anharmonic interactions. As a result of trans ⇌ cis isomerization in the à state, intrapolyad emission patterns from overtones of ν 4 ' and ν 6 ' evolve as quanta of trans bend (ν 3 ' ) are added, so the emission intensities are not only relevant to the ground-state acetylene ⇌ vinylidene isomerization, they are also a direct reporter of isomerization in the electronically excited state.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast multipole method using Cartesian tensor in beam dynamic simulation

Here, the fast multipole method (FMM) using traceless totally symmetric Cartesian tensor to calculate the Coulomb interaction between charged particles will be presented. The Cartesian tensor-based FMM can be generalized to treat other non-oscillating interactions with the help of the differential algebra or the truncated power series algebra. Issues on implementation of the FMM in beam dynamic simulations are also discussed.

43 PARTICLE ACCELERATORS↗

Cartesian message passing neural networks for directional properties: Fast and transferable atomic multipoles

The message passing neural network (MPNN) framework is a promising tool for modeling atomic properties but is, until recently, incompatible with directional properties, such as Cartesian tensors. We propose a modified Cartesian MPNN (CMPNN) suitable for predicting atom-centered multipoles, an essential component of ab initio force fields. The efficacy of this model is demonstrated on a newly developed dataset consisting of 46 623 chemical structures and corresponding high-quality atomic multipoles, which was deposited into the publicly available Molecular Sciences Software Institute QCArchive server. We show that the CMPNN accurately predicts atom-centered charges, dipoles, and quadrupoles and that errors in the predicted atomic multipoles have a negligible effect on multipole–multipole electrostatic energies. The CMPNN is accurate enough to model conformational dependencies of a molecule’s electronic structure. This opens up the possibility of recomputing atomic multipoles on the fly throughout a simulation in which they might exhibit strong conformational dependence.

Glick, Zachary L. (ORCID:0000000309002849)↗

Index integral representations for connection between cartesian, cylindrical, and spheroidal systems

In this paper, we present two new index integral representations for connection between cartesian, cylindrical, and spheroidal coordinate systems in terms of Bessel, MacDonald, and conical functions. Our result is mainly motivated by solution of the boundary value problems in domains composed of both cartesian and hyperboloidal boundaries, and the need for new integral representations that facilitate the transformation between these coordinates. As a by-product, the special cases of our results will produce new proofs to known index integrals and provide some new integral identities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-J-158: Respiratory Motion Resolved, Self-Gated 4D-MRI Using Rotating Cartesian K-Space Sampling

Purpose: Dynamic MRI has been used to quantify respiratory motion of abdominal organs in radiation treatment planning. Many existing 4D-MRI methods based on 2D acquisitions suffer from limited slice resolution and additional stitching artifacts when evaluated in 3D{sup 1}. To address these issues, we developed a 4D-MRI (3D dynamic) technique with true 3D k-space encoding and respiratory motion self-gating. Methods: The 3D k-space was acquired using a Rotating Cartesian K-space (ROCK) pattern, where the Cartesian grid was reordered in a quasi-spiral fashion with each spiral arm rotated using golden angle{sup 2}. Each quasi-spiral arm started with the k-space center-line, which were used as self-gating{sup 3} signal for respiratory motion estimation. The acquired k-space data was then binned into 8 respiratory phases and the golden angle ensures a near-uniform k-space sampling in each phase. Finally, dynamic 3D images were reconstructed using the ESPIRiT technique{sup 4}. 4D-MRI was performed on 6 healthy volunteers, using the following parameters (bSSFP, Fat-Sat, TE/TR=2ms/4ms, matrix size=500×350×120, resolution=1×1×1.2mm, TA=5min, 8 respiratory phases). Supplemental 2D real-time images were acquired in 9 different planes. Dynamic locations of the diaphragm dome and left kidney were measured from both 4D and 2D images. The same protocol was also performed on a MRI-compatible motion phantom where the motion was programmed with different amplitude (10–30mm) and frequency (3–10/min). Results: High resolution 4D-MRI were obtained successfully in 5 minutes. Quantitative motion measurements from 4D-MRI agree with the ones from 2D CINE (<5% error). The 4D images are free of the stitching artifacts and their near-isotropic resolution facilitates 3D visualization and segmentation of abdominal organs such as the liver, kidney and pancreas. Conclusion: Our preliminary studies demonstrated a novel ROCK 4D-MRI technique with true 3D k-space encoding and respiratory motion self-gating. The technique leads to high-resolution and artifacts-free 4D images for improved abdominal organ motion studies. K.S acknowledges funding support from NIH R01CA188300.

60 APPLIED LIFE SCIENCES↗

Non-Cartesian Coordinate Systems in the Portage Library

In order to be more broadly useful, the Portage framework needs to be able to support non-Cartesian coordinate systems. This document will lay out the most important details of implementing non-Cartesian coordinate systems in Portage. The most immediate need for this feature is integration with the EAP code base. Towards that end, the focus will be on certain curvilinear coordinate systems. However, this will provide a framework that can be used to implement other coordinate systems.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

Solution of the Skyrme-Hartree–Fock–Bogolyubov equations in the Cartesian deformed harmonic-oscillator basis. (VIII) HFODD (v2.73y): A new version of the program

Here, we describe the new version (v2.73y) 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 the following new features: (i) full proton–neutron mixing in the particle–hole channel for Skyrme functionals, (ii) the Gogny force in both particle–hole and particle–particle channels, (iii) linear multi-constraint method at finite temperature, (iv) fission toolkit including the constraint on the number of particles in the neck between two fragments, calculation of the interaction energy between fragments, and calculation of the nuclear and Coulomb energy of each fragment, (v) the new version 200d of the code hfbtho, together with an enhanced interface between HFBTHO and HFODD, (vi) parallel capabilities, significantly extended by adding several restart options for large-scale jobs, (vii) the Lipkin translational energy correction method with pairing, (viii) higher-order Lipkin particle-number corrections, (ix) interface to a program plotting single-particle energies or Routhians, (x) strong-force isospin-symmetry-breaking terms, and (xi) the Augmented Lagrangian Method for calculations with 3D constraints on angular momentum and isospin. Finally, an important bug related to the calculation of the entropy at finite temperature and several other little significant errors of the previous published version were corrected.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Tensor decomposition in electronic structure calculations on 3D Cartesian grids

In this paper, we investigate a novel approach based on the combination of Tucker-type and canonical tensor decomposition techniques for the efficient numerical approximation of functions and operators in electronic structure calculations. In particular, we study applicability of tensor approximations for the numerical solution of Hartree-Fock and Kohn-Sham equations on 3D Cartesian grids. We show that the orthogonal Tucker-type tensor approximation of electron density and Hartree potential of simple molecules leads to low tensor rank representations. This enables an efficient tensor-product convolution scheme for the computation of the Hartree potential using a collocation-type approximation via piecewise constant basis functions on a uniform nxnxn grid. Combined with the Richardson extrapolation, our approach exhibits O(h{sup 3}) convergence in the grid-size h=O(n{sup -1}). Moreover, this requires O(3rn+r{sup 3}) storage, where r denotes the Tucker rank of the electron density with r=O(logn), almost uniformly in n. For example, calculations of the Coulomb matrix and the Hartree-Fock energy for the CH{sub 4} molecule, with a pseudopotential on the C atom, achieved accuracies of the order of 10{sup -6} hartree with a grid-size n of several hundreds. Since the tensor-product convolution in 3D is performed via 1D convolution transforms, our scheme markedly outperforms the 3D-FFT in both the computing time and storage requirements.

74 ATOMIC AND MOLECULAR PHYSICS↗