Search NASA⌕ Search

SEARCH · Search NASA

Results for “Irregular 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 145 records · Page 8

Methods and Results for a Global Precipitation Measurement (GPM) Validation Network Prototype

As one component of a ground validation system to meet requirements for the upcoming Global Precipitation Measurement (GPM) mission, a quasi-operational prototype a system to compare satellite- and ground-based radar measurements has been developed. This prototype, the GPM Validation Network (VN), acquires data from the Precipitation Radar (PR) on the Tropical Rainfall Measuring Mission (TRMM) satellite and from ground radar (GR) networks in the continental U.S. and participating international sites. PR data serve as a surrogate for similar observations from the Dual-frequency Precipitation Radar (DPR) to be present on GPM. Primary goals of the VN prototype are to understand and characterize the variability and bias of precipitation retrievals between the PR and GR in various precipitation regimes at large scales, and to improve precipitation retrieval algorithms for the GPM instruments. The current VN capabilities concentrate on comparisons of the base reflectivity observations between the PR and GR, and include support for rain rate comparisons. The VN algorithm resamples PR and GR reflectivity and other 2-D and 3-D data fields to irregular common volumes defined by the geometric intersection of the instrument observations, and performs statistical comparisons of PR and GR reflectivity and estimated rain rates. Algorithmic biases and uncertainties introduced by traditional data analysis techniques are minimized by not performing interpolation or extrapolation of data to a fixed grid. The core VN dataset consists of WSR-88D GR data and matching PR orbit subset data covering 21 sites in the southeastern U. S., from August, 2006 to the present. On average, about 3.5 overpass events per month for these WSR-88D sites meet VN criteria for significant precipitation, and have matching PR and GR data available. This large statistical sample has allowed the relative calibration accuracy and stability of the individual ground radars, and the quality of the PR reflectivity attenuation correction in convective and stratiform precipitation to be evaluated. We will present results of PR-GR reflectivity and rain rate bias comparisons for each OR site, and for different rain types, for the full data set and as time series. The capabilities of the statistical analysis and vertical cross section tools for display and analysis of individual site overpass event data will be described, and examples of the tools' outputs will be shown.

Morris, Kenneth R.↗

Exploring Dynamic P-Q Capability and Abnormal Operations of Inverter-Based Resources

Nowadays, inverter-based resources are rapidly growing in electric power systems. On the other side, abnormal inverter operations are also occurring more often. Traditionally, inverter PQ capability charts are employed by electric utility companies to ensure safe and reliable operations of inverter-based resources. However, it is found in this paper that existing inverter PQ capability charts do not address the operating characteristics of an inverter correctly, which can result in irregular and unstable inverter operations. Here in this paper, a novel study is conducted to investigate inverter PQ capability charts, where constraints that are specific to an inverter are considered. It is found in this paper that the inverter PQ capability charts exhibit a unique dynamic nature under uncertain grid conditions. This dynamic nature has not been considered by the industry in managing, designing, and controlling an inverter as well as in developing international standards for inverter-based resources. Via both electromagnetic transient simulation and hardware experimental investigations, it is found that the dynamic PQ capability nature, together with the limitations of the existing control methods, are the underlying causes of many unusual inverter operations that have been reported in the literature.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Mapping motion from 4D-MRI to 3D-CT for use in 4D dose calculations: A technical feasibility study

Purpose: Target sites affected by organ motion require a time resolved (4D) dose calculation. Typical 4D dose calculations use 4D-CT as a basis. Unfortunately, 4D-CT images have the disadvantage of being a 'snap-shot' of the motion during acquisition and of assuming regularity of breathing. In addition, 4D-CT acquisitions involve a substantial additional dose burden to the patient making many, repeated 4D-CT acquisitions undesirable. Here the authors test the feasibility of an alternative approach to generate patient specific 4D-CT data sets. Methods: In this approach motion information is extracted from 4D-MRI. Simulated 4D-CT data sets [which the authors call 4D-CT(MRI)] are created by warping extracted deformation fields to a static 3D-CT data set. The employment of 4D-MRI sequences for this has the advantage that no assumptions on breathing regularity are made, irregularities in breathing can be studied and, if necessary, many repeat imaging studies (and consequently simulated 4D-CT data sets) can be performed on patients and/or volunteers. The accuracy of 4D-CT(MRI)s has been validated by 4D proton dose calculations. Our 4D dose algorithm takes into account displacements as well as deformations on the originating 4D-CT/4D-CT(MRI) by calculating the dose of each pencil beam based on an individual time stamp of when that pencil beam is applied. According to corresponding displacement and density-variation-maps the position and the water equivalent range of the dose grid points is adjusted at each time instance. Results: 4D dose distributions, using 4D-CT(MRI) data sets as input were compared to results based on a reference conventional 4D-CT data set capturing similar motion characteristics. Almost identical 4D dose distributions could be achieved, even though scanned proton beams are very sensitive to small differences in the patient geometry. In addition, 4D dose calculations have been performed on the same patient, but using 4D-CT(MRI) data sets based on variable breathing patterns to show the effect of possible irregular breathing on active scanned proton therapy. Using a 4D-CT(MRI), including motion irregularities, resulted in significantly different proton dose distributions. Conclusions: The authors have demonstrated that motion information from 4D-MRI can be used to generate realistic 4D-CT data sets on the basis of a single static 3D-CT data set. 4D-CT(MRI) presents a novel approach to test the robustness of treatment plans in the circumstance of patient motion.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Laser Scanner for Tile-Cavity Measurement

Irregular surfaces mapped and digitized for numerical-control machinery. Fast, accurate laser scanning system measures size and shape of cavity without making any physical contact with cavity and walls. Measurements processed into control signals for numerically controlled machining of tile or block to fit cavity. System generates map of grid points representing cavity and portion of outer surface surrounding cavity. Map data used to control milling machine, which cuts tile or block to fit in cavity.

Yoshino, Stanley Y.↗

Parallel Adaptive High-Order CFD Simulations Characterizing Cavity Acoustics for the Complete SOFIA Aircraft

This paper presents one-of-a-kind MPI-parallel computational fluid dynamics simulations for the Stratospheric Observatory for Infrared Astronomy (SOFIA). SOFIA is an airborne, 2.5-meter infrared telescope mounted in an open cavity in the aft of a Boeing 747SP. These simulations focus on how the unsteady flow field inside and over the cavity interferes with the optical path and mounting of the telescope. A temporally fourth-order Runge-Kutta, and spatially fifth-order WENO-5Z scheme was used to perform implicit large eddy simulations. An immersed boundary method provides automated gridding for complex geometries and natural coupling to a block-structured Cartesian adaptive mesh refinement framework. Strong scaling studies using NASA's Pleiades supercomputer with up to 32,000 cores and 4 billion cells shows excellent scaling. Dynamic load balancing based on execution time on individual AMR blocks addresses irregularities caused by the highly complex geometry. Limits to scaling beyond 32K cores are identified, and targeted code optimizations are discussed.

Acoustics↗

Parallel Adjective High-Order CFD Simulations Characterizing SOFIA Cavity Acoustics

This paper presents large-scale MPI-parallel computational uid dynamics simulations for the Stratospheric Observatory for Infrared Astronomy (SOFIA). SOFIA is an airborne, 2.5-meter infrared telescope mounted in an open cavity in the aft fuselage of a Boeing 747SP. These simulations focus on how the unsteady ow eld inside and over the cavity interferes with the optical path and mounting structure of the telescope. A temporally fourth-order accurate Runge-Kutta, and spatially fth-order accurate WENO- 5Z scheme was used to perform implicit large eddy simulations. An immersed boundary method provides automated gridding for complex geometries and natural coupling to a block-structured Cartesian adaptive mesh re nement framework. Strong scaling studies using NASA's Pleiades supercomputer with up to 32k CPU cores and 4 billion compu- tational cells shows excellent scaling. Dynamic load balancing based on execution time on individual AMR blocks addresses irregular numerical cost associated with blocks con- taining boundaries. Limits to scaling beyond 32k cores are identi ed, and targeted code optimizations are discussed.

CFD↗

Parallel Adaptive High-Order CFD Simulations Characterizing SOFIA Cavitiy Acoustics

This paper presents large-scale MPI-parallel computational uid dynamics simulations for the Stratospheric Observatory for Infrared Astronomy (SOFIA). SOFIA is an airborne, 2.5-meter infrared telescope mounted in an open cavity in the aft fuselage of a Boeing 747SP. These simulations focus on how the unsteady ow eld inside and over the cavity interferes with the optical path and mounting structure of the telescope. A tempo- rally fourth-order accurate Runge-Kutta, and a spatially fth-order accurate WENO-5Z scheme were used to perform implicit large eddy simulations. An immersed boundary method provides automated gridding for complex geometries and natural coupling to a block-structured Cartesian adaptive mesh re nement framework. Strong scaling studies using NASA's Pleiades supercomputer with up to 32k CPU cores and 4 billion compu- tational cells shows excellent scaling. Dynamic load balancing based on execution time on individual AMR blocks addresses irregular numerical cost associated with blocks con- taining boundaries. Limits to scaling beyond 32k cores are identi ed, and targeted code optimizations are discussed.

Parallell↗

Mapping unstructured grid problems to the connection machine

We present a highly parallel graph mapping technique that enables one to solve unstructured grid problems on massively parallel computers. Many implicit and explicit methods for solving discretizated partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The time spent communicating can limit the high performance promised by massively parallel computing. To eliminate this bottleneck, we map the graph of the irregular problem to the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. We show that, in comparison to a naive assignment of processors, our heuristic mapping algorithm significantly reduces the communication time on the Connection Machine, CM-2.

Hammond, Steven W.↗

Solving unstructured grid problems on massively parallel computers

A highly parallel graph mapping technique that enables one to efficiently solve unstructured grid problems on massively parallel computers is presented. Many implicit and explicit methods for solving discretized partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The cost of this communication can negate the high performance promised by massively parallel computing. To eliminate this bottleneck, the graph of the irregular problem is mapped into the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. It is shown that using the heuristic mapping algorithm significantly reduces the communication time compared to a naive assignment of processes to processors.

Hammond, Steven W.↗

RUScal : Software for the analysis of resonant ultrasound spectroscopy measurements

Resonant ultrasound spectroscopy is used to nondestructively measure the elastic resonances of small solids to elucidate the material's elastic properties or other qualities like size, shape, or composition. In this work, we introduce the software RUScal for the purpose of determining elastic properties by analyzing the eigenfrequencies of solid specimens with common shapes, such as rectangular parallelepipeds, cylinders (solid and hollow tube), ellipsoids, and octahedrons, as well as irregularly shaped ellipsoids that can be described analytically. All symmetry classes are supported, from isotropic to triclinic, along with the option to add or remove up to three orthogonal mirror planes as well as the ability to reorient the crystal axes with respect the sample edges via Euler angles. Additional features include tools to help find initial sets of elastic constants, including grid exploration and Monte Carlo methods, a tool to analyze frequencies as a function of sample length or crystal orientation, an error analysis tool to assess fit quality, and formatting of the input and output files for batch fitting, e.g., as a function of temperature. This software was validated with published resonant ultrasound spectroscopy data for various materials, shapes, and symmetries with noted improvements in calculation time compared to finite element methods.

47 OTHER INSTRUMENTATION↗

Visual SLAM Using Variance Grid Maps

An algorithm denoted Gamma-SLAM performs further processing, in real time, of preprocessed digitized images acquired by a stereoscopic pair of electronic cameras aboard an off-road robotic ground vehicle to build accurate maps of the terrain and determine the location of the vehicle with respect to the maps. Part of the name of the algorithm reflects the fact that the process of building the maps and determining the location with respect to them is denoted simultaneous localization and mapping (SLAM). Most prior real-time SLAM algorithms have been limited in applicability to (1) systems equipped with scanning laser range finders as the primary sensors in (2) indoor environments (or relatively simply structured outdoor environments). The few prior vision-based SLAM algorithms have been feature-based and not suitable for real-time applications and, hence, not suitable for autonomous navigation on irregularly structured terrain. The Gamma-SLAM algorithm incorporates two key innovations: Visual odometry (in contradistinction to wheel odometry) is used to estimate the motion of the vehicle. An elevation variance map (in contradistinction to an occupancy or an elevation map) is used to represent the terrain. The Gamma-SLAM algorithm makes use of a Rao-Blackwellized particle filter (RBPF) from Bayesian estimation theory for maintaining a distribution over poses and maps. The core idea of the RBPF approach is that the SLAM problem can be factored into two parts: (1) finding the distribution over robot trajectories, and (2) finding the map conditioned on any given trajectory. The factorization involves the use of a particle filter in which each particle encodes both a possible trajectory and a map conditioned on that trajectory. The base estimate of the trajectory is derived from visual odometry, and the map conditioned on that trajectory is a Cartesian grid of elevation variances. In comparison with traditional occupancy or elevation grid maps, the grid elevation variance maps are much better for representing the structure of vegetated or rocky terrain.

Howard, Andrew B.↗

The Nature of Turbulence in the LITTLE THINGS Dwarf Irregular Galaxies

We present probability density functions and higher order (skewness and kurtosis) analyses of the galaxy-wide and spatially resolved distributions of H i column density in the LITTLE THINGS sample of dwarf irregular galaxies. This analysis follows that of Burkhart et al. for the Small Magellanic Cloud (SMC). About 60% of our sample have galaxy-wide values of kurtosis that are similar to that found for the SMC, with a range up to much higher values, and kurtosis increases with integrated star formation rate. Kurtosis and skewness were calculated for radial annuli and for a grid of 32 pixel × 32 pixel kernels across each galaxy. For most galaxies, kurtosis correlates with skewness. For about half of the galaxies, there is a trend of increasing kurtosis with radius. The range of kurtosis and skewness values is modeled by small variations in the Mach number close to the sonic limit and by conversion of H i to molecules at high column density. The maximum H i column densities decrease with increasing radius in a way that suggests molecules are forming in the weak-field limit, where H{sub 2} formation balances photodissociation in optically thin gas at the edges of clouds.

79 ASTRONOMY AND ASTROPHYSICS↗

Incremental Parallelization of Non-Data-Parallel Programs Using the Charon Message-Passing Library

Message passing is among the most popular techniques for parallelizing scientific programs on distributed-memory architectures. The reasons for its success are wide availability (MPI), efficiency, and full tuning control provided to the programmer. A major drawback, however, is that incremental parallelization, as offered by compiler directives, is not generally possible, because all data structures have to be changed throughout the program simultaneously. Charon remedies this situation through mappings between distributed and non-distributed data. It allows breaking up the parallelization into small steps, guaranteeing correctness at every stage. Several tools are available to help convert legacy codes into high-performance message-passing programs. They usually target data-parallel applications, whose loops carrying most of the work can be distributed among all processors without much dependency analysis. Others do a full dependency analysis and then convert the code virtually automatically. Even more toolkits are available that aid construction from scratch of message passing programs. None, however, allows piecemeal translation of codes with complex data dependencies (i.e. non-data-parallel programs) into message passing codes. The Charon library (available in both C and Fortran) provides incremental parallelization capabilities by linking legacy code arrays with distributed arrays. During the conversion process, non-distributed and distributed arrays exist side by side, and simple mapping functions allow the programmer to switch between the two in any location in the program. Charon also provides wrapper functions that leave the structure of the legacy code intact, but that allow execution on truly distributed data. Finally, the library provides a rich set of communication functions that support virtually all patterns of remote data demands in realistic structured grid scientific programs, including transposition, nearest-neighbor communication, pipelining, gather/scatter, and redistribution. At the end of the conversion process most intermediate Charon function calls will have been removed, the non-distributed arrays will have been deleted, and virtually the only remaining Charon functions calls are the high-level, highly optimized communications. Distribution of the data is under complete control of the programmer, although a wide range of useful distributions is easily available through predefined functions. A crucial aspect of the library is that it does not allocate space for distributed arrays, but accepts programmer-specified memory. This has two major consequences. First, codes parallelized using Charon do not suffer from encapsulation; user data is always directly accessible. This provides high efficiency, and also retains the possibility of using message passing directly for highly irregular communications. Second, non-distributed arrays can be interpreted as (trivial) distributions in the Charon sense, which allows them to be mapped to truly distributed arrays, and vice versa. This is the mechanism that enables incremental parallelization. In this paper we provide a brief introduction of the library and then focus on the actual steps in the parallelization process, using some representative examples from, among others, the NAS Parallel Benchmarks. We show how a complicated two-dimensional pipeline-the prototypical non-data-parallel algorithm- can be constructed with ease. To demonstrate the flexibility of the library, we give examples of the stepwise, efficient parallel implementation of nonlocal boundary conditions common in aircraft simulations, as well as the construction of the sequence of grids required for multigrid.

VanderWijngaart, Rob F.↗

Electrostatic point charge fitting as an inverse problem: Revealing the underlying ill-conditioning

Atom-centered point charge (PC) model of the molecular electrostatics—a major workhorse of the atomistic biomolecular simulations—is usually parameterized by least-squares (LS) fitting of the point charge values to a reference electrostatic potential, a procedure that suffers from numerical instabilities due to the ill-conditioned nature of the LS problem. To reveal the origins of this ill-conditioning, we start with a general treatment of the point charge fitting problem as an inverse problem and construct an analytical model with the point charges spherically arranged according to Lebedev quadrature which is naturally suited for the inverse electrostatic problem. This analytical model is contrasted to the atom-centered point-charge model that can be viewed as an irregular quadrature poorly suited for the problem. This analysis shows that the numerical problems of the point charge fitting are due to the decay of the curvatures corresponding to the eigenvectors of LS sum Hessian matrix. In part, this ill-conditioning is intrinsic to the problem and is related to decreasing electrostatic contribution of the higher multipole moments, that are, in the case of Lebedev grid model, directly associated with the Hessian eigenvectors. For the atom-centered model, this association breaks down beyond the first few eigenvectors related to the high-curvature monopole and dipole terms; this leads to even wider spread-out of the Hessian curvature values. Using these insights, it is possible to alleviate the ill-conditioning of the LS point-charge fitting without introducing external restraints and/or constraints. Also, as the analytical Lebedev grid PC model proposed here can reproduce multipole moments up to a given rank, it may provide a promising alternative to including explicit multipole terms in a force field.

74 ATOMIC AND MOLECULAR PHYSICS↗

Recent advances in the mechanical characterization of shales at nano-to micro-scales: A review

Understanding geomechanical properties of shales, such as stiffness properties and fracture toughness, is important in different areas of petroleum industry-related activities. Nanoscale to microscale experiments on shale samples require a much smaller sample compared to macroscale experiments. This is a major advantage because irregularly-shaped drill cuttings from shales can be used for experimental analyses, such as nanoindentation or atomic force microscopy (AFM). However, characterization of mechanical properties at the nano- to micro-scale is a relatively new addition to classical geomechanical experiments on shales, and there is still a lack of both fundamental knowledge and standard procedures for conducting experiments at this scale. The theoretical principles of nanoindentation-based (Gridded Nanoindentation and Modulus Mapping) and AFM-based experimental methods (PeakForce QNMTM and AFM-IR), a review of the literature results and the major findings are explained in Sections 2 and 3, respectively. These experimental techniques are compared in Section 4. Overall, nanoindentation experiments reveal the anisotropy of organic matter (OM)-rich shales at the nanoscale, and it is shown that gridded nanoindentation is capable of characterizing different minerals with respect to their stiffness properties. The capability of AFM (PeakForce QNMTM) to differentiate between different minerals within OM-rich shales with distinct mechanical properties, in particular stiffness, is also demonstrated. It is shown that AFM-based methods are more straightforward than gridded-nanoindentation to characterize OM-rich shales based on the stiffness of different constituent minerals of OM-rich shales, but nanoindentation can apply higher loads than AFM-based methods. Therefore, they can measure creep properties and fracture toughness of OM-rich shales. Here, it is shown that the OM is the most compliant part of the OM-rich shales, but it is still unclear if thermal maturation has an impact on the stiffness of OM. It is necessary to investigate if there is a relationship between the OM type (kerogen, bitumen, etc.) and mechanical properties such as Young’s modulus and Creep rate.

36 MATERIALS SCIENCE↗

Small-Body Extensions for the Satellite Orbit Analysis Program (SOAP)

An extension to the SOAP software allows users to work with tri-axial ellipsoid-based representations of planetary bodies, primarily for working with small, natural satellites, asteroids, and comets. SOAP is a widely used tool for the visualization and analysis of space missions. The small body extension provides the same visualization and analysis constructs for use with small bodies. These constructs allow the user to characterize satellite path and instrument cover information for small bodies in both 3D display and numerical output formats. Tri-axial ellipsoids are geometric shapes the diameters of which are different in each of three principal x, y, and z dimensions. This construct provides a better approximation than using spheres or oblate spheroids (ellipsoids comprising two common equatorial diameters as a distinct polar diameter). However, the tri-axial ellipsoid is considerably more difficult to work with from a modeling perspective. In addition, the SOAP small-body extensions allow the user to actually employ a plate model for highly irregular surfaces. Both tri-axial ellipsoids and plate models can be assigned to coordinate frames, thus allowing for the modeling of arbitrary changes to body orientation. A variety of features have been extended to support tri-axial ellipsoids, including the computation and display of the spacecraft sub-orbital point, ground trace, instrument footprints, and swathes. Displays of 3D instrument volumes can be shown interacting with the ellipsoids. Longitude/latitude grids, contour plots, and texture maps can be displayed on the ellipsoids using a variety of projections. The distance along an arbitrary line of sight can be computed between the spacecraft and the ellipsoid, and the coordinates of that intersection can be plotted as a function of time. The small-body extension supports the same visual and analytical constructs that are supported for spheres and oblate spheroids in SOAP making the implementation of the more complex algorithms largely transparent to the user.

Carnright, Robert↗

Calculations of transonic potential flow over cascades

Transonic flow through a cascade was studied by using the full potential equation and the finite volume method of Jameson and Caughey. The C-type computational grid is generated by an electrostatic analogy and simple shearing transformation. The solution algorithm includes an option of using either an artificial density or an artificial viscosity formulation of the dissipative term. Using the developed code, flows through a cascade of NACA 0012 airfoils and flows through a cascade of shockless blades were computed. It is found that the designed flow through the shockless blade is accurately predicted, the artificial density formulation shows more tolerance to the mesh irregularity, and the C-type mesh does not extend very far upstream for a small pitch-cord ratio.

Jou, W. H.↗

Adaptive Grid Lens Modeling of the Cosmic Horseshoe Using Hubble Space Telescope Imaging

The Cosmic Horseshoe gravitational lensing system is an extraordinary example of strong gravitational lensing both due to the nearly complete Einstein ring formed in this system and due to the star-forming nature of the lensed $z$ = 2.38 Lyman-break galaxy. In this paper, we describe the development of a new lens modeling package and the lens models produced using the Hubble Space Telescope imaging. Our new lens modeling package uses adaptive grid methods, based especially on the algorithm described by Vegetti & Koopmans. The new lens modeling package introduces the K-means method to deal with multiple background sources. We utilize two parameterized models, the singular isothermal ellipsoid and the Navarro–Frenk–White model in order to optimize the Bayesian penalty function. Color–color diagrams show two distinct colors exist in the Einstein ring, which suggests that the Cosmic Horseshoe is formed from two background galaxies or from a highly irregular galaxy. We find that the best lens model includes two components and the total mass within the Einstein ring is $(5.43\pm 0.08)\times {10}^{12}\,{M}_{\odot }$. Furthermore, the background source reconstruction shows two peaks in the source plane and the most probable lens profile is consistent with the light profile of the foreground galaxy when comparing axis ratios and position angles.

79 ASTRONOMY AND ASTROPHYSICS↗