Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mesh regularization”

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 73 records · Page 4

A Technique for Mapping Characteristic Lengths to Preserve Energy Dissipated via Strain Softening in a Multiscale Analysis

It is often advantageous to account for the microstructure of the material directly using multiscale modeling. For computational tractability, an idealized repeating unit cell (RUC) is used to capture all of the pertinent features of the microstructure. Typically, the RUC is dimensionless and depends only on the relative volume fractions of the different phases in the material. This works well for non-linear and inelastic behavior exhibiting a positive-definite constitutive response. Although, once the material exhibits strain softening, or localization, a mesh objective failure theories, such as smeared fracture theories, nodal and element enrichment theories (XFEM), cohesive elements or virtual crack closure technique (VCCT), can be utilized at the microscale, but the dimensions of the RUC must then be defined. One major challenge in multiscale progressive damage modeling is relating the characteristic lengths across the scales in order to preserve the energy that is dissipated via localization at the microscale. If there is no effort to relate the size of the macroscale element to the microscale RUC, then the energy that is dissipated will remain mesh dependent at the macroscale, even if it is regularized at the microscale. Here, a technique for mapping characteristic lengths across the scales is proposed. The RUC will be modeled using the generalized method of cells (GMC) micromechanics theory, and local failure in the matrix constituent subcells will be modeled using the crack band theory. The subcell characteristic lengths used in the crack band calculations will be mapped to the macroscale finite element in order to regularize the local energy in a manner consistent with the global length scale. Examples will be provided with and without the regularization, and they will be compared to a baseline case where the size and shape of the element and RUC are coincident (ensuring energy is preserved across the scales).

softening↗

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↗

Multigrid Strategies for Viscous Flow Solvers on Anisotropic Unstructured Meshes

Unstructured multigrid techniques for relieving the stiffness associated with high-Reynolds number viscous flow simulations on extremely stretched grids are investigated. One approach consists of employing a semi-coarsening or directional-coarsening technique, based on the directions of strong coupling within the mesh, in order to construct more optimal coarse grid levels. An alternate approach is developed which employs directional implicit smoothing with regular fully coarsened multigrid levels. The directional implicit smoothing is obtained by constructing implicit lines in the unstructured mesh based on the directions of strong coupling. Both approaches yield large increases in convergence rates over the traditional explicit full-coarsening multigrid algorithm. However, maximum benefits are achieved by combining the two approaches in a coupled manner into a single algorithm. An order of magnitude increase in convergence rate over the traditional explicit full-coarsening algorithm is demonstrated, and convergence rates for high-Reynolds number viscous flows which are independent of the grid aspect ratio are obtained. Further acceleration is provided by incorporating low-Mach-number preconditioning techniques, and a Newton-GMRES strategy which employs the multigrid scheme as a preconditioner. The compounding effects of these various techniques on speed of convergence is documented through several example test cases.

Movriplis, Dimitri J.↗

One-shot omnidirectional pressure integration through matrix inversion

In this work, we present a method to perform 2D and 3D omnidirectional pressure integration from velocity measurements with a single-iteration matrix inversion approach. This work builds upon our previous work, where the rotating parallel ray approach was extended to the limit of infinite rays by taking continuous projection integrals of the ray paths and recasting the problem as an iterative matrix inversion problem. This iterative matrix equation is now 'fast-forwarded' to the 'infinity' iteration, leading to a different matrix equation that can be solved in a single step, thereby presenting the same computational complexity as the Poisson equation. We observe computational speedups of ~10 6 when compared to brute-force omnidirectional integration methods, enabling the treatment of grids of ~10 9 points and potentially even larger in a desktop setup at the time of publication. Further examination of the boundary conditions of our one-shot method shows that omnidirectional pressure integration implements a boundary condition where the boundary points are treated as interior points to the extent that information is available. Finally, we show how the method can be extended from the regular grids typical of particle image velocimetry to the unstructured meshes characteristic of particle tracking velocimetry data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SWinzip v. 2.0

SWinzip is a Matlab and C++ library for scientific lossy data compression and reconstruction using compressed sensing and tree-wavelets transforms. These methods are known for their large compression and usefulness in data analytics such as features extraction. Compressed sensing and wavelets methods rely heavily on sparse and dense linear algebra operations implemented through the Boost codes in our library. SWinzip accommodates data represented on both regular grids (e.g. image data) and point-clouds (e.g. unstructured meshes). In SWinzip v2.0, there is more focus on wavelet compression and the following features are added: - The matrix-free (direct) wavelet transform is implemented in both C++ and Matlab. A threshold-based compression can now be used. Examples for distributed compression are also added. - Python implementation of Alpert wavelet transforms - Field data comparison using wavelets in Matlab with global and local metrics

Solloum, Maher↗

CHESS 2025: Orthorectified airborne RGB imagery from NEON AOP surveys

This dataset provides Level 1 (L1) and Level 3 (L3) orthorectified Red-Green-Blue (RGB) imagery collected for the 2025 Colorado Headwaters Ecological Spectroscopy Study (CHESS). This high-resolution imagery is a photographic record of red, green, and blue visible light from sunlight reflected off of the Earth’s surface. The data comprise full-color images of the ground surface and are primarily intended to provide context to imaging spectroscopy and light detection and ranging (LiDAR) data. The data were acquired over three study domains in the Upper Gunnison river basin: the upper East River watershed (CRBU); Almont Triangle and Taylor Canyon (ALMO); and Upper Taylor River watershed (UPTA) between 2025-06-13 and 2025-07-15. RGB images were acquired using the PhaseOne IXM-RS150F high-resolution digital camera onboard the National Ecological Observatory Network (NEON) Airborne Observation Platform (AOP). The package data include both an L1 product comprising one camera frame per file and an L3 mosaic aligned to the Universal Transverse Mercator (UTM) Zone 13N grid and the World Geodetic System (WGS) 84 projection. Both products are provided in geotif (.tif) format at 0.1 m ground resolution. The bulk of the imagery was collected during the main CHESS field campaign from June 13 to July 15, 2025. Additional images of a portion of the Upper Taylor (UPTA) domain were collected on September 18, 2025, to fill gaps in imagery identified after the main campaign was complete. RGB camera imagery is not radiometrically calibrated, and therefore pixel values should not be exploited for scientific analysis. Pixel values have undergone a manual adjustment to enhance feature identification. The imagery is rigorously geolocated which does allow for reliable geometric information to be retrieved. To generate the orthorectified imagery, the NEON AOP camera captured visible spectrum in red, green, and blue bands. The raw images were then processed using NEON’s camera orthorectification workflow. A boresight calibration flight was made to build a complete camera, distortion, and alignment model. Color balance/white balance and exposure correction were applied to the raw RGB images. The corrected images were orthorectified by ray-tracing image pixels to a lidar-derived digital surface model (DSM) mesh using the refined camera model, outputting orthorectified raster pixels on a regular grid. Flightline-level data were mosaicked by selecting per-pixel contributions from overlapping orthorectified images using line-of-sight (LOS) zenith angle minimization to reduce edge distortions. CHESS Project Description: The Colorado Headwaters Ecological Spectroscopy Study (CHESS) comprised a multi-week airborne remote sensing and field observation campaign in the Upper Gunnison Basin, Colorado, conducted in June and July of 2025. Airborne remote sensing was conducted by the National Ecological Observatory Network Airborne Observation Platform (NEON AOP), concurrent with a field campaign run by the Rocky Mountain Biological Laboratory (RMBL), the Lawrence Berkeley National Laboratory (LBNL) and SLAC National Accelerator Laboratory Watershed Function Science Focus Area (SFA), and NASA-JPL (Jet Propulsion Laboratory) Earth Surface Mineral Dust Source Investigation (EMIT) program. Between June 10 and July 18, 2025, the NEON AOP flight team collected high-resolution aerial imaging spectroscopy and Light Detection and Ranging (LiDAR) data over three domains: the Upper East River (CRBU), Almont Triangle (ALMO), and the Upper Taylor Basin (UPTA). In coordination with the flights, a field campaign acquired ground-truth observations, including observations of vegetation composition, foliar traits, forest demography, and subsurface properties in 18 core sampling areas within the domains. Additional surface water observations were taken at over 380 point locations. All CHESS campaign datasets can be found within the CHESS ESS-DIVE data portal: https://data.ess-dive.lbl.gov/portals/chess. Funding Acknowledgement: Field and remote-sensing data acquisition was performed under a grant from the National Aeronautics and Space Administration (80NSSC24K1005). This work was also supported by the Watershed Function Science Focus Area at Lawrence Berkeley National Laboratory funded by the US Department of Energy, Office of Science, Biological and Environmental Research under Contract No. DE-AC02-05CH11231.

2018 NEON and 2025 CHESS Campaigns↗

Self-Avoiding Walks over Adaptive Triangular Grids

In this paper, we present a new approach to constructing a "self-avoiding" walk through a triangular mesh. Unlike the popular approach of visiting mesh elements using space-filling curves which is based on a geometric embedding, our approach is combinatorial in the sense that it uses the mesh connectivity only. We present an algorithm for constructing a self-avoiding walk which can be applied to any unstructured triangular mesh. The complexity of the algorithm is O(n x log(n)), where n is the number of triangles in the mesh. We show that for hierarchical adaptive meshes, the algorithm can be easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the run-time partitioning and load balancing of adaptive unstructured grids.

Heber, Gerd↗

Impact and Penetration of Thin Aluminum 2024 Flat Panels at Oblique Angles of Incidence

The U.S. Federal Aviation Administration (FAA) and the National Aeronautics and Space Administration (NASA) are actively involved in improving the predictive capabilities of transient finite element computational methods for application to safety issues involving unintended impacts on aircraft and aircraft engine structures. One aspect of this work involves the development of an improved deformation and failure model for metallic materials, known as the Tabulated Johnson-Cook model, or MAT224, which has been implemented in the LS-DYNA commercial transient finite element analysis code (LSTC Corp., Livermore, CA) (Ref. 1). In this model the yield stress is a function of strain, strain rate and temperature and the plastic failure strain is a function of the state of stress, temperature and strain rate. The failure criterion is based on the accumulation of plastic strain in an element. The model also incorporates a regularization scheme to account for the dependency of plastic failure strain on mesh size. For a given material the model requires a significant amount of testing to determine the yield stress and failure strain as a function of the three-dimensional state of stress, strain rate and temperature. In addition, experiments are required to validate the model. Currently the model has been developed for Aluminum 2024 and validated against a series of ballistic impact tests on flat plates of various thicknesses (Refs. 1 to 3). Full development of the model for Titanium 6Al-4V is being completed, and mechanical testing for Inconel 718 has begun. The validation testing for the models involves ballistic impact tests using cylindrical projectiles impacting flat plates at a normal incidence (Ref. 2). By varying the thickness of the plates, different stress states and resulting failure modes are induced, providing a range of conditions over which the model can be validated. The objective of the study reported here was to provide experimental data to evaluate the model under more extreme conditions, using a projectile with a more complex shape and sharp contacts, impacting flat panels at oblique angles of incidence.

Ruggeri, Charles R.↗

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

Mesh-connected processor arrays for the transitive closure problem

The main purpose in this paper is to lay a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem. Using a simple path-algebraic formulation of the problem and observing its similarity to certain well-known smoothing problems that occur in digital signal processing, it is shown how to draw upon existing techniques from the signal processing literature to derive regular iterative algorithms for determining the transitive closure of the graph. The regular iterative algorithms that are derived using these considerations, are then analyzed and synthesized on mesh-connected processor arrays. Among the vast number of mesh-connected processor arrays that can be designed using this unified approach, the systolic arrays reported in the literature for this problem are shown to be special cases.

Rao, S. K.↗

A framework for discrete optimization of stellarator coils

Designing magnets for three-dimensional plasma confinement is a key task for advancing the stellarator as a fusion reactor concept. Stellarator magnets must produce an accurate field while leaving adequate room for other components and being reasonably simple to construct and assemble. In this paper, a framework for coil design and optimization is introduced that enables the attainment of sparse magnet solutions with arbitrary restrictions on where coils may be located. The solution space is formulated as a 'wireframe' consisting of a mesh of interconnected wire segments enclosing the plasma. Two methods are developed for optimizing the current distribution on a wireframe: Regularized Constrained Least Squares, which uses a linear least-squares approach to optimize the currents in each segment, and Greedy Stellarator Coil Optimization, a fully discrete procedure in which loops of current are added to the mesh one by one to achieve the desired magnetic field on the plasma boundary. Examples are presented of solutions obtainable with each method, some of which achieve high field accuracy while obeying spatial constraints that permit easy assembly.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fast, Nondestructive and Precise Biomass Measurements Are Possible Using Lidar-Based Convex Hull and Voxelization Algorithms

Light detection and ranging (lidar) scanning tools are available that can make rapid digital estimations of biomass. Voxelization and convex hull are two algorithms used to calculate the volume of the scanned plant canopy, which is correlated with biomass, often the primary trait of interest. Voxelization splits the scans into regular-sized cubes, or voxels, whereas the convex hull algorithm creates a polygon mesh around the outermost points of the point cloud and calculates the volume within that mesh. In this study, digital estimates of biomass were correlated against hand-harvested biomass for field-grown corn, broom corn, and energy sorghum. Voxelization (r = 0.92) and convex hull (r = 0.95) both correlated well with plant dry biomass. Lidar data were also collected in a large breeding trial with nearly 900 genotypes of energy sorghum. In contrast to the manual harvest studies, digital biomass estimations correlated poorly with yield collected from a forage harvester for both voxel count (r = 0.32) and convex hull volume (r = 0.39). However, further analysis showed that the coefficient of variation (CV, a measure of variability) for harvester-based estimates of biomass was greater than the CV of the voxel and convex-hull-based biomass estimates, indicating that poor correlation was due to harvester imprecision, not digital estimations. Overall, results indicate that the lidar-based digital biomass estimates presented here are comparable or more precise than current approaches.

Environmental Sciences & Ecology↗

Generation of a crowned pinion tooth surface by a plane

The topology of a crowned spur pinion tooth surface that reduces the level of transmission errors due to misalignment is described. The geometry of the modified pinion tooth surface and of the regular involute gear tooth surface is discussed. The tooth contact analysis between the meshing surfaces is also described. Generating a modified pinion tooth surface by a plane whose motion is controlled by a 5-degree-of-freedom system is investigated. The numerical results included indicate that the transmission error remains low as the gears are misaligned.

Litvin, F. L.↗

Extending HPF for advanced data parallel applications

The stated goal of High Performance Fortran (HPF) was to 'address the problems of writing data parallel programs where the distribution of data affects performance'. After examining the current version of the language we are led to the conclusion that HPF has not fully achieved this goal. While the basic distribution functions offered by the language - regular block, cyclic, and block cyclic distributions - can support regular numerical algorithms, advanced applications such as particle-in-cell codes or unstructured mesh solvers cannot be expressed adequately. We believe that this is a major weakness of HPF, significantly reducing its chances of becoming accepted in the numeric community. The paper discusses the data distribution and alignment issues in detail, points out some flaws in the basic language, and outlines possible future paths of development. Furthermore, we briefly deal with the issue of task parallelism and its integration with the data parallel paradigm of HPF.

Chapman, Barbara↗

Slot spiral antenna modeling using hybrid/mixed FE-BI technique

This report is concerned with the numerical simulation of the printed slot spiral antenna (SSA) using the finite element - boundary integral (FE-BI) analysis. It has been reported that the FE-BI technique is suited for modeling microstrip patch antennas of any shape, printed on layered planar structure or cylindrical platform and fed with a coaxial cable or a microstripline network underneath the radiating elements. However, direct application of the hybrid FE-BI technique to thin slot spirals requires excessive sampling rates to accurately simulate the geometry. To alleviate the meshing/modeling difficulties encountered with cavity-backed slot antennas, we describe a mixed finite element-boundary integral formulation. As in the past, the boundary integral is used to describe the radiation of the slot above the cavity. However the cavity is now modeled using a suitable mix of edge and node elements. The latter are used only at the aperture of the thin slot so that the nodes follow the center line of the slot. In this manner, regular size elements can be used regardless of the slot's width and any meshing restrictions are substantially relaxed. The proposed mixed element FE-BI formulation introduces three different computational regions and as expected this complicates the generation of the discrete system.

Gong, Jian↗

Wavelet-based local mesh refinement for rainfall–runoff simulations

A wavelet-based local mesh refinement (wLMR) strategy is designed to generate multiresolution and unstructured triangular meshes from real digital elevation model (DEM) data for efficient hydrological simulations at the catchment scale. The wLMR strategy is studied considering slope- and curvature-based refinement criteria to analyze DEM inputs: the slope-based criterion uses bed elevation data as input to the wLMR strategy, whereas the curvature-based criterion feeds the bed slope data into it. The performance of the wLMR meshes generated by these two criteria is compared for hydrological simulations; first, using three analytical tests with the systematic variation in topography types and then by reproducing laboratory- and real-scale case studies. The bed elevation on the wLMR meshes and their simulation results are compared relative to those achieved on the finest uniform mesh. Repeated analytical tests show that the slope- and curvature-based criteria are equally effective with the wLMR strategy, and that it is easier to decide which criterion to take in relation to the (regular) shape of the topography. For the realistic case studies: (i) slope analysis provides a better metric to assess the correlation of a wLMR mesh to the fine uniform mesh and (ii) both criteria predict outlet hydrographs with a close predictive accuracy to that on the uniform mesh, but the curvature-based criterion is found to slightly better capture the channeling patterns of real DEM data.

54 ENVIRONMENTAL SCIENCES↗

Self-Avoiding Walks Over Adaptive Triangular Grids

Space-filling curves is a popular approach based on a geometric embedding for linearizing computational meshes. We present a new O(n log n) combinatorial algorithm for constructing a self avoiding walk through a two dimensional mesh containing n triangles. We show that for hierarchical adaptive meshes, the algorithm can be locally adapted and easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.

Heber, Gerd↗