Search NASA⌕ Search

SEARCH · Search NASA

Results for “Regular Grid”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Fully elliptic incompressible flow calculations on regular grid by a new pressure substitution method

A new method is presented for the solution of incompressible flow in generalized coordinates. This method is based on the substitution of the pressure weighted form of the momentum equations into the continuity equation. The algorithm is rigorously derived and a Fourier analysis is used to assess its suitability to act as an error smoother. Linear stability analysis results indicate that the performance of the new pressure substitution method (PSM) and the pressure correction method (PCM) is about the same at low Reynolds numbers, with no significant pressure gradient. At high Reynolds numbers the PSM shows much faster convergence. Likewise prediction of various flows indicate that the PSM has better accuracy for high Reynolds number flows with significant pressure gradients. Since most practical aerodynamic flows have significant pressure gradients, the PSM seems to be attractive for such flows. Solutions for both laminar and turbulent flow are compared with the experimental data. A two-equation low Reynolds number turbulence model is used to resolve the turbulent flowfield.

Hobson, G. V.↗
DOE OSTI2022

New large-strain FFT-based formulation and its application to model strain localization in nano-metallic laminates and other strongly anisotropic crystalline materials

This paper presents a new robust large-strain (LS) elasto-viscoplastic (EVP) formulation based on Fast Fourier Transforms (FFTs) for the prediction of the micro-mechanical response and microstructure evolution of polycrystalline and multiphase materials, with emphasis on the effect of strong crystallographic and/or morphologic anisotropy on localization of plastic deformation. In this work, the novel LS-EVPFFT formulation allows treatment of complex initial geometries and large deformations considering three grids of material points: a regular grid in the reference configuration, where FFTs can be performed; an irregular grid in the initial configuration, created by applying a stress-free displacement field to the reference regular grid; and an irregular grid in the current configuration, undergoing large strains and rotations as the material is loaded. Further numerical stability of the new formulation also required the use of a novel expression for the discrete modified Green’s operator, which reduces spurious field oscillations. After presenting and validating the new formulation by comparison with preexisting implementations and analytical solutions, LS-EVPFFT is applied to the prediction of slip and kink bands formation in polycrystalline columnar ice, and kink bands in single crystal zinc wires, showing good agreement with classic experiments. Finally, the model is used to study kink band formation during compression of Cu–Nb nano-metallic laminates (NMLs), in which accurate treatment of the complex geometry associated with the tortuosity of interfaces and large deformations become critical, showing consistency with corresponding micropillar experiments.

36 MATERIALS SCIENCE↗
NASA NTRS2010

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗
DOE OSTI2020

A Hybrid Lagrangian/Eulerian Collocated Velocity Advection and Projection Method for Fluid Simulation

Abstract We present a hybrid particle/grid approach for simulating incompressible fluids on collocated velocity grids. Our approach supports both particle‐based Lagrangian advection in very detailed regions of the flow and efficient Eulerian grid‐based advection in other regions of the flow. A novel Backward Semi‐Lagrangian method is derived to improve accuracy of grid based advection. Our approach utilizes the implicit formula associated with solutions of the inviscid Burgers’ equation. We solve this equation using Newton's method enabled by C 1 continuous grid interpolation. We enforce incompressibility over collocated, rather than staggered grids. Our projection technique is variational and designed for B‐spline interpolation over regular grids where multiquadratic interpolation is used for velocity and multilinear interpolation for pressure. Despite our use of regular grids, we extend the variational technique to allow for cut‐cell definition of irregular flow domains for both Dirichlet and free surface boundary conditions.

Gagniere, S.↗
DOE OSTI2023

Improving the representation of isopycnal mixing in E3SM (Final Report)

The DOE-supported Energy Exascale Earth System Model (E3SM) is a major attempt by the Department of Energy to develop a new Earth System Model using unstructured grids, which allow for the model to concentrate resolution where it is most needed and avoid numerical artifacts experienced by previous Earth System Models (ESMs) using regular grids in which the lateral resolution becomes extremely fine as the resolution shrinks at the poles. This effort required rewriting many of the algorithms previously developed for regular grids. One algorithm that was problematic in the first version of E3SM was the representation of mixing due to turbulent ocean eddies with scales smaller than the model grid. These mesoscale eddies are the primary way by which tracers are stirred along density surfaces in the ocean interior. In particular, the process of isopycnal mixing exchanges fresher, more oxygenated waters from polar regions with saltier, nutrient-rich and oxygen poor waters from tropical regions. Previous work in our group has shown that this mechanism is vitally important for bringing oxygen into poorly ventilated tropical regions (Gnanadesikan et al., 2012, 2013) and plays a significant role in determining the uptake of anthropogenic carbon dioxide (Gnanadesikan et al., 2015). However, in E3SMv1 this process was turned off, as turning it on caused the model to become unstable. Additionally, the rate of isopycnal mixing is directly proportional to a mixing coefficient $A_{Redi}$ whose value varies from less than 400 m 2 /s to 2000 m 2 /s across contemporary climate models. The main thrusts of this proposal therefore were to: 1.) Improve the numerics of isopycnal mixing in E3SM; 2.) Identify ways in which climate models are sensitive to the isopycnal mixing coefficient; and 3.) Develop better representations of the isopycnal mixing coefficient.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2011

Deep Moonquake Focal Mechanisms: Recovery and Implications

A defining characteristic of deep moonquakes is their tendency to occur with tidal periodicity, prompting previous studies to infer that they are related to the buildup and release of tidal stress within the Moon. In studies of tidal forcing, a key constraint is the focal mechanism: the fault parameters describing the type of failure moonquakes represent. The quality of the lunar seismic data and the limited source/receiver geometries of the Apollo seismic network prohibit the determination of deep moonquake fault parameters using first-motion polarities, as is typically done in terrestrial seismology. Without being able to resolve tidal stress onto a known failure plane, we can examine only gross qualities of the tidal stress tensor with respect to moonquake occurrence, so we cannot fully address the role of tidal stress in moonquake generation. We will examine the extent to which shear (S) and compression (P) wave amplitude ratios can constrain moonquake fault geometry by determining whether, for a given cluster, there exists a focal mechanism that can produce a radiation pattern consistent with the amplitudes measured by the Apollo instruments. Amplitudes are read in the ray coordinate frame, directly from seismograms for which the P and S arrivals are clearly identifiable on all long-period channels of the four Apollo stations. We apply an empirical station correction to account for site effects and the differences between P- and S-wave attenuation. Instead of focusing on the best fitting solution only, we formulate the inverse problem using a falsification criterion: all source orientations that do not reproduce the observed SV/P ratios within an error margin derived from the uncertainty of amplitude readings are rejected. All others are accepted as possible solutions. The inversion is carried out using an exhaustive grid search on a regular grid with predefined step size, encompassing all possible combinations of strike, dip and slip. To assess the sensitivity of the inversion for the uncertainty of the lunar interior structure, we carry out repeated inversions with different velocity structures. Our data set consist of a total of 106 events from 25 deep moonquake clusters. The largest contribution of 37 events originates from the most active cluster, A001, while other clusters are represented by 1 to 9 events. Since the definition of a cluster implies that all events share the same source orientation, a comparison of the inversion results of all events from one cluster will reduce ambiguities of the inversion. Once we obtain a suite of fault parameters for a given source, we can attempt to further constrain the focal mechanism with refined analyses of tidal stresses and predictions based on synthetic seismograms.

Knapmeyer, Martin↗
NASA NTRS1985

Multivariate Spline Algorithms for CAGD

Two special polyhedra present themselves for the definition of B-splines: a simplex S and a box or parallelepiped B, where the edges of S project into an irregular grid, while the edges of B project into the edges of a regular grid. More general splines may be found by forming linear combinations of these B-splines, where the three-dimensional coefficients are called the spline control points. Univariate splines are simplex splines, where s = 1, whereas splines over a regular triangular grid are box splines, where s = 2. Two simple facts render the development of the construction of B-splines: (1) any face of a simplex or a box is again a simplex or box but of lower dimension; and (2) any simplex or box can be easily subdivided into smaller simplices or boxes. The first fact gives a geometric approach to Mansfield-like recursion formulas that express a B-spline in B-splines of lower order, where the coefficients depend on x. By repeated recursion, the B-spline will be expressed as B-splines of order 1; i.e., piecewise constants. In the case of a simplex spline, the second fact gives a so-called insertion algorithm that constructs the new control points if an additional knot is inserted.

Boehm, W.↗
NASA NTRS2009

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes - Part 1

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and efficiency are studied for six nominally second-order accurate schemes: a node-centered scheme, cell-centered node-averaging schemes with and without clipping, and cell-centered schemes with unweighted, weighted, and approximately mapped least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Results from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The second class of tests are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes are less accurate, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to the complexity of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping of the surface anisotropy or modifying the scheme stencil to reflect the direction of strong coupling.

Diskin, Boris↗
NASA NTRS2010

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and complexity are studied for four nominally second-order accurate schemes: a node-centered scheme and three cell-centered schemes - a node-averaging scheme and two schemes with nearest-neighbor and adaptive compact stencils for least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Tests from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The tests of the second class are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes may degenerate on mixed grids, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to that of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping based on a distance function commonly available in practical schemes or modifying the scheme stencil to reflect the direction of strong coupling. The major conclusion is that accuracies of the node centered and the best cell-centered schemes are comparable at equivalent number of degrees of freedom.

Diskin, Boris↗
NASA NTRS1997

Rapid Decimation for Direct Volume Rendering

An approach for eliminating unnecessary portions of a volume when producing a direct volume rendering is described. This reduction in volume size sacrifices some image quality in the interest of rendering speed. Since volume visualization is often used as an exploratory visualization technique, it is important to reduce rendering times, so the user can effectively explore the volume. The methods presented can speed up rendering by factors of 2 to 3 with minor image degradation. A family of decimation algorithms to reduce the number of primitives in the volume without altering the volume's grid in any way is introduced. This allows the decimation to be computed rapidly, making it easier to change decimation levels on the fly. Further, because very little extra space is required, this method is suitable for the very large volumes that are becoming common. The method is also grid-independent, so it is suitable for multiple overlapping curvilinear and unstructured, as well as regular, grids. The decimation process can proceed automatically, or can be guided by the user so that important regions of the volume are decimated less than unimportant regions. A formal error measure is described based on a three-dimensional analog of the Radon transform. Decimation methods are evaluated based on this metric and on direct comparison with reference images.

Gibbs, Jonathan↗
NASA NTRS1990

Stable boundary conditions for Cartesian grid calculations

The inviscid Euler equations in complicated geometries are solved using a Cartesian grid. This requires solid wall boundary conditions in the irregular grid cells near the boundary. Since these cells may be orders of magnitude smaller than the regular grid cells, stability is a primary concern. An approach to this problem is presented and its use is illustrated.

Berger, M. J.↗
NASA NTRS1990

Stable boundary conditions for Cartesian grid calculations

The inviscid Euler equations in complicated geometries are solved using a Cartesian grid. This requires solid wall boundary conditions in the irregular grid cells near the boundary. Since these cells may be orders of magnitude smaller than the regular grid cells, stability is a primary concern. An approach to this problem is presented and its use is illustrated.

Berger, M. J.↗
DOE OSTI2022

Volumetric Rendering on Wavelet-Based Adaptive Grid

Numerical modeling of physical phenomena frequently involves processes across a wide range of spatial and temporal scales. In the last two decades, the advancements in wavelet-based numerical methodologies to solve partial differential equations, combined with the unique properties of wavelet analysis to resolve localized structures of the solution on dynamically adaptive computational meshes, make it feasible to perform large-scale numerical simulations of a variety of physical systems on a dynamically adaptive computational mesh that changes both in space and time. Volumetric visualization of the solution is an essential part of scientific computing, yet the existing volumetric visualization techniques do not take full advantage of multi-resolution wavelet analysis and are not fully tailored for visualization of a compressed solution on the wavelet-based adaptive computational mesh. Our objective is to explore the alternatives for the visualization of time-dependent data on space-time varying adaptive mesh using volume rendering while capitalizing on the available sparse data representation. Two alternative formulations are explored. The first one is based on volumetric ray casting of multi-scale datasets in wavelet space. Rather than working with the wavelets at the finest possible resolution, a partial inverse wavelet transform is performed as a preprocessing step to obtain scaling functions on a uniform grid at a user-prescribed resolution. As a result, a solution in physical space is represented by a superposition of scaling functions on a coarse regular grid and wavelets on an adaptive mesh. An efficient and accurate ray casting algorithm is based just on these coarse scaling functions. Additional details are added during the ray tracing by taking an appropriate number of wavelets into account based on support overlap with the interpolation point, wavelet coefficient magnitude, and other characteristics, such as opacity accumulation (front to back ordering) and deviation from frontal viewing direction. The second approach is based on complementing of wavelet-based adaptive mesh to the traditional Adaptive Mesh Refinement (AMR) mesh. Both algorithms are illustrated and compared to the existing volume visualization software for Rayleigh-Benard thermal convection and electron density data sets in terms of rendering time and visual quality for different data compression of both wavelet-based and AMR adaptive meshes.

Vezolainen, Alexei V.↗
NASA NTRS1987

Quantitative use of satellite SAR imagery of sea ice

An automatic technique to obtain ice motion based on maximizing cross-correlation and employing a strategy of nested calculations has been developed and used to obtain displacements of more than 2000 tie-points on a 2 km mesh grid. The mean displacement error is 250 m and is as low as manual data error of 150 m on rigid pieces. The method allows tie-points to be found on a regular grid in a fully automatic fashion. Full resolution data are not needed to maximize the accuracy of displacement measurements, a result which is significant for SAR images, with their large amounts of data.

Fily, M.↗
DOE OSTI2025

Achieving geometric accuracy in FFT-based micromechanical models using conformal grid

Owing to its efficiency, simplicity and robustness, the FFT-based method has become the standard for computation of mechanical fields in a heterogeneous periodic unit cell. One of the main disadvantages of the FFT-based method is the inaccurate representation of the initial microstructure on a regular grid of voxels, which can be alleviated through the use of distorted initial grids. Here, in this paper, a method for generation of distorted initial grids conforming to the microstructural features (e.g. straight/curved boundaries) is proposed. The method determines the positions of the grid nodes in the initial configuration by solving a system of springs connecting the nodes. Microstructures consisting of layers, Voronoi tessellation and circular/spherical inclusions are considered, and mechanical fields simulated using the FFT-based method. It is found that distorted initial grids, conforming to the microstructural features, lead to more accurate mechanical fields in comparison to the corresponding non-distorted initial grid solution. The effect of initial grid distortion on the convergence of the FFT-based method is analyzed and discussed.

36 MATERIALS SCIENCE↗
NASA NTRS2018

GMI-IPS: Python Processing Software for Aircraft Campaigns

NASA's Atmospheric Tomography Mission (ATom) seeks to understand the impact of anthropogenic air pollution on gases in the Earth's atmosphere. Four flight campaigns are being deployed on a seasonal basis to establish a continuous global-scale data set intended to improve the representation of chemically reactive gases in global atmospheric chemistry models. The Global Modeling Initiative (GMI), is creating chemical transport simulations on a global scale for each of the ATom flight campaigns. To meet the computational demands required to translate the GMI simulation data to grids associated with the flights from the ATom campaigns, the GMI ICARTT Processing Software (GMI-IPS) has been developed and is providing key functionality for data processing and analysis in this ongoing effort. The GMI-IPS is written in Python and provides computational kernels for data interpolation and visualization tasks on GMI simulation data. A key feature of the GMI-IPS, is its ability to read ICARTT files, a text-based file format for airborne instrument data, and extract the required flight information that defines regional and temporal grid parameters associated with an ATom flight. Perhaps most importantly, the GMI-IPS creates ICARTT files containing GMI simulated data, which are used in collaboration with ATom instrument teams and other modeling groups. The initial main task of the GMI-IPS is to interpolate GMI model data to the finer temporal resolution (1-10 seconds) of a given flight. The model data includes basic fields such as temperature and pressure, but the main focus of this effort is to provide species concentrations of chemical gases for ATom flights. The software, which uses parallel computation techniques for data intensive tasks, linearly interpolates each of the model fields to the time resolution of the flight. The temporally interpolated data is then saved to disk, and is used to create additional derived quantities. In order to translate the GMI model data to the spatial grid of the flight path as defined by the pressure, latitude, and longitude points at each flight time record, a weighted average is then calculated from the nearest neighbors in two dimensions (latitude, longitude). Using SciPya's Regular Grid Interpolator, interpolation functions are generated for the GMI model grid and the calculated weighted averages. The flight path points are then extracted from the ATom ICARTT instrument file, and are sent to the multi-dimensional interpolating functions to generate GMI field quantities along the spatial path of the flight. The interpolated field quantities are then written to a ICARTT data file, which is stored for further manipulation. The GMI-IPS is aware of a generic ATom ICARTT header format, containing basic information for all flight campaigns. The GMI-IPS includes logic to edit metadata for the derived field quantities, as well as modify the generic header data such as processing dates and associated instrument files. The ICARTT interpolated data is then appended to the modified header data, and the ICARTT processing is complete for the given flight and ready for collaboration. The output ICARTT data adheres to the ICARTT file format standards V1.1. The visualization component of the GMI-IPS uses Matplotlib extensively and has several functions ranging in complexity. First, it creates a model background curtain for the flight (time versus model eta levels) with the interpolated flight data superimposed on the curtain. Secondly, it creates a time-series plot of the interpolated flight data. Lastly, the visualization component creates averaged 2D model slices (longitude versus latitude) with overlaid flight track circles at key pressure levels. The GMI-IPS consists of a handful of classes and supporting functionality that have been generalized to be compatible with any ICARTT file that adheres to the base class definition. The base class represents a generic ICARTT entry, only defining a single time entry and 3D spatial positioning parameters. Other classes inherit from this base class; several classes for input ICARTT instrument files, which contain the necessary flight positioning information as a basis for data processing, as well as other classes for output ICARTT files, which contain the interpolated model data. Utility classes provide functionality for routine procedures such as: comparing field names among ICARTT files, reading ICARTT entries from a data file and storing them in data structures, and returning a reduced spatial grid based on a collection of ICARTT entries. Although the GMI-IPS is compatible with GMI model data, it can be adapted with reasonable effort for any simulation that creates Hierarchical Data Format (HDF) files. The same can be said of its adaptability to ICARTT files outside of the context of the ATom mission. The GMI-IPS contains just under 30,000 lines of code, eight classes, and a dozen drivers and utility programs. It is maintained with GIT source code management and has been used to deliver processed GMI model data for the ATom campaigns that have taken place to date.

Damon, M. R.↗