Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured Mesh”

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 1,099 records · Page 61

Category 5 problem solution using an unstructured finite volume algorithm

For the simulation of flows with complex geometries, unstructured finite volume methods have proven to be very popular, and simulations of a large number of flows have been done with good results using this approach. Since most of the simulations to date were done for steady flows, it is not clear that present unstructured finite volume algorithms can accurately track the unsteady propagation of acoustic waves in a computation. Therefore, there is a need to assess the accuracy of these methods for acoustic calculations. In this paper, we perform the numerical simulation of a very small amplitude acoustic wave incident on the non-uniform steady flow in a quasi- 1 D convergent-divergent nozzle using an unstructured finite volume algorithm with piece-wise linear, least square reconstruction, Roe flux difference splitting, and second-order MacCormack time marching. First, the spatial accuracy of the algorithm is evaluated for the steady flow by running the simulation with a sequence of successively finer meshes. Then the unsteady numerical solution with the acoustic perturbation is presented.

Bui, Trong T.↗

Algorithms for the automatic generation of 2-D structured multi-block grids

Two different approaches to the fully automatic generation of structured multi-block grids in two dimensions are presented. The work aims to simplify the user interactivity necessary for the definition of a multiple block grid topology. The first approach is based on an advancing front method commonly used for the generation of unstructured grids. The original algorithm has been modified toward the generation of large quadrilateral elements. The second method is based on the divide-and-conquer paradigm with the global domain recursively partitioned into sub-domains. For either method each of the resulting blocks is then meshed using transfinite interpolation and elliptic smoothing. The applicability of these methods to practical problems is demonstrated for typical geometries of fluid dynamics.

Schoenfeld, Thilo↗

A Framework for Parallel Unstructured Grid Generation for Complex Aerodynamic Simulations

A framework for parallel unstructured grid generation targeting both shared memory multi-processors and distributed memory architectures is presented. The two fundamental building-blocks of the framework consist of: (1) the Advancing-Partition (AP) method used for domain decomposition and (2) the Advancing Front (AF) method used for mesh generation. Starting from the surface mesh of the computational domain, the AP method is applied recursively to generate a set of sub-domains. Next, the sub-domains are meshed in parallel using the AF method. The recursive nature of domain decomposition naturally maps to a divide-and-conquer algorithm which exhibits inherent parallelism. For the parallel implementation, the Master/Worker pattern is employed to dynamically balance the varying workloads of each task on the set of available CPUs. Performance results by this approach are presented and discussed in detail as well as future work and improvements.

Zagaris, George↗

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↗

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.

Sohn, Andrew↗

LAVA Voronoi Mesher for Wall-Modeled Large-Eddy Simulations

The unstructured Voronoi mesher currently being developed within the Launch, Ascent, and Vehicle Aerodynamics (LAVA) software framework at NASA Ames Research Center is described in detail. The discussions include, but are not limited to, the strategies used in the seeding and smoothing phases to ensure a high-quality mesh for Wall-Modeled Large-Eddy Simulations (WMLES), the methods behind the cell clipping algorithm responsible for conforming the mesh to a complex geometry, and the approach to create a global mesh from the distinct Voronoi cells. Applications and benefits of the Voronoi meshing approach are also presented. The automated meshing paradigm introduced was able to significantly reduce the time necessary to create a high-quality mesh around a complex geometry when compared against the current LAVA curvilinear overset meshing standard. For example, the task of generating a single mesh around the high-lift common research model requires the full dedication of a mesh generation expert for a period between one and two months. A family of meshes with different refinement levels up to six hundred million cells can be generated by a single engineer in a day or two. This technology has the potential for decreasing the turnaround time for conducting WMLES around complex geometries, as well as facilitating comprehensive mesh refinement studies.

Victor C B Sousa↗

A scalable design of experiments framework for optimal sensor placement

Here, we present a scalable design of an experiments framework for sensor placement in systems described by partial differential equations (PDEs). In particular, we aim to compute optimal sensor locations by minimizing the uncertainty of parameters estimated from Bayesian inverse problems and where the system. The resulting problem is a computationally intractable mixed-integer nonlinear program constrained by PDEs. We approach this problem with two heuristics used in compressed sensing and optimal control literature: a sparsity-inducing approach and a sum-up rounding approach. We also investigate metrics to guide the design of experiments (the total flow variance and the A-optimal design criterion) and analyze the effect of different noise structures (white and colored). Using an application in natural gas pipelines, we conclude that the sum-up rounding approach approach gives the best results and produces shrinking gaps with increasing mesh resolution. We also observe that convergence for the white noise measurement error case is slower than for the colored noise case. For A-optimal design, the solution is close to a uniform distribution of sensors along the pipeline while for the flow variance design the distribution is unstructured.

42 ENGINEERING↗

Parallel 3D Mortar Element Method for Adaptive Nonconforming Meshes

High order methods are frequently used in computational simulation for their high accuracy. An efficient way to avoid unnecessary computation in smooth regions of the solution is to use adaptive meshes which employ fine grids only in areas where they are needed. Nonconforming spectral elements allow the grid to be flexibly adjusted to satisfy the computational accuracy requirements. The method is suitable for computational simulations of unsteady problems with very disparate length scales or unsteady moving features, such as heat transfer, fluid dynamics or flame combustion. In this work, we select the Mark Element Method (MEM) to handle the non-conforming interfaces between elements. A new technique is introduced to efficiently implement MEM in 3-D nonconforming meshes. By introducing an "intermediate mortar", the proposed method decomposes the projection between 3-D elements and mortars into two steps. In each step, projection matrices derived in 2-D are used. The two-step method avoids explicitly forming/deriving large projection matrices for 3-D meshes, and also helps to simplify the implementation. This new technique can be used for both h- and p-type adaptation. This method is applied to an unsteady 3-D moving heat source problem. With our new MEM implementation, mesh adaptation is able to efficiently refine the grid near the heat source and coarsen the grid once the heat source passes. The savings in computational work resulting from the dynamic mesh adaptation is demonstrated by the reduction of the the number of elements used and CPU time spent. MEM and mesh adaptation, respectively, bring irregularity and dynamics to the computer memory access pattern. Hence, they provide a good way to gauge the performance of computer systems when running scientific applications whose memory access patterns are irregular and unpredictable. We select a 3-D moving heat source problem as the Unstructured Adaptive (UA) grid benchmark, a new component of the NAS Parallel Benchmarks (NPB). In this paper, we present some interesting performance results of ow OpenMP parallel implementation on different architectures such as the SGI Origin2000, SGI Altix, and Cray MTA-2.

Feng, Huiyu↗

Parallel Higher-order Finite Element Method for Accurate Field Computations in Wakefield and PIC Simulations

Over the past years, SLAC's Advanced Computations Department (ACD), under SciDAC sponsorship, has developed a suite of 3D (2D) parallel higher-order finite element (FE) codes, T3P (T2P) and Pic3P (Pic2P), aimed at accurate, large-scale simulation of wakefields and particle-field interactions in radio-frequency (RF) cavities of complex shape. The codes are built on the FE infrastructure that supports SLAC's frequency domain codes, Omega3P and S3P, to utilize conformal tetrahedral (triangular)meshes, higher-order basis functions and quadratic geometry approximation. For time integration, they adopt an unconditionally stable implicit scheme. Pic3P (Pic2P) extends T3P (T2P) to treat charged-particle dynamics self-consistently using the PIC (particle-in-cell) approach, the first such implementation on a conformal, unstructured grid using Whitney basis functions. Examples from applications to the International Linear Collider (ILC), Positron Electron Project-II (PEP-II), Linac Coherent Light Source (LCLS) and other accelerators will be presented to compare the accuracy and computational efficiency of these codes versus their counterparts using structured grids.

43 PARTICLE ACCELERATORS↗

An adaptive finite element method for high speed flows

The solution of the equations of compressible high speed flow, on unstructured triangular grids in 2D and tetrahedral grids in 3D, is considered. Solution methods based upon both Taylor-Galerkin and Runge-Kutta time-stepping techniques are presented and the incorporation of the ideas of flux corrected transport (FCT) is discussed. These methods are combined with an adaptive mesh regeneration procedure and are employed in the solution of several examples, consisting of Euler flows in both 2D and 3D and Navier-Stokes flows in 2D.

Peraire, J.↗

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↗

Adjoint-Based Algorithms for Adaptation and Design Optimizations on Unstructured Grids

Schemes based on discrete adjoint algorithms present several exciting opportunities for significantly advancing the current state of the art in computational fluid dynamics. Such methods provide an extremely efficient means for obtaining discretely consistent sensitivity information for hundreds of design variables, opening the door to rigorous, automated design optimization of complex aerospace configuration using the Navier-Stokes equation. Moreover, the discrete adjoint formulation provides a mathematically rigorous foundation for mesh adaptation and systematic reduction of spatial discretization error. Error estimates are also an inherent by-product of an adjoint-based approach, valuable information that is virtually non-existent in today's large-scale CFD simulations. An overview of the adjoint-based algorithm work at NASA Langley Research Center is presented, with examples demonstrating the potential impact on complex computational problems related to design optimization as well as mesh adaptation.

Nielsen, Eric J.↗

Direct Numerical Simulation of Acoustic Waves Interacting with a Shock Wave in a Quasi-1D Convergent-Divergent Nozzle Using an Unstructured Finite Volume Algorithm

Numerical simulation of a very small amplitude acoustic wave interacting with a shock wave in a quasi-1D convergent-divergent nozzle is performed using an unstructured finite volume algorithm with a piece-wise linear, least square reconstruction, Roe flux difference splitting, and second-order MacCormack time marching. First, the spatial accuracy of the algorithm is evaluated for steady flows with and without the normal shock by running the simulation with a sequence of successively finer meshes. Then the accuracy of the Roe flux difference splitting near the sonic transition point is examined for different reconstruction schemes. Finally, the unsteady numerical solutions with the acoustic perturbation are presented and compared with linear theory results.

Bui, Trong T.↗

QuadConv: Quadrature-based convolutions with applications to non-uniform PDE data compression

We present a new convolution layer for deep learning architectures which we call QuadConv — an approximation to continuous convolution via quadrature. Our operator is developed explicitly for use on non-uniform, mesh-based data, and accomplishes this by learning a continuous kernel that can be sampled at arbitrary locations. Moreover, the construction of our operator admits an efficient implementation which we detail and construct. As an experimental validation of our operator, we consider the task of compressing partial differential equation (PDE) simulation data from fixed meshes. Here, we show that QuadConv can match the performance of standard discrete convolutions on uniform grid data by comparing a QuadConv autoencoder (QCAE) to a standard convolutional autoencoder (CAE). Further, we show that the QCAE can maintain this accuracy even on non-uniform data. In both cases, QuadConv also outperforms alternative unstructured convolution methods such as graph convolution.

Compression↗

Predicting large-scale pool fire dynamics using an unsteady flamelet- and large-eddy simulation-based model suite

A low-Mach, unstructured, large-eddy-simulation-based, unsteady flamelet approach with a generalized heat loss combustion methodology (including soot generation and consumption mechanisms) is deployed to support a large-scale, quiescent, 5-m JP-8 pool fire validation study. The quiescent pool fire validation study deploys solution sensitivity procedures, i.e., the effect of mesh and time step refinement on capturing key fire dynamics such as fingering and puffing, as mesh resolutions approach O(1) cm. A novel design-order, discrete-ordinate-method discretization methodology is established by use of an analytical thermal/participating media radiation solution on both low-order hexahedral and tetrahedral mesh topologies in addition to quadratic hexahedral elements. Here, the coupling between heat losses and the flamelet thermochemical state is achieved by augmenting the unsteady flamelet equation set with a heat loss source term. Soot and radiation source terms are determined using flamelet approaches for the full range of heat losses experienced in fire applications including radiative extinction. The proposed modeling and simulation paradigm are validated using pool surface radiative heat flux, maximum centerline temperature location, and puffing frequency data, all of which are predicted within 10% accuracy. Simulations demonstrate that under-resolved meshes predict an overly conservative radiative heat flux magnitude with improved comparisons as compared to a previously deployed hybrid Reynolds-averaged Navier–Stokes/eddy dissipation concept-based methodology.

42 ENGINEERING↗

Subsonic Analysis of 0.04-Scale F-16XL Models Using an Unstructured Euler Code

The subsonic flow field about an F-16XL airplane model configuration was investigated with an inviscid unstructured grid technique. The computed surface pressures were compared to wind-tunnel test results at Mach 0.148 for a range of angles of attack from 0 deg to 20 deg. To evaluate the effect of grid dependency on the solution, a grid study was performed in which fine, medium, and coarse grid meshes were generated. The off-surface vortical flow field was locally adapted and showed improved correlation to the wind-tunnel data when compared to the nonadapted flow field. Computational results are also compared to experimental five-hole pressure probe data. A detailed analysis of the off-body computed pressure contours, velocity vectors, and particle traces are presented and discussed.

Lessard, Wendy B.↗

Unstructured Grid Development for the Space Launch System Liftoff and Transition Lineloads Computational Analysis

Production of aerodynamic lineloads databases for the Space Launch System (SLS) vehicle at Liftoff and Transition (LOT) conditions has required the development of a Computational Fluid Dynamics (CFD) workflow capable of producing high-quality solutions for this unique phase of flight. Aerodynamic considerations included a wide range of flow angles (from 0°up to 90°total angle of attack), resulting leeside separation, and interaction effects between the three bodies of the integrated SLS vehicle, as well as the nearby launch tower. Computational mesh development for similar problems at the NASA Langley Research Center (such as for the Constellation/Ares launch vehicles) has primarily relied on in-house tools such as VGRID/POSTGRID, with grids designed for NASA-developed and maintained flow solvers such as USM3D and FUN3D. The workflow for such problems has evolved over the development of the various SLS configurations to incorporate new tools such as the Heldenpatch/Heldenmesh grid generator (Helden Aerospace) and CREATE-AV Kestrel (US Department of Defense) flow solver. This paper describes efforts to benchmark a grid generation approach for LOT problems using Heldenpatch/Heldenmesh and Kestrel, verified against prior best practices from VGRID/POSTGRID. Parameters studied include surface grid density, first-layer viscous cell height, and volume grid growth rate parameters. Resulting solutions are compared based on total force and moment values, sectional line loads, and surface pressures, all validated against existing wind tunnel aerodynamic databases where available for the SLS Block 1B Cargo configuration.

Space launch systems↗

Continuously bounds-preserving discontinuous Galerkin methods for hyperbolic conservation laws

For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are typically performed at discrete nodal locations, which is not sufficient to ensure the robustness of the scheme when the solution must be evaluated at arbitrary locations (e.g., for adaptive mesh refinement, remapping in arbitrary Lagrangian–Eulerian solvers, overset meshes, etc.). In this work, a novel limiting approach for discontinuous Galerkin methods is presented which ensures that the solution is continuously bounds-preserving (i.e., across the entire solution polynomial) for any arbitrary choice of basis, approximation order, and mesh element type. Through a modified formulation for the constraint functionals, the proposed approach requires only the solution of a single spatial scalar minimization problem per element for which a highly efficient numerical optimization procedure is presented. Here, the efficacy of this approach is shown in numerical experiments by enforcing continuous constraints in high-order unstructured discontinuous Galerkin discretizations of hyperbolic conservation laws, ranging from scalar transport with maximum principle preserving constraints to compressible gas dynamics with positivity-preserving constraints.

97 MATHEMATICS AND COMPUTING↗