SEARCH · Search NASA

Results for “unstructured data”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

NASA NTRS2014

USM3D Predictions of Supersonic Nozzle Flow

This study focused on the NASA Tetrahedral Unstructured Software System CFD code (USM3D) capability to predict supersonic plume flow. Previous studies, published in 2004 and 2009, investigated USM3D's results versus historical experimental data. This current study continued that comparison however focusing on the use of the volume souring to capture the shear layers and internal shock structure of the plume. This study was conducted using two benchmark axisymmetric supersonic jet experimental data sets. The study showed that with the use of volume sourcing, USM3D was able to capture and model a jet plume's shear layer and internal shock structure.

Carter, Melissa B.↗

NASA NTRS2015

Entropy Stable Wall Boundary Conditions for the Three-Dimensional Compressible Navier-Stokes Equations

Non-linear entropy stability and a summation-by-parts framework are used to derive entropy stable wall boundary conditions for the three-dimensional compressible Navier-Stokes equations. A semi-discrete entropy estimate for the entire domain is achieved when the new boundary conditions are coupled with an entropy stable discrete interior operator. The data at the boundary are weakly imposed using a penalty flux approach and a simultaneous-approximation-term penalty technique. Although discontinuous spectral collocation operators on unstructured grids are used herein for the purpose of demonstrating their robustness and efficacy, the new boundary conditions are compatible with any diagonal norm summation-by-parts spatial operator, including finite element, finite difference, finite volume, discontinuous Galerkin, and flux reconstruction/correction procedure via reconstruction schemes. The proposed boundary treatment is tested for three-dimensional subsonic and supersonic flows. The numerical computations corroborate the non-linear stability (entropy stability) and accuracy of the boundary conditions.

Parsani, Matteo↗

NASA NTRS1995

Methodology for simulation of unsteady flows to determine the time-dependent interference between stationary and moving boundaries

A new methodology is developed to simulate unsteady flows about prescribed and aerodynamically determined moving boundary problems. The method couples the fluid dynamics and rigid-body dynamics equations to capture the time-dependent interference between stationary and moving boundaries. The unsteady, compressible, inviscid (Euler) equations are solved on dynamic, unstructured grids by an explicit, finite-volume, upwind method. For efficiency, the grid adaptation is performed within a window around the moving object. The Eulerian equations of the rigid-body dynamics are solved by a Runge-Kutta method in a non-inertial frame of reference. The two-dimensional flow solver is validated by computing the flow past a sinusoidally-pitching airfoil and comparing these results with the experimental data. The overall methodology is used for two two-dimensional examples: the flow past an airfoil which is performing a three-degrees-of-freedom motion in a transonic freestream, and the free-fall of a store after separation from a wing-section. Then the unstructured mesh methodology is extended to three-dimensions to simulate unsteady flow past bodies in relative motion, where the trajectory is determined from the instantaneous aerodynamics. The flow solver and the adaptation scheme in three dimensions are validated by simulating the transonic, unsteady flow around a wing undergoing a forced, periodic, pitching motion, and comparing the results with the experimental data. To validate the trajectory code, the six-degrees-of-freedom motion of a store separating from a wing was computed using the experimentally determined force and moment fields, then comparing with an independently generated trajectory. Finally, the overall methodology was demonstrated by simulating the unsteady flowfield and the trajectory of a store dropped from a wing. The methodology, its computational cost notwithstanding, has proven to be accurate, automated, easy for dynamic gridding, and relatively efficient for the required man-hours.

Singh, Kamakhya Prasad↗

NASA NTRS1995

Flow simulations about steady-complex and unsteady moving configurations using structured-overlapped and unstructured grids

The limiting factor in simulating flows past realistic configurations of interest has been the discretization of the physical domain on which the governing equations of fluid flow may be solved. In an attempt to circumvent this problem, many Computational Fluid Dynamic (CFD) methodologies that are based on different grid generation and domain decomposition techniques have been developed. However, due to the costs involved and expertise required, very few comparative studies between these methods have been performed. In the present work, the two CFD methodologies which show the most promise for treating complex three-dimensional configurations as well as unsteady moving boundary problems are evaluated. These are namely the structured-overlapped and the unstructured grid schemes. Both methods use a cell centered, finite volume, upwind approach. The structured-overlapped algorithm uses an approximately factored, alternating direction implicit scheme to perform the time integration, whereas, the unstructured algorithm uses an explicit Runge-Kutta method. To examine the accuracy, efficiency, and limitations of each scheme, they are applied to the same steady complex multicomponent configurations and unsteady moving boundary problems. The steady complex cases consist of computing the subsonic flow about a two-dimensional high-lift multielement airfoil and the transonic flow about a three-dimensional wing/pylon/finned store assembly. The unsteady moving boundary problems are a forced pitching oscillation of an airfoil in a transonic freestream and a two-dimensional, subsonic airfoil/store separation sequence. Accuracy was accessed through the comparison of computed and experimentally measured pressure coefficient data on several of the wing/pylon/finned store assembly's components and at numerous angles-of-attack for the pitching airfoil. From this study, it was found that both the structured-overlapped and the unstructured grid schemes yielded flow solutions of comparable accuracy for these simulations. This study also indicated that, overall, the structured-overlapped scheme was slightly more CPU efficient than the unstructured approach.

Newman, James C., III↗

NASA NTRS2004

Transonic Drag Prediction on a DLR-F6 Transport Configuration Using Unstructured Grid Solvers

A second international AIAA Drag Prediction Workshop (DPW-II) was organized and held in Orlando Florida on June 21-22, 2003. The primary purpose was to inves- tigate the code-to-code uncertainty. address the sensitivity of the drag prediction to grid size and quantify the uncertainty in predicting nacelle/pylon drag increments at a transonic cruise condition. This paper presents an in-depth analysis of the DPW-II computational results from three state-of-the-art unstructured grid Navier-Stokes flow solvers exercised on similar families of tetrahedral grids. The flow solvers are USM3D - a tetrahedral cell-centered upwind solver. FUN3D - a tetrahedral node-centered upwind solver, and NSU3D - a general element node-centered central-differenced solver. For the wingbody, the total drag predicted for a constant-lift transonic cruise condition showed a decrease in code-to-code variation with grid refinement as expected. For the same flight condition, the wing/body/nacelle/pylon total drag and the nacelle/pylon drag increment predicted showed an increase in code-to-code variation with grid refinement. Although the range in total drag for the wingbody fine grids was only 5 counts, a code-to-code comparison of surface pressures and surface restricted streamlines indicated that the three solvers were not all converging to the same flow solutions- different shock locations and separation patterns were evident. Similarly, the wing/body/nacelle/pylon solutions did not appear to be converging to the same flow solutions. Overall, grid refinement did not consistently improve the correlation with experimental data for either the wingbody or the wing/body/nacelle pylon configuration. Although the absolute values of total drag predicted by two of the solvers for the medium and fine grids did not compare well with the experiment, the incremental drag predictions were within plus or minus 3 counts of the experimental data. The correlation with experimental incremental drag was not significantly changed by specifying transition. Although the sources of code-to-code variation in force and moment predictions for the three unstructured grid codes have not yet been identified, the current study reinforces the necessity of applying multiple codes to the same application to assess uncertainty.

Lee-Rausch, E. M.↗

NASA NTRSDate not supplied

Performance Optimization Methods for a Memory-Bound, Unstructured-Grid CFD Application on Massively Parallel GPU Platforms

Computational performance of the FUN3D unstructured-grid computational fluid dynamics (CFD) application on massively parallel GPU environments is memory-bound and highly dependent upon efficient reads from and atomic updates to the irregular cell-, edge-, and node-based data structures. In this talk, we present recent efforts into optimizing select performance-critical kernels on NVIDIA Tesla V100 and A100 GPUs and AMD CDNA MI100 GPUs. A novel use of L2 cache residency controls and asynchronous loads into on-chip shared memory are explored on the A100 GPU for the sparse iterative solver, which is dominated by mixed-precision, sparse matrix vector multiplication. Demonstrations show that these methods improve global memory bandwidth utilization by 13.5% on the A100 GPU. Several techniques are also presented that use registers and/or shared memory to facilitate array transposition and aggregation which combine to reduce the frequency and increase the cache efficiency of floating-point atomic updates to the irregular data structures. These methods are demonstrated to improve the kernel throughput by nearly 500% on select kernels on the AMD MI100 over atomic updates directly to global memory. Overall, both V100 and A100 GPUs outperformed the MI100 GPU on kernels dominated by double-precision atomic updates; however, the techniques demonstrated here reduced the performance gap and improved the MI100 performance.

GPU CPU unstructured CFD memory↗

NASA NTRS1990

Unstructured mesh methods for CFD

Mesh generation methods for Computational Fluid Dynamics (CFD) are outlined. Geometric modeling is discussed. An advancing front method is described. Flow past a two engine Falcon aeroplane is studied. An algorithm and associated data structure called the alternating digital tree, which efficiently solves the geometric searching problem is described. The computation of an initial approximation to the steady state solution of a given poblem is described. Mesh generation for transient flows is described.

Peraire, J.↗

DOE OSTI2024

Response of salt intrusion in a tidal estuary to regional climatic forcing

Abstract Salinity distribution in a large tidal estuary is subject to estuarine adjustment under the influences of multiple physical drivers such as freshwater pulses and sea level rise, and is crucial to upstream water quality, aquaculture, and ecosystem functions of the estuary. To better understand the estuarine salinity response to climate change, the unstructured-grid Finite Volume Community Ocean Model was implemented to simulate the salt intrusion in the Delaware Bay Estuary. The model was first validated by multiple observational data sets and subsequently applied in an idealized setting to examine the response of salt front to freshwater pulses in high flow conditions, followed by a long-term drought condition supported by a multi-decadal streamflow drought analysis in the estuary. The model results showed that after the freshwater pulses the salt front location moved further upstream with sea level rise. Under the simulated long-term drought condition, the adjustment timescale of salt intrusion varies nonlinearly with sea level rise. With a significant increase in sea level rise, the adjustment timescale starts to decrease. This shift suggests a transition into a different regime where the estuary becomes more stratified, as indicated by an increasing bulk Simpson number with rising sea levels.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Response Of Salt Intrusion In A Tidal Estuary To Regional Climatic Forcing (FVCOM Output for the baseline scenario)

Salinity distribution in a large tidal estuary is subject to estuarine adjustment under the influences of multiple physical drivers such as freshwater pulses and sea level rise, and is crucial to upstream water quality, aquaculture, and ecosystem functions of the estuary. To better understand the estuarine salinity response to climate change, the unstructured-grid Finite Volume Community Ocean Model was implemented to simulate the salt intrusion in the Delaware Bay Estuary. The model was first validated by multiple observational data sets and subsequently applied in an idealized setting to examine the response of salt front to freshwater pulses in high flow conditions, followed by a long-term drought condition supported by a multi-decadal streamflow drought analysis in the estuary. The model results showed that after the freshwater pulses the salt front location moved further upstream with sea level rise. Under the simulated long-term drought condition, the adjustment timescale of salt intrusion varies nonlinearly with sea level rise. With a significant increase in sea level rise, the adjustment timescale starts to decrease. This shift suggests a transition into a different regime where the estuary becomes more stratified, as indicated by an increasing bulk Simpson number with rising sea levels. These findings have been summarized into a journal manuscript. The data included in this information release request are FVCOM model output associated with the numerical simulations described in the journal manuscript.

Liu, Jinliang↗

NASA NTRS1995

Implementation of a parallel unstructured Euler solver on the CM-5

An efficient unstructured 3D Euler solver is parallelized on a Thinking Machine Corporation Connection Machine 5, distributed memory computer with vectoring capability. In this paper, the single instruction multiple data (SIMD) strategy is employed through the use of the CM Fortran language and the CMSSL scientific library. The performance of the CMSSL mesh partitioner is evaluated and the overall efficiency of the parallel flow solver is discussed.

Morano, Eric↗

NASA NTRS1996

A User's Guide to AMR1D: An Instructional Adaptive Mesh Refinement Code for Unstructured Grids

This report documents the code AMR1D, which is currently posted on the World Wide Web (http://sdcd.gsfc.nasa.gov/ESS/exchange/contrib/de-fainchtein/adaptive _mesh_refinement.html). AMR1D is a one-dimensional finite element fluid-dynamics solver, capable of adaptive mesh refinement (AMR). It was written as an instructional tool for AMR on unstructured mesh codes. It is meant to illustrate the minimum requirements for AMR on more than one dimension. For that purpose, it uses the same type of data structure that would be necessary on a two-dimensional AMR code (loosely following the algorithm described by Lohner).

deFainchtein, Rosalinda↗

NASA NTRS2011

Fundamental Aeronautics Program. Subsonic Rotary Wing Project: SRW Aeromechanics Overview/UH-60 Airloads Wind Tunnel Test Summary

Objectives: a) Advance the understanding of phenomena in aerodynamics, dynamics, and active control of rotorcraft. b) Develop and validate first-principles tools. c) Acquire data for tool validation from small and large-scale testing of existing and novel rotorcraft configurations. Recent Accomplishments include: (CFD) - Made significant improvements in structured and unstructured rotorcraft CFD methods (OVERFLOW and FUN3D). (Icing) - a) Continued development of high-fidelity icing analysis tools. b) Completed test of oscillating airfoil in Icing Research Tunnel (IRT). c) Developed plans and began detailed preparations for subscale rotor test in IRT.

Norman, Thomas R.↗

NASA NTRS2014

Grid-Adapted FUN3D Computations for the Second High Lift Prediction Workshop

Contributions of the unstructured Reynolds-averaged Navier-Stokes code FUN3D to the 2nd AIAA CFD High Lift Prediction Workshop are described, and detailed comparisons are made with experimental data. Using workshop-supplied grids, results for the clean wing configuration are compared with results from the structured code CFL3D Using the same turbulence model, both codes compare reasonably well in terms of total forces and moments, and the maximum lift is similarly over-predicted for both codes compared to experiment. By including more representative geometry features such as slat and flap brackets and slat pressure tube bundles, FUN3D captures the general effects of the Reynolds number variation, but under-predicts maximum lift on workshop-supplied grids in comparison with the experimental data, due to excessive separation. However, when output-based, off-body grid adaptation in FUN3D is employed, results improve considerably. In particular, when the geometry includes both brackets and the pressure tube bundles, grid adaptation results in a more accurate prediction of lift near stall in comparison with the wind-tunnel data. Furthermore, a rotation-corrected turbulence model shows improved pressure predictions on the outboard span when using adapted grids.

Lee-Rausch, E. M.↗

NASA NTRS1996

Impact of Load Balancing on Unstructured Adaptive Grid Computations for Distributed-Memory Multiprocessors

The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn, requires significant data movement at runtime. We present a new dynamic load-balancing framework, called JOVE, that balances the workload across all processors with a global view. Whenever the computational mesh is adapted, JOVE is activated to eliminate the load imbalance. JOVE has been implemented on an IBM SP2 distributed-memory machine in MPI for portability. Experimental results for two model meshes demonstrate that mesh adaption with load balancing gives more than a sixfold improvement over one without load balancing. We also show that JOVE gives a 24-fold speedup on 64 processors compared to sequential execution.

Biswas, Rupak↗

NASA NTRS1996

Impact of Load Balancing on Unstructured Adaptive Grid Computations for Distributed-Memory Multiprocessors

Sohn, Andrew↗

DOE OSTI2024

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗

NASA NTRS1991

Three dimensional unstructured multigrid for the Euler equations

The three-dimensional Euler equations are solved on unstructured tetrahedral meshes using a multigrid strategy. The driving algorithm consists of an explicit vertex-based finite-element scheme, which employs an edge-based data-structure to assemble the residuals. The multigrid approach employs a sequence of independently generated coarse and fine meshes to accelerate the convergence to steady-state of the fine grid solution. Variables, residuals and corrections are passed back and forth between the various grids of the sequence using linear interpolation. The addresses and weights for interpolation are determined in a preprocessing stage using an efficient graph traversal algorithm. The preprocessing operation is shown to require a negligible fraction of the CPU time required by the overall solution procedure, while gains in overall solution efficiencies greater than an order of magnitude are demonstrated on meshes containing up to 350,000 vertices. Solutions using globally regenerated fine meshes as well as adaptively refined meshes are given.

Mavriplis, D. J.↗

NASA NTRS1990

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