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

Picturing Data With Uncertainty

NASA is in the business of creating maps for scientific purposes to represent important biophysical or geophysical quantities over space and time. For example, maps of surface temperature over the globe tell scientists where and when the Earth is heating up; regional maps of the greenness of vegetation tell scientists where and when plants are photosynthesizing. There is always uncertainty associated with each value in any such map due to various factors. When uncertainty is fully modeled, instead of a single value at each map location, there is a distribution expressing a set of possible outcomes at each location. We consider such distribution data as multi-valued data since it consists of a collection of values about a single variable. Thus, a multi-valued data represents both the map and its uncertainty. We have been working on ways to visualize spatial multi-valued data sets effectively for fields with regularly spaced units or grid cells such as those in NASA's Earth science applications. A new way to display distributions at multiple grid locations is to project the distributions from an individual row, column or other user-selectable straight transect from the 2D domain. First at each grid cell in a given slice (row, column or transect), we compute a smooth density estimate from the underlying data. Such a density estimate for the probability density function (PDF) is generally more useful than a histogram, which is a classic density estimate. Then, the collection of PDFs along a given slice are presented vertically above the slice and form a wall. To minimize occlusion of intersecting slices, the corresponding walls are positioned at the far edges of the boundary. The PDF wall depicts the shapes of the distributions very dearly since peaks represent the modes (or bumps) in the PDFs. We've defined roughness as the number of peaks in the distribution. Roughness is another useful summary information for multimodal distributions. The uncertainty of the multi-valued data can also be interpreted by the number of peaks and the widths of the peaks as shown by the PDF walls.

Kao, David↗

Gigatraj: An Atmospheric Trajectory Model

Atmospheric trajectory models have a long history of success in tracking air motions in the lower stratosphere and upper troposphere over periods of up to a few days. Parcels have been traced backwards from observations to identify whatever phenomena (strong convection, volcanic eruptions, rocket launches, etc.) put their signature on them. Parcels have also been initialized at a known event and traced forward to examine their subsequent physical and chemical evolution. We describe a new trajectory model, "gigatraj," that aims to increase exibility by (a) making it straightforward to use new meteorological data sources, including those not based on regular latitude-longitude grids; (b) enabling a run-time choice of vertical coordinate system for kinematic and/or quasi-isentropic calculations; (c) allowing for the output of arbitrary meteorological products, selectable by the user and interpolated to the parcels' locations and times. The model can be run in a serial or parallel processing environment, so that large numbers of parcels can be traced in a reasonable time. Information is presented on model accuracy and performance. The former is demonstrated by runs using both test-pattern winds (comparing expected paths with actual output) and real-world winds (comparing forward and backward runs to characterize how well parcels retrace their paths). Sample cases are also shown, including a reverse domain lling (RDF) calculation illustrating a tropopause fold event. Model output can be displayed using the new Visualization And Lagrangian dynamics Immersive eXtended Reality (VALIXR) system, and an example will be shown. In addition, we describe work to incorporate a version of gigatraj into the Goddard Earth Observing System (GEOS) of NASA's Global Modeling and Assimilation O ce (GMAO) at Goddard Space Flight Center. This enables trajectory calculations to be performed within the running GEOS model at the latter's native time resolution, instead of using the winds from every few hours. It also provides access to all of GEOS's internal variables as they are calculated. This module may be useful, for example, for tracking rapid chemical changes in a Lagrangian framework.

dynamics↗

Quadrature-Free Implementation of the Discontinuous Galerkin Method for Hyperbolic Equations

A discontinuous Galerkin formulation that avoids the use of discrete quadrature formulas is described and applied to linear and nonlinear test problems in one and two space dimensions. This approach requires less computational time and storage than conventional implementations but preserves the compactness and robustness inherent to the discontinuous Galerkin method. Test problems include both linear and nonlinear one-dimensional scalar advection of botH smooth and discontinuous initial value problems, two-dimensional scalar advection of smooth initial value problems discretized by using unstructured grids with varying degrees of smoothness and regularity, and two-dimensional linear Euler solutions on unstructured grids.

Atkins, H. L.↗

Small-scale fracture patterns on the volcanic plains of Venus

Linear features with a regular spacing of about 1 km in the gridded plains of Guinevere Planitia observed in Magellan radar images of Venus are examined. Many sets of parallel, regularly spaced lineations similar to the closely spaced features of the gridded plains were found. These sets of parallel lineations, which are interpreted to be fractures, typically cover areas with dimensions of hundreds of kilometers. Several examples of these regular lineations are characterized in terms of their average fracture spacing, which is between 1 and 2.5 km; the scatter in individual spacings is about +/- 1/3 the average. It is hypothesized that these features are extension fractures in the brittle upper layers of the volcanic plains material, which formed well after emplacement and solidification of the flows.

Banerdt, W. B.↗

Sea ice lead dynamics from ERS-1 SAR

The use of ERS-1 SAR (Synthetic Aperture Radar) images to measure ice lead changes and ice deformation, and thus to determine their relationships and compare them to theory, is reported. ERS-1 SAR data collected at the Alaska (U.S.) SAR facility are processed into low resolution geocoded images which are used as input to the Geophysical Processor System (GPS). The GPS uses cross correlation and edge detection on sequential pairs of images to track a regular 5 km array of grid points. The result for each sequential image pair is a field of ice displacement that contains, on average, more than 200 vectors. The GPS also classifies all the pixels of the images into one of four ice types based on the normalized backscatter coefficients and a seasonal look-up table. This allows all pixels to be labeled as either multiyear ice or as the first year ice and open water that comprise leads.

Stern, Harry L.↗

A far-field non-reflecting boundary condition for two-dimensional wake flows

Far-field boundary conditions for external flow problems have been developed based upon long-wave perturbations of linearized flow equations about a steady state far field solution. The boundary improves convergence to steady state in single-grid temporal integration schemes using both regular-time-stepping and local-time-stepping. The far-field boundary may be near the trailing edge of the body which significantly reduces the number of grid points, and therefore the computational time, in the numerical calculation. In addition the solution produced is smoother in the far-field than when using extrapolation conditions. The boundary condition maintains the convergence rate to steady state in schemes utilizing multigrid acceleration.

Danowitz, Jeffrey S.↗

Mascons, GRACE, and Time-variable Gravity

The GRACE mission has been in orbit now for three years and now regularly produces snapshots of the Earth s gravity field on a monthly basis. The convenient standard approach has been to perform global solutions in spherical harmonics. Alternative local representations of mass variations using mascons show great promise and offer advantages in terms of computational efficiency, minimization of problems due to aliasing, and increased temporal resolution. In this paper, we discuss the results of processing the GRACE KBRR data from March 2003 through August 2005 to produce solutions for GRACE mass variations over mid-latitude and equatorial regions, such as South America, India and the United States, and over the polar regions (Antarctica and Greenland), with a focus on the methodology. We describe in particular mascon solutions developed on regular 4 degree x 4 degree grids, and those tailored specifically to drainage basins over these regions.

Lemoine, F.↗

Using MERRA Gridded Innovations for Quantifying Uncertainties in Analysis Fields and Diagnosing Observing System Inhomogeneities

MERRA is a NASA reanalysis for the satellite era using a major new version of the Goddard Earth Observing System Data Assimilation System Version 5 (GEOS-5). The project focuses on historical analyses of the hydrological cycle on a broad range of weather and climate time scales and places the NASA EOS suite of observations in a climate context. The characterization of uncertainty in reanalysis fields is a commonly requested feature by users of such data. While intercomparison with reference data sets is common practice for ascertaining the realism of the datasets, such studies typically are restricted to long term climatological statistics and seldom provide state dependent measures of the uncertainties involved. In principle, variational data assimilation algorithms have the ability of producing error estimates for the analysis variables (typically surface pressure, winds, temperature, moisture and ozone) consistent with the assumed background and observation error statistics. However, these "perceived error estimates" are expensive to obtain and are limited by the somewhat simplistic errors assumed in the algorithm. The observation minus forecast residuals (innovations) by-product of any assimilation system constitutes a powerful tool for estimating the systematic and random errors in the analysis fields. Unfortunately, such data is usually not readily available with reanalysis products, often requiring the tedious decoding of large datasets and not so-user friendly file formats. With MERRA we have introduced a gridded version of the observations/innovations used in the assimilation process, using the same grid and data formats as the regular datasets. Such dataset empowers the user with the ability of conveniently performing observing system related analysis and error estimates. The scope of this dataset will be briefly described. We will present a systematic analysis of MERRA innovation time series for the conventional observing system, including maximum-likelihood estimates of background and observation errors, as well as global bias estimates. Starting with the joint PDF of innovations and analysis increments at observation locations we propose a technique for diagnosing bias among the observing systems, and document how these contextual biases have evolved during the satellite era covered by MERRA.

da Silva, Arlindo↗

Artificial intelligence approach to planning the robotic assembly of large tetrahedral truss structures

An assembly planner for tetrahedral truss structures is presented. To overcome the difficulties due to the large number of parts, the planner exploits the simplicity and uniformity of the shapes of the parts and the regularity of their interconnection. The planning automation is based on the computational formalism known as production system. The global data base consists of a hexagonal grid representation of the truss structure. This representation captures the regularity of tetrahedral truss structures and their multiple hierarchies. It maps into quadratic grids and can be implemented in a computer by using a two-dimensional array data structure. By maintaining the multiple hierarchies explicitly in the model, the choice of a particular hierarchy is only made when needed, thus allowing a more informed decision. Furthermore, testing the preconditions of the production rules is simple because the patterned way in which the struts are interconnected is incorporated into the topology of the hexagonal grid. A directed graph representation of assembly sequences allows the use of both graph search and backtracking control strategies.

Homemdemello, Luiz S.↗

Software for Refining or Coarsening Computational Grids

A computer program performs calculations for refinement or coarsening of computational grids of the type called 'structured' (signifying that they are geometrically regular and/or are specified by relatively simple algebraic expressions). This program is designed to facilitate analysis of the numerical effects of changing structured grids utilized in computational fluid dynamics (CFD) software. Unlike prior grid-refinement and -coarsening programs, this program is not limited to doubling or halving: the user can specify any refinement or coarsening ratio, which can have a noninteger value. In addition to this ratio, the program accepts, as input, a grid file and the associated restart file, which is basically a file containing the most recent iteration of flow-field variables computed on the grid. The program then refines or coarsens the grid as specified, while maintaining the geometry and the stretching characteristics of the original grid. The program can interpolate from the input restart file to create a restart file for the refined or coarsened grid. The program provides a graphical user interface that facilitates the entry of input data for the grid-generation and restart-interpolation routines.

Daines, Russell↗

Software for Refining or Coarsening Computational Grids

A computer program performs calculations for refinement or coarsening of computational grids of the type called "structured" (signifying that they are geometrically regular and/or are specified by relatively simple algebraic expressions). This program is designed to facilitate analysis of the numerical effects of changing structured grids utilized in computational fluid dynamics (CFD) software. Unlike prior grid-refinement and -coarsening programs, this program is not limited to doubling or halving: the user can specify any refinement or coarsening ratio, which can have a noninteger value. In addition to this ratio, the program accepts, as input, a grid file and the associated restart file, which is basically a file containing the most recent iteration of flow-field variables computed on the grid. The program then refines or coarsens the grid as specified, while maintaining the geometry and the stretching characteristics of the original grid. The program can interpolate from the input restart file to create a restart file for the refined or coarsened grid. The program provides a graphical user interface that facilitates the entry of input data for the grid-generation and restart-interpolation routines.

Daines, Russell↗

Software for Refining or Coarsening Computational Grids

A computer program performs calculations for refinement or coarsening of computational grids of the type called structured (signifying that they are geometrically regular and/or are specified by relatively simple algebraic expressions). This program is designed to facilitate analysis of the numerical effects of changing structured grids utilized in computational fluid dynamics (CFD) software. Unlike prior grid-refinement and -coarsening programs, this program is not limited to doubling or halving: the user can specify any refinement or coarsening ratio, which can have a noninteger value. In addition to this ratio, the program accepts, as input, a grid file and the associated restart file, which is basically a file containing the most recent iteration of flow-field variables computed on the grid. The program then refines or coarsens the grid as specified, while maintaining the geometry and the stretching characteristics of the original grid. The program can interpolate from the input restart file to create a restart file for the refined or coarsened grid. The program provides a graphical user interface that facilitates the entry of input data for the grid-generation and restart-interpolation routines.

Daines, Russell↗

Octree based automatic meshing from CSG models

Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is emphasized. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary respresentation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractors. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.

Perucchio, Renato↗

Geometrical and topological issues in octree based automatic meshing

Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is discussed. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary representation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractor. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.

Saxena, Mukul↗

A New Method for Accurate Treatment of Flow Equations in Cylindrical Coordinates Using Series Expansions

The motivation of this work is the ongoing effort at the Center for Turbulence Research (CTR) to use large eddy simulation (LES) techniques to calculate the noise radiated by jet engines. The focus on engine exhaust noise reduction is motivated by the fact that a significant reduction has been achieved over the last decade on the other main sources of acoustic emissions of jet engines, such as the fan and turbomachinery noise, which gives increased priority to jet noise. To be able to propose methods to reduce the jet noise based on results of numerical simulations, one first has to be able to accurately predict the spatio-temporal distribution of the noise sources in the jet. Though a great deal of understanding of the fundamental turbulence mechanisms in high-speed jets was obtained from direct numerical simulations (DNS) at low Reynolds numbers, LES seems to be the only realistic available tool to obtain the necessary near-field information that is required to estimate the acoustic radiation of the turbulent compressible engine exhaust jets. The quality of jet-noise predictions is determined by the accuracy of the numerical method that has to capture the wide range of pressure fluctuations associated with the turbulence in the jet and with the resulting radiated noise, and by the boundary condition treatment and the quality of the mesh. Higher Reynolds numbers and coarser grids put in turn a higher burden on the robustness and accuracy of the numerical method used in this kind of jet LES simulations. As these calculations are often done in cylindrical coordinates, one of the most important requirements for the numerical method is to provide a flow solution that is not contaminated by numerical artifacts. The coordinate singularity is known to be a source of such artifacts. In the present work we use 6th order Pade schemes in the non-periodic directions to discretize the full compressible flow equations. It turns out that the quality of jet-noise predictions using these schemes is especially sensitive to the type of equation treatment at the singularity axis. The objective of this work is to develop a generally applicable numerical method for treating the singularities present at the polar axis, which is particularly suitable for highly accurate finite-differences schemes (e.g., Pade schemes) on non-staggered grids. The main idea is to reinterpret the regularity conditions developed in the context of pseudo-spectral methods. A set of exact equations at the singularity axis is derived using the appropriate series expansions for the variables in the original set of equations. The present treatment of the equations preserves the same level of accuracy as for the interior scheme. We also want to point out the wider utility of the method, proposed here in the context of compressible flow equations, as its extension for incompressible flows or for any other set of equations that are solved on a non-staggered mesh in cylindrical coordinates with finite-differences schemes of various level of accuracy is straightforward. The robustness and accuracy of the proposed technique is assessed by comparing results from simulations of laminar forced-jets and turbulent compressible jets using LES with similar calculations in which the equations are solved in Cartesian coordinates at the polar axis, or in which the singularity is removed by employing a staggered mesh in the radial direction without a mesh point at r = 0.

Constantinescu, G.S.↗

Effects of Mesh Irregularities on Accuracy of Finite-Volume Discretization Schemes

The effects of mesh irregularities on accuracy of unstructured node-centered finite-volume discretizations are considered. The focus is on an edge-based approach that uses unweighted least-squares gradient reconstruction with a quadratic fit. For inviscid fluxes, the discretization is nominally third order accurate on general triangular meshes. For viscous fluxes, the scheme is an average-least-squares formulation that is nominally second order accurate and contrasted with a common Green-Gauss discretization scheme. Gradient errors, truncation errors, and discretization errors are separately studied according to a previously introduced comprehensive methodology. The methodology considers three classes of grids: isotropic grids in a rectangular geometry, anisotropic grids typical of adapted grids, and anisotropic grids over a curved surface typical of advancing layer grids. The meshes within the classes range from regular to extremely irregular including meshes with random perturbation of nodes. Recommendations are made concerning the discretization schemes that are expected to be least sensitive to mesh irregularities in applications to turbulent flows in complex geometries.

Diskin, Boris↗

Wargaming in Both Rectilinear and Hexagonal Spaces

There are two main approaches to managing wargame entity interactions (movement, line of sight, area of effect, etc) freespace and gridded In the freespace approach, the units exist as entities in a continuous volume of (usually) Cartesian 3D space. They move in any direction (based on interaction with "terrain" that occupies the same space) and interact with each other based on references and displacements from their position in that space. In the gridded approach, space is broken up into (usually regular) shaped pieces. Units are considered to occupy the entire volume of one of these pieces, movement, line of sight, and other interactions are based on the relationships among the spaces rather than the absolute positions of the units themselves. Both approaches have advantages and drawbacks. The general issue that this discussion has addressed is that there is no "perfect" approach to implementing a wargaming battlespace. Each of them (and this extends to others not discussed) has different sets of advantages and disadvantages. Nothing will change that basic nature of the various approaches, nor would it be desirable to do so. Along with the advantages, the challenges define the feel of the game and focus the thinking of the players on certain aspects and away from others. The proposed approach to combining square and hexagonal approaches, which we will call the rhombus interface, leverages rhombuses constructed from equilateral triangles into which the hexagon can be decomposed to bridge the gap between the approaches, maintain relative consistency between the two as much as possible, and provide most of the feel of the hexagonal approach.

Hoover, Alex↗

Measuring Skew in Average Surface Roughness as a Function of Surface Preparation

Characterizing surface roughness is important for predicting optical performance. Better measurement of surface roughness reduces grinding saving both time and money and allows the science requirements to be better defined. In this study various materials are polished from a fine grind to a fine polish. Each sample's RMS surface roughness is measured at 81 locations in a 9x9 square grid using a Zygo white light interferometer at regular intervals during the polishing process. Each data set is fit with various standard distributions and tested for goodness of fit. We show that the skew in the RMS data changes as a function of polishing time.

Stahl, Mark T.↗