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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

Steady flow of a non-Newtonian fluid through a contraction

A steady-state analysis is conducted to examine the basic flow structure of a non-Newtonian fluid in a domain including an inflow region, a contraction region, and an outflow region. A Cartesian grid system is used throughout the entire flow domain, including the contraction region, thus creating an irregular grid cell structure adjacent to the curved boundary. At node points adjacent to the curved boundary symmetry conditions are derived for the different flow variables in order to solve the governing difference equations. Attention is given to the motion and non-Newtonian constitutive equations, the boundary conditions, the numerical modeling of the non-Newtonian equations, the stream function contour lines for the non-Newtonian fluid, the vorticity contour lines for the non-Newtonian fluid, the velocity profile across the contraction, and the shear stress contour lines for the non-Newtonian fluid.

Gatski, T. B.↗
NASA NTRS1995

A compact solution to computational acoustics

This paper demonstrates that the linearized, dimensional Euler equations for acoustic computation can be accurately solved as a set of decoupled first-order wave equations, and that if ordered properly, this system of simple waves has unambiguous, easily implemented boundary conditions, allowing waves of same group speeds to pass through numerical boundaries or comply with wall conditions. Thus, the task of designing a complex multi-dimensional scheme with approximate far-field boundary conditions reduces to the design of higher order schemes for the one-dimensional simple wave equation. A compact finite-difference scheme and a characteristically exact but numerically n(th) order accurate boundary condition are introduced for solving the first order wave equation. Spanning a three-point two-level stencil, this low-dispersion implicit scheme has a third order spatial accuracy when used on nonuniform meshes, fourth order accurate on uniform meshes, and a temporal accuracy of second order due to the choice of trapezoidal integration for algorithmic simplicity. The robustness and accuracy of the scheme are demonstrated through a series of numerical experiments and comparisons with published results. When tested on the one-dimensional wave equation on a uniform grid, this scheme allows a Gaussian wave packet to pass through any finite domain with low numerical dispersion characteristic of a spatially fourth-order scheme and reflections at numerical boundaries maintained below truncation error. On highly stretched and irregular grids, only mild dispersions are found in the solution while solutions by other methods fail or are severely distorted. Yet, this scheme is no more sophisticated to solve or implement than the Crank-Nicolson scheme. This scheme has been tested on four categories of the ICASE/LaRC benchmark problems, which include propagation of acoustic and convective waves in Cartesian and cylindrical domains, reflection of acoustic wave at stationary/moving boundaries, and sound generation by gust-blade interaction.

Fung, K.-Y.↗
DOE OSTI2018

Two-Level Least Squares Methods in Krylov Subspaces

Two-level least squares acceleration approaches are applied to the Chebyshev acceleration method and the restarted conjugate residual method in solving systems of linear algebraic equations with sparse unsymmetric coefficient matrices arising from finite volume or finite element approximations of boundary-value problems on irregular grids. Application of the proposed idea to other iterative restarted processes also is considered. The efficiency of the algorithms suggested is investigated numerically on a set of model Dirichlet problems for the convection-diffusion equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

On estimating the curvature attributes and strain invariants of deformed surface through radial basis functions

Numerical methods in approximation of derivatives on regular or irregular gridded and scattered data points are of significance in the study of numerous problems in engineering and geoscience. A mathematically accurate and stable method is assessed to compute the differential quantities, while being flexible and easy to implement. Strain-invariant parameters in deformation analysis and curvature attributes in geometrical analysis of approximated surfaces are independent quantities which could be derived numerically through radial basis functions (RBFs) for scattered data points. Approximation of a function or its derivatives through RBFs is highly correlated to its shape parameter which depends on the number and distribution of the particles on the support domain. A procedure to find the optimal shape parameter for RBFs in the influence domain of each nodal point together with the presentation of a manner of calculating the curvature attributes and strain parameters through Gaussian RBFs is proposed here. Results indicate a significant improvement in the approximation accuracy of strain parameters and curvature attributes, while this approximation is more stable when RBFs with optimal shape parameter are implemented rather than the traditional moving least squares.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

ColorMap ND : A Data-Driven Approach and Tool for Mapping Multivariate Data to Color

A wide variety of color schemes have been devised for mapping scalar data to color. We address the challenge of color-mapping multivariate data. While a number of methods can map low-dimensional data to color, for example, using bilinear or barycentric interpolation for two or three variables, these methods do not scale to higher data dimensions. Likewise, schemes that take a more artistic approach through color mixing and the like also face limits when it comes to the number of variables they can encode. Our approach does not have these limitations. It is data driven in that it determines a proper and consistent color map from first embedding the data samples into a circular interactive multivariate color mapping display (ICD) and then fusing this display with a convex (CIE HCL) color space. The variables (data attributes) are arranged in terms of their similarity and mapped to the ICD’s boundary to control the embedding. Using this layout, the color of a multivariate data sample is then obtained via modified generalized barycentric coordinate interpolation of the map. In conclusion, the system we devised has facilities for contrast and feature enhancement, supports both regular and irregular grids, can deal with multi-field as well as multispectral data, and can produce heat maps, choropleth maps, and diagrams such as scatterplots.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Development of an open-source regional data assimilation system in PEcAn v. 1.7.2: application to carbon cycle reanalysis across the contiguous US using SIPNET

Abstract. The ability to monitor, understand, and predict the dynamics of the terrestrial carbon cycle requires the capacity to robustly and coherently synthesize multiple streams of information that each provide partial information about different pools and fluxes. In this study, we introduce a new terrestrial carbon cycle data assimilation system, built on the PEcAn model–data eco-informatics system, and its application for the development of a proof-of-concept carbon “reanalysis” product that harmonizes carbon pools (leaf, wood, soil) and fluxes (GPP, Ra, Rh, NEE) across the contiguous United States from 1986–2019. We first calibrated this system against plant trait and flux tower net ecosystem exchange (NEE) using a novel emulated hierarchical Bayesian approach. Next, we extended the Tobit–Wishart ensemble filter (TWEnF) state data assimilation (SDA) framework, a generalization of the common ensemble Kalman filter which accounts for censored data and provides a fully Bayesian estimate of model process error, to a regional-scale system with a calibrated localization. Combined with additional workflows for propagating parameter, initial condition, and driver uncertainty, this represents the most complete and robust uncertainty accounting available for terrestrial carbon models. Our initial reanalysis was run on an irregular grid of ∼ 500 points selected using a stratified sampling method to efficiently capture environmental heterogeneity. Remotely sensed observations of aboveground biomass (Landsat LandTrendr) and leaf area index (LAI) (MODIS MOD15) were sequentially assimilated into the SIPNET model. Reanalysis soil carbon, which was indirectly constrained based on modeled covariances, showed general agreement with SoilGrids, an independent soil carbon data product. Reanalysis NEE, which was constrained based on posterior ensemble weights, also showed good agreement with eddy flux tower NEE and reduced root mean square error (RMSE) compared to the calibrated forecast. Ultimately, PEcAn's new open-source regional data assimilation framework provides a scalable workflow for harmonizing multiple data constraints and providing a uniform synthetic platform for carbon monitoring, reporting, and verification (MRV) as well as accelerating terrestrial carbon cycle research.

54 ENVIRONMENTAL SCIENCES↗
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 NTRS1985

High resolution TVD schemes using flux limiters

Roe (1981, 1985) has utilized flux limiters to obtain second order monotonicity preserving schemes. In the present paper, the foundation for flux limiters in the formulation of first order three-point schemes are discussed, and a systematic outline is provided of the method of using flux limiters to obtain second order accurate TVD schemes. Attention is given to Phi limiters, the Van Leer limiter, the Chakravarthy-Osher limiter, the linear advection equation and square wave data, the inviscid Burger's equation, and the extension of flux limiters to irregular grids, systems of equations, and implicit calculations.

Sweby, P. K.↗
NASA NTRS1990

Hyperbolic conservation laws and numerical methods

The mathematical structure of hyperbolic systems and the scalar equation case of conservation laws are discussed. Linear, nonlinear systems and the Riemann problem for the Euler equations are also studied. The numerical methods for conservation laws are presented in a nonstandard manner which leads to large time steps generalizations and computations on irregular grids. The solution of conservation laws with stiff source terms is examined.

Leveque, Randall J.↗
NASA NTRS1993

A comparison of two formulations for high-order accurate essentially non-oscillatory schemes

The finite-volume and finite-difference implementations of high-order accurate essentially nonoscillatory shock-capturing schemes are discussed and compared. Results obtained with fourth-order accurate algorithms based on both formulations are examined for accuracy, sensitivity to grid irregularities, resolution of waves that are oblique to the mesh, and computational efficiency. Some algorithm modifications that may be required for a given application are suggested. Conclusions that pertain to the relative merits of both formulations are drawn, and some circumstances for which each might be useful are noted.

Casper, J.↗
NASA NTRS1993

A comparison of two formulations for high-order accurate essentially non-oscillatory schemes

The finite-volume and finite-difference implementations of high-order accurate essentially non-oscillatory shock-capturing schemes are discussed and compared. Results obtained with fourth-order accurate algorithms based on both formulations are examined for accuracy, sensitivity to grid irregularities, resolution of waves that are oblique to the mesh, and computational efficiency. Some algorithm modifications that may be required for a given application are suggested. Conclusions that pertain to the relative merits of both formulations are drawn, and some circumstances for which each might be useful are noted.

Casper, Jay↗
NASA NTRS1995

Full-Wave Analysis Of MMICs Using A Generalized Yee Algorithm

Improved method of temporal analysis of propagation of electro-magnetic waves in monolithic microwave integrated circuits (MMICs) implemented by generalized version of traditional Yee algorithm. Provides more accurate mathematical modeling for analysis and design of MMICs. Based on unstructured and otherwise irregular grids. Grids readily fitted to conductive and dielectric circuit elements having realistically complex three-dimensional shapes. Better for modeling important and geometrically complex phenomena like fringing fields.

Lansing, Faiza S.↗
NASA NTRS1996

A Mixed Finite Volume Element Method for Flow Calculations in Porous Media

A key ingredient in the simulation of flow in porous media is the accurate determination of the velocities that drive the flow. The large scale irregularities of the geology, such as faults, fractures, and layers suggest the use of irregular grids in the simulation. Work has been done in applying the finite volume element (FVE) methodology as developed by McCormick in conjunction with mixed methods which were developed by Raviart and Thomas. The resulting mixed finite volume element discretization scheme has the potential to generate more accurate solutions than standard approaches. The focus of this paper is on a multilevel algorithm for solving the discrete mixed FVE equations. The algorithm uses a standard cell centered finite difference scheme as the 'coarse' level and the more accurate mixed FVE scheme as the 'fine' level. The algorithm appears to have potential as a fast solver for large size simulations of flow in porous media.

Jim E Jones↗
NASA NTRS1997

Tools for Analysis and Visualization of Large Time-Varying CFD Data Sets

In the second year, we continued to built upon and improve our scanline-based direct volume renderer that we developed in the first year of this grant. This extremely general rendering approach can handle regular or irregular grids, including overlapping multiple grids, and polygon mesh surfaces. It runs in parallel on multi-processors. It can also be used in conjunction with a k-d tree hierarchy, where approximate models and error terms are stored in the nodes of the tree, and approximate fast renderings can be created. We have extended our software to handle time-varying data where the data changes but the grid does not. We are now working on extending it to handle more general time-varying data. We have also developed a new extension of our direct volume renderer that uses automatic decimation of the 3D grid, as opposed to an explicit hierarchy. We explored this alternative approach as being more appropriate for very large data sets, where the extra expense of a tree may be unacceptable. We also describe a new approach to direct volume rendering using hardware 3D textures and incorporates lighting effects. Volume rendering using hardware 3D textures is extremely fast, and machines capable of using this technique are becoming more moderately priced. While this technique, at present, is limited to use with regular grids, we are pursuing possible algorithms extending the approach to more general grid types. We have also begun to explore a new method for determining the accuracy of approximate models based on the light field method described at ACM SIGGRAPH '96. In our initial implementation, we automatically image the volume from 32 equi-distant positions on the surface of an enclosing tessellated sphere. We then calculate differences between these images under different conditions of volume approximation or decimation. We are studying whether this will give a quantitative measure of the effects of approximation. We have created new tools for exploring the differences between images produced by various rendering methods. Images created by our software can be stored in the SGI RGB format. Our idtools software reads in pair of images and compares them using various metrics. The differences of the images using the RGB, HSV, and HSL color models can be calculated and shown. We can also calculate the auto-correlation function and the Fourier transform of the image and image differences. We will explore how these image differences compare in order to find useful metrics for quantifying the success of various visualization approaches. In general, progress was consistent with our research plan for the second year of the grant.

Wilhelms, Jane↗
NASA NTRS2004

High-Order Shock-Capturing Methods for Modeling Dynamics of the Solar Atmosphere

We use one-dimensional high-order central shock capturing numerical methods to study the response of various model solar atmospheres to forcing at the solar surface. The dynamics of the atmosphere is modeled with the Euler equations in a variable-sized flux tube in the presence of gravity. We study dynamics of the atmosphere suggestive of spicule formation and coronal oscillations. These studies are performed on observationally-derived model atmospheres above the quiet sun and above sunspots. To perform these simulations, we provide a new extension of existing second- and third- order shock-capturing methods to irregular grids. We also solve the problem of numerically maintaining initial hydrostatic balance via the introduction of new variables in the model equations and a careful initialization mechanism. We find several striking results: all model atmospheres respond to a single impulsive perturbation with several strong shock waves consistent with the rebound-shock model. These shock waves lift material and the transition region well into the initial corona, and the sensitivity of this lift to the initial impulse depends non-linearly on the details of the atmosphere model. We also reproduce an observed 3-minute coronal oscillation above sunspots compared to 5-minute oscillations above the quiet sun.

Bryson, Steve↗
NASA NTRS2000

Multiresolution With Super-Compact Wavelets

The solution data computed from large scale simulations are sometimes too big for main memory, for local disks, and possibly even for a remote storage disk, creating tremendous processing time as well as technical difficulties in analyzing the data. The excessive storage demands a corresponding huge penalty in I/O time, rendering time and transmission time between different computer systems. In this paper, a multiresolution scheme is proposed to compress field simulation or experimental data without much loss of important information in the representation. Originally, the wavelet based multiresolution scheme was introduced in image processing, for the purposes of data compression and feature extraction. Unlike photographic image data which has rather simple settings, computational field simulation data needs more careful treatment in applying the multiresolution technique. While the image data sits on a regular spaced grid, the simulation data usually resides on a structured curvilinear grid or unstructured grid. In addition to the irregularity in grid spacing, the other difficulty is that the solutions consist of vectors instead of scalar values. The data characteristics demand more restrictive conditions. In general, the photographic images have very little inherent smoothness with discontinuities almost everywhere. On the other hand, the numerical solutions have smoothness almost everywhere and discontinuities in local areas (shock, vortices, and shear layers). The wavelet bases should be amenable to the solution of the problem at hand and applicable to constraints such as numerical accuracy and boundary conditions. In choosing a suitable wavelet basis for simulation data among a variety of wavelet families, the supercompact wavelets designed by Beam and Warming provide one of the most effective multiresolution schemes. Supercompact multi-wavelets retain the compactness of Haar wavelets, are piecewise polynomial and orthogonal, and can have arbitrary order of approximation. The advantages of the multiresolution algorithm are that no special treatment is required at the boundaries of the interval, and that the application to functions which are only piecewise continuous (internal boundaries) can be efficiently implemented. In this presentation, Beam's supercompact wavelets are generalized to higher dimensions using multidimensional scaling and wavelet functions rather than alternating the directions as in the 1D version. As a demonstration of actual 3D data compression, supercompact wavelet transforms are applied to a 3D data set for wing tip vortex flow solutions (2.5 million grid points). It is shown that high data compression ratio can be achieved (around 50:1 ratio) in both vector and scalar data set.

Lee, Dohyung↗
DOE OSTI2025

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗
NASA NTRS1990

Adaptive grid embedding for the two-dimensional flux-split Euler equations

A numerical algorithm is presented for solving the 2-D flux-split Euler equations using a multigrid method with adaptive grid embedding. The method uses an unstructured data set along with a system of pointers for communication on the irregularly shaped grid topologies. An explicit two-stage time advancement scheme is implemented. A multigrid algorithm is used to provide grid level communication and to accelerate the convergence of the solution to steady state. Results are presented for a subcritical airfoil and a transonic airfoil with 3 levels of adaptation. Comparisons are made with a structured upwind Euler code which uses the same flux integration techniques of the present algorithm. Good agreement is obtained with converged surface pressure coefficients. The lift coefficients of the adaptive code are within 2 1/2 percent of the structured code for the sub-critical case and within 4 1/2 percent of the structured code for the transonic case using approximately one-third the number of grid points.

Warren, Gary Patrick↗