Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “arbitrary 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.

At least 37 records · Page 2

Three dimensional mesh generation by triangulation of arbitrary point sets

A method for generating an unstructured mesh is described. The approach is quite general and joins an arbitrary set of points to produce a covering of three dimensional space by tetrahedra. After removing the tetrahedra that connect surface points, a mesh suitable for a finite element based flow solver is obtained. Details of the triangulation algorithm are provided together with an analysis of the algorithm efficiency and validity.

Baker, Timothy J.↗

Numerical techniques for the solution of the compressible Navier-Stokes equations and implementation of turbulence models

The time-splitting explicit numerical method of MacCormack is applied to separated turbulent boundary layer flow problems. Modifications of this basic method are developed to counter difficulties associated with complicated geometry and severe numerical resolution requirements of turbulence model equations. The accuracy of solutions is investigated by comparison with exact solutions for several simple cases. Procedures are developed for modifying the basic method to improve the accuracy. Numerical solutions of high-Reynolds-number separated flows over an airfoil and shock-separated flows over a flat plate are obtained. A simple mixing length model of turbulence is used for the transonic flow past an airfoil. A nonorthogonal mesh of arbitrary configuration facilitates the description of the flow field. For the simpler geometry associated with the flat plate, a rectangular mesh is used, and solutions are obtained based on a two-equation differential model of turbulence.

Baldwin, B. S.↗

Numerical simulation of high Reynolds number transonic flows

A code has been developed for simulating high Reynolds number transonic flow fields of arbitrary configuration. An explicit finite-difference method with time splitting is used to solve the time-dependent equations for compressible turbulent flow. A nonorthogonal computational mesh of arbitrary configuration facilitates the description of the flow field. The code is applied to simulate the flow over an 18 percent thick circular-arc biconvex airfoil at zero angle of attack and free-stream Mach number of 0.775. A simple mixing-length model is used to describe the turbulence and chord Reynolds numbers of 1, 2, 4, and 10 million are considered. The solution describes in sufficient detail both the shock-induced and trailing-edge separation regions, and provides the profile and friction drag.

Deiwert, G. S.↗

High Reynolds number transonic flow simulation

A code has been developed for simulating high Reynolds number transonic flow fields of arbitrary configuration. An explicit finite-difference method with time splitting is used to solve the time-dependent equations for compressible turbulent flow. A nonorthogonal computational mesh of arbitrary configuration facilitates the description of the flow field. The code is applied to simulate the flow over a two-dimensional 18 percent thick circular-arc biconvex airfoil at zero angle of attack for several different Reynolds numbers and a free-stream Mach number of 0.775.

Deiwert, G. S.↗

An advancing front Delaunay triangulation algorithm designed for robustness

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field.

Mavriplis, D. J.↗

An advancing front Delaunay triangulation algorithm designed for robustness

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field.

Mavriplis, D. J.↗

Adaptive Meshing Techniques for Viscous Flow Calculations on Mixed Element Unstructured Meshes

An adaptive refinement strategy based on hierarchical element subdivision is formulated and implemented for meshes containing arbitrary mixtures of tetrahendra, hexahendra, prisms and pyramids. Special attention is given to keeping memory overheads as low as possible. This procedure is coupled with an algebraic multigrid flow solver which operates on mixed-element meshes. Inviscid flows as well as viscous flows are computed an adaptively refined tetrahedral, hexahedral, and hybrid meshes. The efficiency of the method is demonstrated by generating an adapted hexahedral mesh containing 3 million vertices on a relatively inexpensive workstation.

Mavriplis, D. J.↗

Two-dimensional unstructured triangular grid generation

The capability of generating 2-D unstructured triangular meshes about arbitrary geometries is demonstrated. This work uses a distribution of boundary points and triangulates the computational domain using a Delaunay triangulation algorithm. Typically, initial cells are added based on cell aspect ratios or cell areas. A resulting mesh can then be used along with the connectivity of the cells to solve either a Euler or Navier-Stokes flow problem.

Jorgenson, Philip C. E.↗

Into Mesh Lubrication of Spur Gears with Arbitrary Offset Oil Jet. I: For Jet Velocity Less than or Equal to Gear Velocity

An analysis was conducted for into mesh oil jet lubrication with an arbitrary offset and inclination angle from the pitch point for the case where the oil jet velocity is equal to or less than pitch line velocity. The analysis includes the case for the oil jet offset from the pitch point in the direction of the pinion and where the oil jet is inclined to intersect the common pitch point. Equations were developed for the minimum oil jet velocity required to impinge on the pinion or gear and the optimum oil jet velocity to obtain the maximum impingement depth.

Akin, L. S.↗

Into Mesh Lubrication of Spur Gears with Arbitrary Offset Oil Jet. 2: for Jet Velocities Equal to or Greater than Great Velocity

An analysis was conducted for into mesh oil jet lubrication with an arbitrary offset and inclination angle from the pitch point for the case where the oil jet velocity is equal to or greater than gear pitch line velocity. Equations were developed for minimum and maximum oil jet impingement depth. The analysis also included the minimum oil jet velocity required to impinge on the gear or pinion and the optimum oil jet velocity required to obtain the best lubrication condition of maximum impingement depth and gear cooling. It was shown that the optimum oil jet velocity for best lubrication and cooling is when the oil jet velocity equals the gear pitch line velocity. When the oil jet velocity is slightly greater than the pitch line velocity the loaded side of the driven gear and the unloaded side of the pinion receive the best lubrication and cooling with slightly less impingement depth. As the jet velocity becomes much greater than the pitch line velocity the impingement depth is considerably reduced and may completely miss the pinion.

Akin, L. S.↗

Into mesh lubrication of spur gears with arbitrary offset oil jet. I - For jet velocity less than or equal to gear velocity

An analysis was conducted for into mesh oil jet lubrication with an arbitrary offset and inclination angle from the pitch point for the case where the oil jet velocity is equal to or less than pitch line velocity. The analysis includes the case for the oil jet offset from the pitch point in the direction of the pinion and where the oil jet is inclined to intersect the common pitch point. Equations were developed for the minimum oil jet velocity required to impinge on the pinion or gear and the optimum oil jet velocity to obtain the maximum impingement depth.

Akin, L. S.↗

A three-dimensional space marching algorithm for the solution of the Euler equations on unstructured grids

A three-dimensional space marching algorithm using an unstructured discretization is proposed. The governing equations and the spatial discretization of the domain and the interpolation from one arbitrary unstructured mesh to another are discussed, and the grid generation technique is described. Solutions for several different geometries are presented, and the results are compared with existing numerical techniques and experimental results.

Mcgrory, W. D.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, J. R.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composits data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, John R.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum-cost way to evaluate an expression, for several different data parallel architectures. This algorithm applies to any architecture in which the metric describing the cost of moving an array is robust. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes. Remarks are made on several variations of the problem, some of which are solved and some of which remain open.

Gilbert, John R.↗

Revisiting the Least-squares Procedure for Gradient Reconstruction on Unstructured Meshes

The accuracy of the least-squares technique for gradient reconstruction on unstructured meshes is examined. While least-squares techniques produce accurate results on arbitrary isotropic unstructured meshes, serious difficulties exist for highly stretched meshes in the presence of surface curvature. In these situations, gradients are typically under-estimated by up to an order of magnitude. For vertex-based discretizations on triangular and quadrilateral meshes, and cell-centered discretizations on quadrilateral meshes, accuracy can be recovered using an inverse distance weighting in the least-squares construction. For cell-centered discretizations on triangles, both the unweighted and weighted least-squares constructions fail to provide suitable gradient estimates for highly stretched curved meshes. Good overall flow solution accuracy can be retained in spite of poor gradient estimates, due to the presence of flow alignment in exactly the same regions where the poor gradient accuracy is observed. However, the use of entropy fixes has the potential for generating large but subtle discretization errors.

Mavriplis, Dimitri J.↗

Relabeling of finite element meshes using a random process

An algorithm is presented to relabel automatically the nodes of an arbitrary finite-element mesh. The purpose of such relabeling is to reduce the bandwidth of the master stiffness matrix produced by the finite-element method. The algorithm uses a random process for the relabeling. Computing time is reduced substantially, compared to systematic methods.

Roberts, E., Jr.↗