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.↗
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↗
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.↗
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.↗
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.↗
NASA NTRS2012

Projections of Declining Surface-Water Availability for the Southwestern United States

16 of the CMIP5 models had all the data needed for this work for at least one simulation that was continuous from 1950 to 2040. Details of the models analyzed here are provided in Table S1. The model data analyzed here are available at http://strega.ldeo.columbia.edu:81/expert/home/.naomi/.AR5/.v2/.historical:rcp85/.mmm16/ a. Assessing the climatology of the models Despite increases in horizontal resolution of many models compared to their CMIP3 counterparts none of these models can adequately resolve the topography of the south west United States, such as the Sierra Nevada and Rocky Mountains and the associated orographic precipitation. This requires that caution be used when interpreting the results presented here. To assess the ability of the models to simulate the current hydroclimate, in Figure S1 we show the observed (from the Global Precipitation Climatology Centre gridded rain gauge data, (1)) monthly climatology of precipitation and the same for all the models and the multimodel mean for the California-Nevada, Colorado headwaters and Texas regions. The GPCC data uses rain gauges only and interpolates to regular grids of which we used the 1◦ by 1◦ one. Details of the data set can be found in (2). While the models apparently overestimate precipitation in California and Nevada the seasonal cycle with wet winters and dry summers is very well represented. It is also possible that the rain gauge observations are biased low by inadequately sampling the higher mountain regions. How ever the models might also be expected to underestimate orographic precipitation due to inadequate horizontal resolution. The 25 models are also too wet in the Colorado headwaters region but correctly represent the quite even distribution though the year. The bimodal distribution of precipitation in Texas, with peaks in May and September, and the absolute amounts, are well modeled but with the September peak too weak. The positive precipitation bias translates into a positive runoff bias for the Colorado headwaters as also shown in Figure S1. Here the observed runoff values are taken from simulations of the Variable Infiltration Capacity (VIC) land surface-hydrology model (3) forced by observed meteorology (5) that were conducted as part of the North American Land Data Assimilation System project phase 2 ( (NLDAS-2), http://www.emc.ncep.noaa.gov/mmb/nldas/. Runoff for California-Nevada is better simulated but there is a positive bias over Texas despite no strong precipitation bias. To check whether regional climate models better simulate P and runoff in these regions we analyzed the historical simulation with the Regional Climate Model version 3 driven by the National Centers for Environmental Prediction-Department of Energy Reanalysis 2 available from the North American Regional Climate Change Assessment Program (http://www.narccap.ucar.edu). This model configuration retained these biases in P and runoff although they were reduced in amplitude. Given these varying biases we plot P and P − E changes in actual values but apply the simplest bias correction possible to the runoff and soil moisture values and show the modeled changes in terms of percentages of the 20th Century model climatologies. A thorough assessment of the simulation of North American climate in CMIP5 models is conducted in Sheffield at al. (North American Climate in CMIP5 Experiments. Part I: Evaluation of 20th Century Continental and Regional Climatology, manuscript submit ted to J. Climate, available at http://www.climate.noaa.gov/index.jsp?pg=./cpo pa/ mapp/cmip5 publications.html). Sheffield et al. analyze the climatology of precipitation, surface air temperature, low level winds, moisture fluxes, runoff etc. and conclude that the main features of the hydrological cycle, including characteristics of the atmospheric moisture balance and its seasonality, are captured in the CMP5 models subject to biases in total precipitation amounts. We chose to use all available models instead of selecting some and rejecting others based on an assessment of model realism. This is in accord with the suggestions of Mote et al. for CMIP3 (4) but future work needs to revisit this matter for the case of the CMIP5 ensemble.

Seager, Richard↗
NASA NTRS1989

Surface topography of the Greenland Ice Sheet from satellite radar altimetry

Surface elevation maps of the southern half of the Greenland subcontinent are produced from radar altimeter data acquired by the Seasat satellite. A summary of the processing procedure and examples of return waveform data are given. The elevation data are used to generate a regular grid which is then computer contoured to provide an elevation contour map. Ancillary maps show the statistical quality of the elevation data and various characteristics of the surface. The elevation map is used to define ice flow directions and delineate the major drainage basins. Regular maps of the Jakobshavns Glacier drainage basin and the ice divide in the vicinity of Crete Station are presented. Altimeter derived elevations are compared with elevations measured both by satellite geoceivers and optical surveying.

Bindschadler, Robert A.↗
NASA NTRS1982

C-1 surface interpolation for scattered data on a sphere

An algorithm is described for constructing a smooth computable function, f, defined over the surface of a sphere and interpolating a set of n data values, u sub i, associated with n locations, P sub i, on the surface of the sphere. The interpolation function, f, will be continuous and have continuous first partial derivatives. The locations, p sub i, are not required to lie on any type of regular grid.

Lawson, C. L.↗
NASA NTRS1983

Finite element approximations in transient analysis

Alternative techniques for finite element models for transient analyses are explored, using as an example a pinned-pinned beam. Attention is given to the relationships between desired accuracy and the available computer resources. Stiffness, mass, damping, and loading components approximations are examined with note taken of optimization methods. Generation of regular grid results indicates a linear relationship between the number of elements or degrees of freedom and the number of eigenvalues for a given accuracy. Comparisons of the finite element models in terms of accuracy/element or accuracy/degree of freedom were found to be inaccurate for determining model efficiency. Higher accuracies were available from lumped mass and damping models than assumptions of consistent loading, which was preferred to statically equivalent loading.

Melosh, R. J.↗
NASA NTRS1984

Finite element computation on nearest neighbor connected machines

Research aimed at faster, more cost effective parallel machines and algorithms for improving designer productivity with finite element computations is discussed. A set of 8 boards, containing 4 nearest neighbor connected arrays of commercially available floating point chips and substantial memory, are inserted into a commercially available machine. One-tenth Mflop (64 bit operation) processors provide an 89% efficiency when solving the equations arising in a finite element problem for a single variable regular grid of size 40 by 40 by 40. This is approximately 15 to 20 times faster than a much more expensive machine such as a VAX 11/780 used in double precision. The efficiency falls off as faster or more processors are envisaged because communication times become dominant. A novel successive overrelaxation algorithm which uses cyclic reduction in order to permit data transfer and computation to overlap in time is proposed.

Mcaulay, A. D.↗