Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured”

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 55 records · Page 3

An assessment of unstructured grid technology for timely CFD analysis

An assessment of two unstructured methods is presented in this paper. A tetrahedral unstructured method USM3D, developed at NASA Langley Research Center is compared to a Cartesian unstructured method, SPLITFLOW, developed at Lockheed Fort Worth Company. USM3D is an upwind finite volume solver that accepts grids generated primarily from the Vgrid grid generator. SPLITFLOW combines an unstructured grid generator with an implicit flow solver in one package. Both methods are exercised on three test cases, a wing, and a wing body, and a fully expanded nozzle. The results for the first two runs are included here and compared to the structured grid method TEAM and to available test data. On each test case, the set up procedure are described, including any difficulties that were encountered. Detailed descriptions of the solvers are not included in this paper.

Kinard, Tom A.↗

Implicit schemes and parallel computing in unstructured grid CFD

The development of implicit schemes for obtaining steady state solutions to the Euler and Navier-Stokes equations on unstructured grids is outlined. Applications are presented that compare the convergence characteristics of various implicit methods. Next, the development of explicit and implicit schemes to compute unsteady flows on unstructured grids is discussed. Next, the issues involved in parallelizing finite volume schemes on unstructured meshes in an MIMD (multiple instruction/multiple data stream) fashion are outlined. Techniques for partitioning unstructured grids among processors and for extracting parallelism in explicit and implicit solvers are discussed. Finally, some dynamic load balancing ideas, which are useful in adaptive transient computations, are presented.

Venkatakrishnam, V.↗

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↗

Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations

One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. These algorithms are now used in the practical engineering design of devices such as cars and airplanes as well as theoretical studies of complex phenomena such as fluid turbulence. In past years, limited computer resources have motivated the development of efficient numerical methods in computational fluid dynamics (CFD) utilizing structured meshes. These meshes are comprised of systematic arrays of quadrilateral or hexahedral cells. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Structured meshes also permit the use of highly efficient solution techniques such as alternating direction implicit (ADI) iteration schemes or multigrid. Following the dramatic improvement in computing speed in recent years, emphasis has shifted towards the design of algorithms capable of treating complex geometries. The automatic generation of structured grids about complex geometries is problematic. Unstructured grids offer one promising alternative technique for treating these general geometries. Unstructured meshes have irregular connectivity and usually contain triangles and/or quadrilaterals in two dimensions and tetrahedra and/or hexahedra in three dimensions. The generation and use of unstructured grids poses new challenges in computational fluid dynamics. This is true for both grid generation as well as for the design of algorithms for flow solution. The purpose of these notes is to present recent developments in the unstructured grid generation and flow solution technology.

Barth, T. J.↗

Numerical Modeling of Spray Combustion with an Unstructured-Grid Method

The present unstructured-grid method follows strictly the basic finite volume forms of the conservation laws of the governing equations for the entire flow domain. High-order spatially accurate formulation has been employed for the numerical solutions of the Navier-Stokes equations. A two-equation k-epsilon turbulence model is also incorporated in the unstructured-grid solver. The convergence of the resulted linear algebraic equation is accelerated with preconditioned Conjugate Gradient method. A statistical spray combustion model has been incorporated into the present unstructured-grid solver. In this model, spray is represented by discrete particles, rather than by continuous distributions. A finite number of computational particles are used to predict a sample of total population of particles. Particle trajectories are integrated using their momentum and motion equations and particles exchange mass, momentum and energy with the gas within the computational cell in which they are located. The interaction calculations are performed simultaneously and eliminate global iteration for the two-phase momentum exchange. A transient spray flame in a high pressure combustion chamber is predicted and then the solution of liquid-fuel combusting flow with a rotating cup atomizer is presented and compared with the experimental data. The major conclusion of this investigation is that the unstructured-grid method can be employed to study very complicated flow fields of turbulent spray combustion. Grid adaptation can be easily achieved in any flow domain such as droplet evaporation and combustion zone. Future applications of the present model can be found in the full three-dimensional study of flow fields of gas turbine and liquid propulsion engine combustion chambers with multi-injectors.

Shang, H. M.↗

Out-of-Core Streamline Visualization on Large Unstructured Meshes

It's advantageous for computational scientists to have the capability to perform interactive visualization on their desktop workstations. For data on large unstructured meshes, this capability is not generally available. In particular, particle tracing on unstructured grids can result in a high percentage of non-contiguous memory accesses and therefore may perform very poorly with virtual memory paging schemes. The alternative of visualizing a lower resolution of the data degrades the original high-resolution calculations. This paper presents an out-of-core approach for interactive streamline construction on large unstructured tetrahedral meshes containing millions of elements. The out-of-core algorithm uses an octree to partition and restructure the raw data into subsets stored into disk files for fast data retrieval. A memory management policy tailored to the streamline calculations is used such that during the streamline construction only a very small amount of data are brought into the main memory on demand. By carefully scheduling computation and data fetching, the overhead of reading data from the disk is significantly reduced and good memory performance results. This out-of-core algorithm makes possible interactive streamline visualization of large unstructured-grid data sets on a single mid-range workstation with relatively low main-memory capacity: 5-20 megabytes. Our test results also show that this approach is much more efficient than relying on virtual memory and operating system's paging algorithms.

Ueng, Shyh-Kuang↗

Multi-Dimensional Spectral Difference Method for Unstructured Grids

A new, high-order, conservative, and efficient method for conservation laws on unstructured grids is developed. It combines the best features of structured and unstructured grid methods to attain computational efficiency and geometric flexibility; it utilizes the concept of discontinuous and high-order local representations to achieve conservation and high accuracy; and it is based on the finite-difference formulation for simplicity. Universal reconstructions are obtained by distributing unknowns in a geometrically similar manner for all unstructured cells. Placements of the unknown and flux points with various order of accuracy are given for the line, triangular and tetrahedral elements. The data structure of the new method permits an optimum use of cache memory, resulting in further computational efficiency on modern computers. A new pointer system is developed that reduces memory requirements and simplifies programming for any order of accuracy. Numerical solutions are presented and compared with the exact solutions for wave propagation problems in both two and three dimensions to demonstrate the capability of the method. Excellent agreement has been found. The method is simpler and more efficient than previous discontinuous Galerkin and spectral volume methods for unstructured grids.

Liu, Yen↗

Unstructured CFD and Noise Prediction Methods for Propulsion Airframe Aeroacoustics

Using unstructured mesh CFD methods for Propulsion Airframe Aeroacoustics (PAA) analysis has the distinct advantage of precise and fast computational mesh generation for complex propulsion and airframe integration arrangements that include engine inlet, exhaust nozzles, pylon, wing, flaps, and flap deployment mechanical parts. However, accurate solution values of shear layer velocity, temperature and turbulence are extremely important for evaluating the usually small noise differentials of potential applications to commercial transport aircraft propulsion integration. This paper describes a set of calibration computations for an isolated separate flow bypass ratio five engine nozzle model and the same nozzle system with a pylon. These configurations have measured data along with prior CFD solutions and noise predictions using a proven structured mesh method, which can be used for comparison to the unstructured mesh solutions obtained in this investigation. This numerical investigation utilized the TetrUSS system that includes a Navier-Stokes solver, the associated unstructured mesh generation tools, post-processing utilities, plus some recently added enhancements to the system. New features necessary for this study include the addition of two equation turbulence models to the USM3D code, an h-refinement utility to enhance mesh density in the shear mixing region, and a flow adaptive mesh redistribution method. In addition, a computational procedure was developed to optimize both solution accuracy and mesh economy. Noise predictions were completed using an unstructured mesh version of the JeT3D code.

Pao, S. Paul↗

More About the Tetrahedral Unstructured Software System

TetrUSS is a comprehensive suite of computational fluid dynamics (CFD) programs that won the Software of the Year award in 1996 and has found increasing use in government, academia, and industry for solving realistic flow problems (especially in aerodynamics and aeroelastics of aircraft having complex shapes). TetrUSS includes not only programs for solving basic equations of flow but also programs that afford capabilities for efficient generation and utilization of computational grids and for graphical representation of computed flows (see figure). The 2004 version of the Tetrahedral Unstructured Software System (TetrUSS), which is one of two software systems reported in "NASA s 2004 Software of the Year," NASA Tech Briefs, Vol. 28, No. 10 (October 2004), page 18, has been improved greatly since 1996. These improvements include (1) capabilities to simulate viscous flow by solving the Navier-Stokes equations on unstructured grids, (2) portability to personal computers from diverse manufacturers, (3) advanced models of turbulence, (4) a parallel-processing version of one of the unstructured-grid Navier-Stokes-equation-solving programs, and (5) advanced programs for generating unstructured grids.

Abdol-Hamid, Khaled S.↗

JIGSAW-GEO (1.0): Locally Orthogonal Staggered Unstructured Grid Generation for General Circulation Modelling on the Sphere

An algorithm for the generation of non-uniform, locally orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered VoronoiDelaunay meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric simulation, ocean-modelling and numerical weather prediction. Using a recently developed Frontal-Delaunay refinement technique, a method for the construction of high-quality unstructured spheroidal Delaunay triangulations is introduced. A locally orthogonal polygonal grid, derived from the associated Voronoi diagram, is computed as the staggered dual. It is shown that use of the Frontal-Delaunay refinement technique allows for the generation of very high-quality unstructured triangulations, satisfying a priori bounds on element size and shape. Grid quality is further improved through the application of hill-climbing-type optimisation techniques. Overall, the algorithm is shown to produce grids with very high element quality and smooth grading characteristics, while imposing relatively low computational expense. A selection of uniform and non-uniform spheroidal grids appropriate for high-resolution, multi-scale general circulation modelling are presented. These grids are shown to satisfy the geometric constraints associated with contemporary unstructured C-grid-type finite-volume models, including the Model for Prediction Across Scales (MPAS-O). The use of user-defined mesh-spacing functions to generate smoothly graded, non-uniform grids for multi-resolution-type studies is discussed in detail.

geophysical fluid dynamics↗

An efficient approach to unstructured mesh hydrodynamics on the cell broadband engine

Unstructured mesh physics for the Cell Broadband Engine (CBE) has received little or no attention to date, largely because the CBE architecture poses particular challenges for unstructured mesh algorithms. The most common SPU memory management strategies cannot be applied to the irregular memory access patterns of unstructured meshes, and the SPU vector instruction set does not support the indirect addressing needed by connectivity arrays. This paper presents an approach to unstructured mesh physics that addresses these challenges, by creating a new mesh data structure and reorganizing code to give efficient CBE performance. The approach is demonstrated on the FLAG production hydrodynamics code using standard test problems, and results show an average speedup of more than 5x over the original code.

99 GENERAL AND MISCELLANEOUS↗

An efficient approach to unstructured mesh hydrodynamics on the cell broadband engine (u)

Unstructured mesh physics for the Cell Broadband Engine (CBE) has received little or no attention to date, largely because the CBE architecture poses particular challenges for unstructured mesh algorithms. SPU memory management strategies such as data preloading cannot be applied to the irregular memory storage patterns of unstructured meshes; and the SPU vector instruction set does not support the indirect addressing needed by connectivity arrays. This paper presents an approach to unstructured mesh physics that addresses these challenges, by creating a new mesh data structure and reorganizing code to give efficient CBE performance. The approach is demonstrated on the FLAG production hydrodynamics code using standard test problems, and results show an average speedup of more than 5x over the original code.

99 GENERAL AND MISCELLANEOUS↗

MCNP6 and SERPENT2 Performances with Unstructured Mesh Geometry

Traditionally, Monte Carlo codes model a nuclear reactor by combinatorial geometry. In this model, volume primitives (e,g, spheres, cylinders, parallelepipeds...) are combined together by Boolean operations (e.g. union, intersection, and complement) and replicated by lattice definitions to build the core geometry. Recently, high performances computing platforms allowed using unstructured mesh geometry in Monte Carlo codes. When this option is chosen, any type of core geometry can be modeled since the restriction of using volume primitives is removed. In an unstructured mesh geometry, Boolean operations and lattice definitions are not used since each volume is defined by triangular surfaces (facets). This study focuses on two Monte Carlo codes: MCNP (version 6.1.1 beta) developed at Los Alamos National Laboratory since 1957 and written in FORTRAN90, C, and C++ (267,000 total source code lines), and SERPENT (version 2.1.27) developed at VTT Technical Research Centre since 2004 and written in C (195,000 total source code lines). These two codes follow different approaches for the unstructured mesh geometry modeling: MCNP uses ABAQUS format, whereas SERPENT uses the STL format. In the STL (STereoLithographic) geometry model only the surfaces of the volume are meshed; the interior part of the volumes is not meshed. In the STL geometry model, the whole geometry is defined by the sequence of SOLID and ENDSOLID sections. Each volume of the geometry must have a SOLID and ENDSOLID section. The STL file contains no information specifying the materials of the volumes. MCNP and SERPENT can model any kind of complicated geometry using unstructured meshes. MCNP and SERPENT use the ABAQUS and STL file formats, respectively. The STL file format does not have tetrahedrons and has only triangular facets on the volumes boundary. This allows SERPENT simulations to run 10 times faster than MCNP. However, if Monte Carlo results have to be coupled to thermal-hydraulics codes, the interior of the geometry volumes must be meshed, which may reduce SERPENT performances.

97 MATHEMATICS AND COMPUTING↗

An Efficient Algorithm for Mapping Imaging Data to 3D Unstructured Grids in Computational Biomechanics

Geometries for organ scale and multiscale simulations of organ function are now routinely derived from imaging data. However, medical images may also contain spatially heterogeneous information other than geometry that are relevant to such simulations either as initial conditions or in the form of model parameters. In this manuscript, we present an algorithm for the efficient and robust mapping of such data to imaging based unstructured polyhedral grids in parallel. We then illustrate the application of our mapping algorithm to three different mapping problems: 1) the mapping of MRI diffusion tensor data to an unstuctured ventricular grid; 2) the mapping of serial cyro-section histology data to an unstructured mouse brain grid; and 3) the mapping of CT-derived volumetric strain data to an unstructured multiscale lung grid. Execution times and parallel performance are reported for each case.

Einstein, Daniel R.↗

Proteasome-mediated protein degradation is enhanced by fusion ubiquitin with unstructured degron

Highlights: • We constructed a fusion protein comprising ubiquitin and Rpn4-derived unstructured region. • The fusion ubiquitin retained its function of polyubiquitination of target proteins. • The fusion ubiquitin induced more efficient proteasomal target degradation than wild-type ubiquitin. Methods to induce proteasomal degradation of unwanted proteins are valuable in biomedical studies and thus receive increasing attention. For efficient degradation, the proteasome requires both a ubiquitin tag, which delivers substrates to the proteasome, and an unstructured region, where the proteasome engages the substrate for unfolding and degradation. We fused two degron components into a single molecule to create a fusion protein comprising ubiquitin and Rpn4-derived unstructured region. We demonstrated that the fusion protein retained its function to polyubiquitinate target proteins, thereby inducing more efficient proteasomal target degradation than wild-type ubiquitin in vitro and in cells. These results provide novel strategies for robust degradation enhancement of polyubiquitinated proteins.

60 APPLIED LIFE SCIENCES↗

WENO schemes on arbitrary unstructured meshes for laminar, transitional and turbulent flows

This paper presents the development and implementation of weighted-essentially-non-oscillatory (WENO) schemes for viscous flows on arbitrary unstructured grids. WENO schemes up to fifth-order accurate have been implemented in conjunction with hybrid and non-hybrid unstructured grids. The schemes are investigated with reference to numerical and experimental results for the Taylor–Green vortex, as well as for laminar and turbulent flows around a sphere, and the turbulent shock-wave boundary layer interaction flow problem. The results show that the accuracy of the schemes depends on the arbitrariness of shape and orientation of the unstructured mesh elements, as well as the compactness of directional stencils. The WENO schemes provide a more accurate numerical framework compared to second-order and third-order total variation diminishing (TVD) methods, however, the fifth-order version of the schemes is computationally too expensive to make the schemes practically usable. On the other hand, the third-order variant offers an excellent numerical framework in terms of accuracy and computational cost compared to the fifth-order WENO and second-order TVD schemes. Parallelisation of the CFD code (henceforth labelled as UCNS3D), where the schemes have been implemented, shows that the present methods offer very good scalable performance.

42 ENGINEERING↗

A multiscale restriction-smoothed basis method for high contrast porous media represented on unstructured grids

A wide variety of multiscale methods have been proposed in the literature to reduce runtime and provide better scaling for the solution of Poisson-type equations modeling flow in porous media. We present a new multiscale restricted-smoothed basis (MsRSB) method that is designed to be applicable to both rectilinear grids and unstructured grids. Like many other multiscale methods, MsRSB relies on a coarse partition of the underlying fine grid and a set of local prolongation operators (multiscale basis functions) that map unknowns associated with the fine grid cells to unknowns associated with blocks in the coarse partition. These mappings are constructed by restricted smoothing: Starting from a constant, a localized iterative scheme is applied directly to the fine-scale discretization to compute prolongation operators that are consistent with the local properties of the differential operators. The resulting method has three main advantages: First of all, both the coarse and the fine grid can have general polyhedral geometry and unstructured topology. This means that partitions and good prolongation operators can easily be constructed for complex models involving high media contrasts and unstructured cell connections introduced by faults, pinch-outs, erosion, local grid refinement, etc. In particular, the coarse partition can be adapted to geological or flow-field properties represented on cells or faces to improve accuracy. Secondly, the method is accurate and robust when compared to existing multiscale methods and does not need expensive recomputation of local basis functions to account for transient behavior: Dynamic mobility changes are incorporated by continuing to iterate a few extra steps on existing basis functions. This way, the cost of updating the prolongation operators becomes proportional to the amount of change in fluid mobility and one reduces the need for expensive, tolerance-based updates. Finally, since the MsRSB method is formulated on top of a cell-centered, conservative, finite-volume method, it is applicable to any flow model in which one can isolate a pressure equation. Herein, we only discuss single and two-phase incompressible models. Compressible flow, e.g., as modeled by the black-oil equations, is discussed in a separate paper.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometric electrostatic particle-in-cell algorithm on unstructured meshes

We present a geometric particle-in-cell (PIC) algorithm on unstructured meshes for studying electrostatic perturbations with frequency lower than electron gyrofrequency in magnetized plasmas. In this method, ions are treated as fully kinetic particles and electrons are described by the adiabatic response. The PIC method is derived from a discrete variational principle on unstructured meshes. To preserve the geometric structure of the system, the discrete variational principle requires that the electric field is interpolated using Whitney 1-forms, the charge is deposited using Whitney 0-forms and the electric field is computed by discrete exterior calculus. The algorithm has been applied to study the ion Bernstein wave (IBW) in two-dimensional magnetized plasmas. The simulated dispersion relations of the IBW in a rectangular region agree well with theoretical results. In a two-dimensional circular region with fixed boundary condition, the spectrum and eigenmode structures of the IBW are obtained from simulations. We compare the energy conservation property of the geometric PIC algorithm derived from the discrete variational principle with that of previous PIC methods on unstructured meshes. The comparison shows that the new PIC algorithm significantly improves the energy conservation property.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗