Multigrid solution of the two-dimensional Euler equations on unstructured triangular meshes
Explore the source record for details and available documents.
Mavriplis, D. J.↗
SEARCH · Engineering Papers
Results for “Triangular meshes”
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.
The 'optimum' upwind advection on a triangular mesh
For advection schemes based on fluctuation splitting, a design criterion of optimizing the time step leads to linear schemes that coincide with those designed for least truncation error. A further stage of optimizing the time step using a nonlinear positivity criterion, leads to considerable further gains in resolution.
Roe, P. L.↗
Euler solutions for blunt bodies using triangular meshes - Artificial viscosity forms and numerical boundary conditions
A finite volume method is used to calculate compressible inviscid flows over blunt bodies using, in general, unstructured grids. Artificial viscosity forms are derived based on a simplified least squares procedure. The extra second order terms are consistent with the governing equations, hence a systematic treatment of the numerical boundary conditions can be easily implemented. A special treatment of blunt bodies may be required. The discrete equations are linearized and the resulting system is solved by a relaxation method. Preliminary results indicate that the effect of the numerical dissipation is minimal. For subsonic flows over smooth bodies, the solution is practically vorticity-free and the total pressure loss is of the same order as the truncation error. Finally, some extensions of the present method are briefly discussed.
Winterstein, R.↗
Measured and predicted root-mean-square errors in square and triangular antenna mesh facets
Deflection shapes of square and equilateral triangular facets of two tricot-knit, gold plated molybdenum wire mesh antenna materials were measured and compared, on the basis of root mean square (rms) differences, with deflection shapes predicted by linear membrane theory, for several cases of biaxial mesh tension. The two mesh materials contained approximately 10 and 16 holes per linear inch, measured diagonally with respect to the course and wale directions. The deflection measurement system employed a non-contact eddy current proximity probe and an electromagnetic distance sensing probe in conjunction with a precision optical level. Despite experimental uncertainties, rms differences between measured and predicted deflection shapes suggest the following conclusions: that replacing flat antenna facets with facets conforming to parabolically curved structural members yields smaller rms surface error; that potential accuracy gains are greater for equilateral triangular facets than for square facets; and that linear membrane theory can be a useful tool in the design of tricot knit wire mesh antennas.
Fichter, W. B.↗
Development of a solution adaptive unstructured scheme for quasi-3D inviscid flows through advanced turbomachinery cascades
The objective of the present research is to develop a general solution adaptive scheme for the accurate prediction of inviscid quasi-three-dimensional flow in advanced compressor and turbine designs. The adaptive solution scheme combines an explicit finite-volume time-marching scheme for unstructured triangular meshes and an advancing front triangular mesh scheme with a remeshing procedure for adapting the mesh as the solution evolves. The unstructured flow solver has been tested on a series of two-dimensional airfoil configurations including a three-element analytic test case presented here. Mesh adapted quasi-three-dimensional Euler solutions are presented for three spanwise stations of the NASA rotor 67 transonic fan. Computed solutions are compared with available experimental data.
Usab, William J., Jr.↗
Balanced Central Schemes for the Shallow Water Equations on Unstructured Grids
We present a two-dimensional, well-balanced, central-upwind scheme for approximating solutions of the shallow water equations in the presence of a stationary bottom topography on triangular meshes. Our starting point is the recent central scheme of Kurganov and Petrova (KP) for approximating solutions of conservation laws on triangular meshes. In order to extend this scheme from systems of conservation laws to systems of balance laws one has to find an appropriate discretization of the source terms. We first show that for general triangulations there is no discretization of the source terms that corresponds to a well-balanced form of the KP scheme. We then derive a new variant of a central scheme that can be balanced on triangular meshes. We note in passing that it is straightforward to extend the KP scheme to general unstructured conformal meshes. This extension allows us to recover our previous well-balanced scheme on Cartesian grids. We conclude with several simulations, verifying the second-order accuracy of our scheme as well as its well-balanced properties.
Bryson, Steve↗
Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations
A general solution adaptive scheme based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.
Jiang, Yi-Tsann↗
Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations
A general solution adaptive scheme-based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.
Jiang, Yi-Tsann↗
Numerical Differentiation for Adaptively Refined Finite Element Meshes
Postprocessing of point-wise data is a fundamental process in many fields of research. Numerical differentiation is a key operation in computational electromagnetics. In the case of data obtained from a finite element method with automatic mesh refinement much work needs still to be done. This paper addresses some issues in differentiating data obtained from a finite element electromagnetic code with adaptive mesh refinement, and it proposes a methodology for deriving the electric field given the magnetic field on a mesh of linear triangular elements. The procedure itself is nevertheless more general and might be extended for numerically differentiating any point-wise solution based on triangular meshes.
Borgioli, Andrea↗
Numerical aspects of computing high Reynolds number flows on unstructured meshes
An edge-data structure describing a mesh edge-wise given the vertices of each edge and neighboring cell information is used developing algorithms for the Navier-Stokes equations on triangular meshes. Edge formulas for the Galerkin and finite-element discretization of gradient, divergence, Hessian, and Laplacian operators are derived. A simple edge formula is derived for the discretization of the Laplacian operator, where precise theoretical conditions for a discrete maximum principle can be ascertained. Practical issues associated with solving the Navier-Stokes equations on unstructured meshes are addressed, along with issues concerning the generation of highly stretched triangular meshes and the modeling of turbulence on unstructured meshes. A turbulence modeling strategy is proposed, and numerical results for a high-Reynolds-number flow about single- and multielement airfoils are discussed.
Barth, Timothy J.↗
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↗
A multigrid method for steady Euler equations on unstructured adaptive grids
A flux-difference splitting type algorithm is formulated for the steady Euler equations on unstructured grids. The polynomial flux-difference splitting technique is used. A vertex-centered finite volume method is employed on a triangular mesh. The multigrid method is in defect-correction form. A relaxation procedure with a first order accurate inner iteration and a second-order correction performed only on the finest grid, is used. A multi-stage Jacobi relaxation method is employed as a smoother. Since the grid is unstructured a Jacobi type is chosen. The multi-staging is necessary to provide sufficient smoothing properties. The domain is discretized using a Delaunay triangular mesh generator. Three grids with more or less uniform distribution of nodes but with different resolution are generated by successive refinement of the coarsest grid. Nodes of coarser grids appear in the finer grids. The multigrid method is started on these grids. As soon as the residual drops below a threshold value, an adaptive refinement is started. The solution on the adaptively refined grid is accelerated by a multigrid procedure. The coarser multigrid grids are generated by successive coarsening through point removement. The adaption cycle is repeated a few times. Results are given for the transonic flow over a NACA-0012 airfoil.
Riemslagh, Kris↗
Auto-adaptive finite element meshes
Accurate capturing of discontinuities within compressible flow computations is achieved by coupling a suitable solver with an automatic adaptive mesh algorithm for unstructured triangular meshes. The mesh adaptation procedures developed rely on non-hierarchical dynamical local refinement/derefinement techniques, which hence enable structural optimization as well as geometrical optimization. The methods described are applied for a number of the ICASE test cases are particularly interesting for unsteady flow simulations.
Richter, Roland↗
Generation and use of unstructured grids for turbomachinery calculations
A wavefront mesh generator for two dimensional triangular meshes as well as a brief description of the solution method used with these meshes are presented. The interest is in creating meshes for solving the equations of fluid mechanics in complex turbomachinery problems, although the mesh generator and flow solver may be used for a larger variety of applications. The focus is on the flexibility and power of the mesh generation method for triangulating extremely complex geometries and in changing the geometry to create a new mesh. Two turbomachinery applications are presented which take advantage of this method: the analysis of pylon/strut and pylon/OGV interaction in the bypass of a turbofan.
Lindquist, Dana R.↗
Exact signed distance fields using parallel Fast Sweeping Method
Signed distance fields are often used in multiphysics simulations to track material interfaces. We present a simple methodology based on the fast sweeping method to generate the exact signed distance from triangular meshes and linear paths on Cartesian grids. The methodology propagates the closest primitive to the boundary to the rest of the domain following the characteristics. A local upwind criterion is used to decide between the new and existing closest primitive at each grid point while capturing the correct sign of the global function. The methodology has optimal computational complexity and runs efficiently in distributed-memory architectures. We include 2D and 3D test cases along with a resolution study up to 0.512 trillion zones and 1,000 computer cores. The solution strategy can also be applied to other types of meshes or collections of primitives.
97 MATHEMATICS AND COMPUTING↗
An adaptive finite element scheme for the Euler and Navier-Stokes equations
The implementation of two explicit finite element schemes for the solution of the compressible Euler and Navier-Stokes equations is presented. The schemes can be employed with general unstructured triangular meshes in two dimensions. Either scheme can therefore be used as the basic solver in a solution adaptive mesh procedure in a direct manner. The particular adaptive approach which is advocated here is intended for the solution of steady state problems only and involves an adaptive regeneration of the grid at prescribed stages during the false transient. The grid regeneration is accomplished by a mesh generator which has the capability of generating triangular grids over computational domains of arbitrary shape. The procedure is illustrated by solving transonic flows over multi-airfoil configurations and high speed flows, involving shock interactions, past circular cylinders.
Morgan, K.↗
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.↗
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.↗