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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Multigrid solution of the Navier-Stokes equations on triangular meshes

A new Navier-Stokes algorithm for use on unstructured triangular meshes is presented. Spatial discretization of the governing equations is achieved using a finite-element Galerkin approximation, which can be shown to be equivalent to a finite-volume approximation for regular equilateral triangular meshes. Integration to steady-state is performed using a multistage time-stepping scheme, and convergence is accelerated by means of implicit residual smoothing and an unstructured multigrid algorithm. The convergence efficiency of the present method is shown to be competitive with those demonstrated by structured quadrilateral-mesh algorithms.

Mavriplis, D. J.↗
NASA NTRS2020

Verification of Anisotropic Mesh Adaptation for Turbulent Simulations over ONERA M6 Wing

Unstructured anisotropic mesh adaptation is known to be an efficient way to control discretization errors in Computational Fluid Dynamics (CFD) simulations. Method verification is required to provide the confidence for routine use in production analysis. The current work aims at verification of anisotropic mesh adaptation for RANS simulations over the ONERA M6 wing. The present verification study is performed using four different flow solvers, three different implementations of the metric field, and three mesh mechanics packages. Two of the flow solvers use stabilized finite-element discretizations (FUN3D-SFE and GGNS), one uses finite-volume discretization (FUN3D-FV), and the last one uses mixed finite-volume and finite element discretizations (Wolf). The mesh adaptation is based on an error estimator that aims to control the quadratic error term in the linear interpolation of Mach number. Two sets of adaptations were performed; the first one controls the interpolation error in L2 norm and the second one controls the interpolation error in L4 norm. Convergence studies were performed on the forces and the pitching moment using all four solvers, and the results are compared with previously verified convergence studies on fixed (nonadapted) meshes. Both forces and pitching moment on adapted meshes are found to be converging to the fine mesh values faster than those on fixed meshes. In addition to forces and moments, convergence of surface pressure and skin friction coefficients at various measurement locations on the wing are also presented. Adapted-mesh surface pressure distributions agree with the fine fixed mesh pressure distributions. Adapted-mesh skin friction distributions contain high frequency noise with mean values approaching the fixed mesh pressure skin friction distributions.

Aravind Balan↗
NASA NTRS1988

Adaptive mesh generation for viscous flows using Delaunay triangulation

A method for generating an unstructured triangular mesh in two dimensions, suitable for computing high Reynolds number flows over arbitrary configurations is presented. The method is based on a Delaunay triangulation, which is performed in a locally stretched space, in order to obtain very high aspect ratio triangles in the boundary layer and the wake regions. It is shown how the method can be coupled with an unstructured Navier-Stokes solver to produce a solution adaptive mesh generation procedure for viscous flows.

Mavriplis, Dimitri J.↗
NASA NTRS1988

Adaptive mesh generation for viscous flows using Delaunay triangulation

A method for generating an unstructured triangular mesh in two dimensions, suitable for computing high Reynolds number flows over arbitrary configurations is presented. The method is based on a Delaunay triangulation, which is performed in a locally stretched space, in order to obtain very high aspect ratio triangles in the boundary layer and the wake regions. It is shown how the method can be coupled with an unstructured Navier-Stokes solver to produce a solution adaptive mesh generation procedure for viscous flows.

Mavriplis, Dimitri J.↗
NASA NTRS1990

Adaptive mesh generation for viscous flows using Delaunay triangulation

A method for generating an unstructured triangular mesh in two dimensions, suitable for computing high Reynolds number flows over arbitrary configurations is presented. The method is based on a Delaunay triangulation, which is performed in a locally stretched space, in order to obtain very high aspect ratio triangles in the boundary layer and the wake regions. It is shown how the method can be coupled with an unstructured Navier-Stokes solver to produce a solution adaptive mesh generation procedure for viscous flows.

Mavriplis, Dimitri J.↗
NASA NTRS1993

Three-dimensional unstructured grid method applied to turbomachinery

This work has three objectives: to develop a three-dimensional flow solver based on unstructured tetrahedral meshes for turbomachinery flows; to validate the solver through comparisons with experimental data; and to apply the solver for better understanding of the flow through turbomachinery geometries and design improvement. The work followed three different approaches: an existing external flow solver/grid generator (USM3D/VGRID) was extensively modified for internal flows; a three-dimensional, finite-volume solver based on Roe's flux-difference splitting and explicit Runge-Kutta time stepping; and three-dimensional unstructured tetrahedral mesh generation using an advancing-front technique. A discussion of these topics is presented in viewgraph form.

Oh Joon Kwon↗
DOE OSTI2025

Magnetic mesh generation and field line reconstruction for scrape-off layer and divertor modeling in stellarators

The design of divertor targets and baffles for optimal heat and particle exhaust from magnetically confined fusion plasmas requires a combination of fast, low-fidelity models (such as EMC3-Lite (Feng 2022 Plasma Phys. Control. Fusion 64 125012)) for scoping studies and high-fidelity ones (such as EMC3-EIRENE (Feng et al 2014 Contrib. Plasma Phys. 54 426–31)) for verification. Both of those approaches benefit from a magnetic flux tube mesh for fast interpolation and mapping of field line segments (Feng et al 2005 Phys. Plasmas 12 052505). A new automated mesh generator for unstructured quadrilateral flux tubes with adaptive refinement is presented and integrated into FLARE (Frerichs 2024 Nucl. Fusion 64 106034). For HSX with an extended first wall, it is found that several layers of flux tubes can span the entire half field period before splitting is required. This is an advantage over the traditional setup of the EMC3-EIRENE mesh where careful construction of several sub- domains is required already for the much tighter present first wall. In particular, there is no longer the need to manually construct a suitable outer boundary for the mesh. The divide and conquer paradigm with unstructured mesh layout offers a powerful alternative for fast head load approximation that is suitable for integration into optimization workflows. Further examples for W7-X and CTH demonstrate the versatile application range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

High-Fidelity, Low-Dissipation/Symmetry-Preserving Numerical Scheme for Solving the Euler Equations with Unstructured, Metric-Based Mesh Adaptation

This work presents an overview of a high-fidelity compressible Euler solver that utilizes the continuous Galerkin (CG) method with added artificial numerical diffusion for stabilization to solve a variety of unsteady and steady benchmark inviscid flow problems. This work shows that discretizing the Euler equations with this CG approach and first order basis functions produces a cost-effective stencil as well as simple well-posed boundary conditions. We show through convergence testing with manufactured solutions that the reduced stencil of CG, combined with the low amount of artificial diffusion required when using the stabilization method outlined in this work, leads to stable and highly accurate results for a variety of unsteady and steady applications. When combined with the adaptive mesh refinement approach used for many of the cases in this work, our results show that the flow solver achieves even more accurate results. A variety of inviscid flow cases are presented in this work, including transient 2D cases with complex shock structures and several steady 3D airfoils sections with a constant span.

Doetsch, Kevin [ORNL] (ORCID:0000000267051705)↗
NASA NTRS1997

Load Balancing Sequences of Unstructured Adaptive Grids

Mesh adaption is a powerful tool for efficient unstructured grid computations but causes load imbalance on multiprocessor systems. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. This paper makes several important additions to our previous work. First, a new remapping cost model is presented and empirically validated on an SP2. Next, our load balancing strategy is applied to sequences of dynamically adapted unstructured grids. Results indicate that our framework is effective on many processors for both steady and unsteady problems with several levels of adaption. Additionally, we demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required for a fine initial mesh. Finally, we show that the data remapping overhead can be significantly reduced by applying our heuristic processor reassignment algorithm.

Biswas, Rupak↗
NASA NTRS1996

Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2

Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.OX speedup on 64 processors when 10% of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

Oliker, Leonid↗
NASA NTRS1996

Parallel implementation of an adaptive scheme for 3D unstructured grids on the SP2

Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.0X speedup on 64 processors when 10 percent of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all the mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

Strawn, Roger C.↗
NASA NTRS1994

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗
NASA NTRS1994

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a multiple-instruction/multiple-data stream parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed: one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All of the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the Intel iPSC/860.

TRT-THEORETICAL↗
NASA NTRS1995

Slices: A Scalable Partitioner for Finite Element Meshes

A parallel partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The element based partitioner can handle mixtures of different element types. All algorithms adopted in the partitioner are scalable, including a communication template for unpredictable incoming messages, as shown in actual timing measurements.

partitioner finite element meshes parallel computi↗
NASA NTRS1989

Two-dimensional Euler computations on a triangular mesh using an upwind, finite-volume scheme

A numerical procedure was developed for the finite-volume solution of the Euler equations on unstructured triangular meshes based on a flux-difference split upwind method. Techniques for implementing Roe's (1985) approximate Reimann solver together with the preprocessing MUSCL differencing on unstructured grids are presented. Applications and comparisons with structured grid problems are carried out for a supersonic shock reflection problem, the supersonic flow over a blunt body, the transonic flow over NACA 0012 and RAE 2822 airfoils, and the flow about a double element Karman-Trefftz airfoil.

Whitaker, D. L.↗
NASA NTRS1992

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗