SEARCH · Search NASA

Results for “Mesh regularization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

All sources NASA NTRS DOE 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 NTRS1988

Generation of a crowned pinion tooth surface by a surface of revolution

A method of generating crowned pinion tooth surfaces using a surface of revolution is developed. The crowned pinion meshes with a regular involute gear and has a prescribed parabolic type of transmission errors when the gears operate in the aligned mode. When the gears are misaligned the transmission error remains parabolic with the maximum level still remaining very small (less than 0.34 arc sec for the numerical examples). Tooth contact analysis (TCA) is used to simulate the conditions of meshing, determine the transmission error, and determine the bearing contact.

Litvin, F. L.↗

NASA NTRS1988

Crowned spur gears - Methods for generation and Tooth Contact Analysis. II - Generation of the pinion tooth surface by a surface of revolution

A method for generation of crowned pinion tooth surfaces using a surface of revolution is developed. The crowned pinion meshes with a regular involute gear and has a prescribed parabolic type of transmission errors when the gears operate in the aligned mode. When the gears are misaligned the transmission error remains parabolic with the maximum level still remaining very small (less than 0.34 arc second for the numerical examples). Tooth Contact Analysis (TCA) is used to simulate the conditions of meshing, determine the transmission error, and the bearing contact.

Litvin, F. L.↗

NASA NTRS1992

Three-dimensional boundary layer calculation by a characteristic method

A numerical method for solving the three-dimensional boundary layer equations for bodies of arbitrary shape is presented. In laminar flows, the application domain extends from incompressible to hypersonic flows with the assumption of chemical equilibrium. For turbulent boundary layers, the application domain is limited by the validity of the mixing length model used. In order to respect the hyperbolic nature of the equations reduced to first order partial derivative terms, the momentum equations are discretized along the local streamlines using of the osculator tangent plane at each node of the body fitted coordinate system. With this original approach, it is possible to overcome the use of the generalized coordinates, and therefore, it is not necessary to impose an extra hypothesis about the regularity of the mesh in which the boundary conditions are given. By doing so, it is possible to limit, and sometimes to suppress, the pre-treatment of the data coming from an inviscid calculation. Although the proposed scheme is only semi-implicit, the method remains numerically very efficient.

Houdeville, R.↗

NASA NTRS1991

Design of an essentially non-oscillatory reconstruction procedure on finite-element type meshes

An essentially non-oscillatory reconstruction for functions defined on finite-element type meshes was designed. Two related problems are studied: the interpolation of possibly unsmooth multivariate functions on arbitrary meshes and the reconstruction of a function from its average in the control volumes surrounding the nodes of the mesh. Concerning the first problem, we have studied the behavior of the highest coefficients of the Lagrange interpolation function which may admit discontinuities of locally regular curves. This enables us to choose the best stencil for the interpolation. The choice of the smallest possible number of stencils is addressed. Concerning the reconstruction problem, because of the very nature of the mesh, the only method that may work is the so called reconstruction via deconvolution method. Unfortunately, it is well suited only for regular meshes as we show, but we also show how to overcome this difficulty. The global method has the expected order of accuracy but is conservative up to a high order quadrature formula only. Some numerical examples are given which demonstrate the efficiency of the method.

Abgrall, R.↗

NASA NTRS2019

A Multiscale Nonlocal Progressive Damage Model for Composite Materials

In this paper, the advantages of a nonlocal progressive damage formulation are described and demonstrated. An approximation of the nonlocal formulation was implemented coupled with the MAT162 composite damage model as a User defined material model in the LS DYNA environment. A comparison of the local model and the nonlocal model is simulated for an 8-ply laminate under tension is carried for increasing mesh densities. The results show the regularization achieved by nonlocal models by providing mesh independent results.

Kodagali, Karan↗

NASA NTRS1980

Effect of grid system on finite element calculation

Detailed parametric studies of the effect of grid system on finite element calculation for potential flows were made. These studies led to the formulation of a design criteria for optimum mesh system and the development of two methods to generate the optimum mesh system. The guidelines for optimum mesh system are: (1) the mesh structure should be regular; (2) the element should be as regular and equilateral as possible; (3) the distribution of size of element should be consistent with that of flow variables to insure maximum uniformity in error distribution; (4) for non-Dirichlet boundary conditions, smaller boundary elements or higher order interpolation functions should be used; and (5) the mesh should accommodate the boundary geometry as accurately as possible. The results of the parametric studies are presented.

Lee, K. D.↗

NASA NTRS2003

Solution-Adaptive Program for Computing 2D/Axi Viscous Flow

A computer program solves the Navier- Stokes equations governing the flow of a viscous, compressible fluid in an axisymmetric or two-dimensional (2D) setting. To obtain solutions more accurate than those generated by prior such programs that utilize regular and/or fixed computational meshes, this program utilizes unstructured (that is, irregular triangular) computational meshes that are automatically adapted to solutions. The adaptation can refine to regions of high change in gradient or can be driven by a novel residual minimization technique. Starting from an initial mesh and a corresponding data structure, the adaptation of the mesh is controlled by use of minimization functional. Other improvements over prior such programs include the following: (1) Boundary conditions are imposed weakly; that is, following initial specification of solution values at boundary nodes, these values are relaxed in time by means of the same formulations as those used for interior nodes. (2) Eigenvalues are limited in order to suppress expansion shocks. (3) An upwind fluctuation-splitting distribution scheme applied to inviscid flux requires fewer operations and produces less artificial dissipation than does a finite-volume scheme, leading to greater accuracy of solutions.

Wood, William A.↗

NASA NTRS1974

A finite element solution algorithm for the Navier-Stokes equations

A finite element solution algorithm is established for the two-dimensional Navier-Stokes equations governing the steady-state kinematics and thermodynamics of a variable viscosity, compressible multiple-species fluid. For an incompressible fluid, the motion may be transient as well. The primitive dependent variables are replaced by a vorticity-streamfunction description valid in domains spanned by rectangular, cylindrical and spherical coordinate systems. Use of derived variables provides a uniformly elliptic partial differential equation description for the Navier-Stokes system, and for which the finite element algorithm is established. Explicit non-linearity is accepted by the theory, since no psuedo-variational principles are employed, and there is no requirement for either computational mesh or solution domain closure regularity. Boundary condition constraints on the normal flux and tangential distribution of all computational variables, as well as velocity, are routinely piecewise enforceable on domain closure segments arbitrarily oriented with respect to a global reference frame.

Baker, A. J.↗

NASA NTRS1974

Finite element solution algorithm for incompressible fluid dynamics

A finite element solution algorithm is established for the two-dimensional Navier-Stokes equations governing the transient motion of a viscous incompressible fluid, i.e., hydrodynamics. Dependent variable transformation renders the differential equation description uniformly elliptic. The finite element algorithm is established using the Galerkin criterion on a local basis within the Method of Weighted Residuals. It is unconstrained with respect to system linearity, computational mesh uniformity or solution domain closure regularity. The finite element matrices are established using a linear 'natural coordinate function' description. Computational solutions using the COMOC computer program illustrate the various features of the algorithm including recirculating flows.

Baker, A. J.↗

NASA NTRS1987

Octree based automatic meshing from CSG models

Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is emphasized. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary respresentation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractors. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.

Perucchio, Renato↗

NASA NTRS1987

Geometrical and topological issues in octree based automatic meshing

Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is discussed. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary representation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractor. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.

Saxena, Mukul↗

NASA NTRS2003

Accelerating Large Data Analysis By Exploiting Regularities

We present techniques for discovering and exploiting regularity in large curvilinear data sets. The data can be based on a single mesh or a mesh composed of multiple submeshes (also known as zones). Multi-zone data are typical to Computational Fluid Dynamics (CFD) simulations. Regularities include axis-aligned rectilinear and cylindrical meshes as well as cases where one zone is equivalent to a rigid-body transformation of another. Our algorithms can also discover rigid-body motion of meshes in time-series data. Next, we describe a data model where we can utilize the results from the discovery process in order to accelerate large data visualizations. Where possible, we replace general curvilinear zones with rectilinear or cylindrical zones. In rigid-body motion cases we replace a time-series of meshes with a transformed mesh object where a reference mesh is dynamically transformed based on a given time value in order to satisfy geometry requests, on demand. The data model enables us to make these substitutions and dynamic transformations transparently with respect to the visualization algorithms. We present results with large data sets where we combine our mesh replacement and transformation techniques with out-of-core paging in order to achieve significant speed-ups in analysis.

Moran, Patrick J.↗

NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗

NASA NTRS1985

Solution adaptivity using a triangular mesh

Solution adaptivity is discussed first from a general perspective and then from the specific viewpoint of triangular meshes. The use of a general connectivity triangular mesh is emphasized. The development of monitor surfaces and their geometric properties is discussed. Mesh point movement is addressed, as is the dynamic restructuring of the connectivity pattern among moving modes. Changes in the number of mesh nodes to obtain suitable refinement for a physical simulation is examined, and the use of locally regular structures to offset the data structure limitation of a general connectivity triangular mesh and thus to obtain an enhanced range of application is considered. To illustrate the basic features of the adaptive triangular mesh strategy, an application to the study of plasma equilibrium is briefly considered.

Eiseman, P. R.↗

NASA NTRS2014

A Technique for Mapping Characteristic Lengths to Preserve Energy Dissipated via Strain Softening in a Multiscale Analysis

It is often advantageous to account for the microstructure of the material directly using multiscale modeling. For computational tractability, an idealized repeating unit cell (RUC) is used to capture all of the pertinent features of the microstructure. Typically, the RUC is dimensionless and depends only on the relative volume fractions of the different phases in the material. This works well for non-linear and inelastic behavior exhibiting a positive-definite constitutive response. Although, once the material exhibits strain softening, or localization, a mesh objective failure theories, such as smeared fracture theories, nodal and element enrichment theories (XFEM), cohesive elements or virtual crack closure technique (VCCT), can be utilized at the microscale, but the dimensions of the RUC must then be defined. One major challenge in multiscale progressive damage modeling is relating the characteristic lengths across the scales in order to preserve the energy that is dissipated via localization at the microscale. If there is no effort to relate the size of the macroscale element to the microscale RUC, then the energy that is dissipated will remain mesh dependent at the macroscale, even if it is regularized at the microscale. Here, a technique for mapping characteristic lengths across the scales is proposed. The RUC will be modeled using the generalized method of cells (GMC) micromechanics theory, and local failure in the matrix constituent subcells will be modeled using the crack band theory. The subcell characteristic lengths used in the crack band calculations will be mapped to the macroscale finite element in order to regularize the local energy in a manner consistent with the global length scale. Examples will be provided with and without the regularization, and they will be compared to a baseline case where the size and shape of the element and RUC are coincident (ensuring energy is preserved across the scales).

softening↗

NASA NTRS1997

Tools for Analysis and Visualization of Large Time-Varying CFD Data Sets

In the second year, we continued to built upon and improve our scanline-based direct volume renderer that we developed in the first year of this grant. This extremely general rendering approach can handle regular or irregular grids, including overlapping multiple grids, and polygon mesh surfaces. It runs in parallel on multi-processors. It can also be used in conjunction with a k-d tree hierarchy, where approximate models and error terms are stored in the nodes of the tree, and approximate fast renderings can be created. We have extended our software to handle time-varying data where the data changes but the grid does not. We are now working on extending it to handle more general time-varying data. We have also developed a new extension of our direct volume renderer that uses automatic decimation of the 3D grid, as opposed to an explicit hierarchy. We explored this alternative approach as being more appropriate for very large data sets, where the extra expense of a tree may be unacceptable. We also describe a new approach to direct volume rendering using hardware 3D textures and incorporates lighting effects. Volume rendering using hardware 3D textures is extremely fast, and machines capable of using this technique are becoming more moderately priced. While this technique, at present, is limited to use with regular grids, we are pursuing possible algorithms extending the approach to more general grid types. We have also begun to explore a new method for determining the accuracy of approximate models based on the light field method described at ACM SIGGRAPH '96. In our initial implementation, we automatically image the volume from 32 equi-distant positions on the surface of an enclosing tessellated sphere. We then calculate differences between these images under different conditions of volume approximation or decimation. We are studying whether this will give a quantitative measure of the effects of approximation. We have created new tools for exploring the differences between images produced by various rendering methods. Images created by our software can be stored in the SGI RGB format. Our idtools software reads in pair of images and compares them using various metrics. The differences of the images using the RGB, HSV, and HSL color models can be calculated and shown. We can also calculate the auto-correlation function and the Fourier transform of the image and image differences. We will explore how these image differences compare in order to find useful metrics for quantifying the success of various visualization approaches. In general, progress was consistent with our research plan for the second year of the grant.

Wilhelms, Jane↗

NASA NTRS1998

Multigrid Strategies for Viscous Flow Solvers on Anisotropic Unstructured Meshes

Unstructured multigrid techniques for relieving the stiffness associated with high-Reynolds number viscous flow simulations on extremely stretched grids are investigated. One approach consists of employing a semi-coarsening or directional-coarsening technique, based on the directions of strong coupling within the mesh, in order to construct more optimal coarse grid levels. An alternate approach is developed which employs directional implicit smoothing with regular fully coarsened multigrid levels. The directional implicit smoothing is obtained by constructing implicit lines in the unstructured mesh based on the directions of strong coupling. Both approaches yield large increases in convergence rates over the traditional explicit full-coarsening multigrid algorithm. However, maximum benefits are achieved by combining the two approaches in a coupled manner into a single algorithm. An order of magnitude increase in convergence rate over the traditional explicit full-coarsening algorithm is demonstrated, and convergence rates for high-Reynolds number viscous flows which are independent of the grid aspect ratio are obtained. Further acceleration is provided by incorporating low-Mach-number preconditioning techniques, and a Newton-GMRES strategy which employs the multigrid scheme as a preconditioner. The compounding effects of these various techniques on speed of convergence is documented through several example test cases.

Movriplis, Dimitri J.↗