Search NASA⌕ Search

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.

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

At least 37 records · Page 2

Partitioning of regular computation on multiprocessor systems

Problem partitioning of regular computation over two dimensional meshes on multiprocessor systems is examined. The regular computation model considered involves repetitive evaluation of values at each mesh point with local communication. The computational workload and the communication pattern are the same at each mesh point. The regular computation model arises in numerical solutions of partial differential equations and simulations of cellular automata. Given a communication pattern, a systematic way to generate a family of partitions is presented. The influence of various partitioning schemes on performance is compared on the basis of computation to communication ratio.

Lee, Fung F.↗

Image Segmentation, Registration, Compression, and Matching

A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity/topology components of the generated models. The highly efficient triangular mesh compression compacts the connectivity information at the rate of 1.5-4 bits per vertex (on average for triangle meshes), while reducing the 3D geometry by 40-50 percent. Finally, taking into consideration the characteristics of 3D terrain data, and using the innovative, regularized binary decomposition mesh modeling, a multistage, pattern-drive modeling, and compression technique has been developed to provide an effective framework for compressing digital elevation model (DEM) surfaces, high-resolution aerial imagery, and other types of NASA data.

Yadegar, Jacob↗

Multigrid solution of the Navier-Stokes equations on triangular meshes

A 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 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. Directional scaling of the artificial dissipation and the implicit residual smoothing operator is achieved for unstructured meshes by considering local mesh stretching vectors at each point. The accuracy of the scheme for highly stretched triangular meshes is validated by comparing computed flat-plate laminar boundary layer results with the well known similarity solution, and by comparing laminar airfoil results with those obtained from various well-established structured quadrilateral-mesh codes. The convergence efficiency of the present method is also shown to be competitive with those demonstrated by structured quadrilateral-mesh algorithms.

Mavriplis, Dimitri J.↗

Multigrid solution of the Navier-Stokes equations on triangular meshes

A 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 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. Directional scaling of the artificial dissipation and the implicit residual smoothing operator is achieved for unstructured meshes by considering local mesh stretching vectors at each point. The accuracy of the scheme for highly stretched triangular meshes is validated by comparing computed flat-plate laminar boundary layer results with the well known similarity solution, and by comparing laminar airfoil results with those obtained from various well-established structured quadrilateral-mesh codes. The convergence efficiency of the present method is also shown to be competitive with those demonstrated by structured quadrilateral-mesh algorithms.

Mavriplis, D. J.↗

Effects of Mesh Irregularities on Accuracy of Finite-Volume Discretization Schemes

The effects of mesh irregularities on accuracy of unstructured node-centered finite-volume discretizations are considered. The focus is on an edge-based approach that uses unweighted least-squares gradient reconstruction with a quadratic fit. For inviscid fluxes, the discretization is nominally third order accurate on general triangular meshes. For viscous fluxes, the scheme is an average-least-squares formulation that is nominally second order accurate and contrasted with a common Green-Gauss discretization scheme. Gradient errors, truncation errors, and discretization errors are separately studied according to a previously introduced comprehensive methodology. The methodology considers three classes of grids: isotropic grids in a rectangular geometry, anisotropic grids typical of adapted grids, and anisotropic grids over a curved surface typical of advancing layer grids. The meshes within the classes range from regular to extremely irregular including meshes with random perturbation of nodes. Recommendations are made concerning the discretization schemes that are expected to be least sensitive to mesh irregularities in applications to turbulent flows in complex geometries.

Diskin, Boris↗

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.↗

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.↗

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.↗

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.↗

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.↗

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↗

An FFT-based micromechanical model for gradient enhanced brittle fracture

Damage models incorporated within FFT-based micromechanical methods have received much attention recently because of the need to better understand and predict brittle and ductile fracture. An important aspect of a damage model is non-local regularization, which removes the mesh dependence of the predictions that otherwise become physically unacceptable upon grid refinement. In this work, the Helmholtz-type equation for non-local gradient regularization of a damage model on a distorted grid is solved using an FFT-based approach. Further, the resulting system of equations is solved using the Jacobi iterative method. The model is applied to simulate brittle fracture of an intermetallic. The influence of the time and space discretization, the length-scale parameter, and intermetallic crystallographic orientation on crack evolution is studied.

36 MATERIALS SCIENCE↗

Local element operations for curved simplex meshes

Summary Mesh optimization procedures are generally a combination of node smoothing and discrete operations which affect a small number of elements to improve the quality of the overall mesh. These procedures are useful as a post‐processing step in mesh generation procedures and in applications such as fluid simulations with severely deforming domains. In order to perform high‐order mesh optimization, these ingredients must also be extended to high‐order (curved) meshes. In this work, we present a method to perform local element operations on curved meshes. The mesh operations discussed in this work are edge/face swaps, edge collapses, and edge splitting (more generally refinement) for triangular and tetrahedral meshes. These local operations are performed by first identifying the patch of elements which contain the edge/face being acted on, performing the operation as a “straight‐sided one" by placing the high‐order nodes via an isoparametric mapping from the master element, and smoothing the high‐order nodes on the elements in the patch by minimizing a Jacobian‐based high‐order mesh distortion measure. Since the initial “straight‐sided guess” from the placement of the nodes via the isoparametric mapping frequently results in invalid elements, the distortion measure must be regularized which allows for mesh untangling for the optimization to succeed. We present several examples in 2D and 3D to demonstrate these local operations and how they can be combined with a high‐order node smoothing procedure to maintain mesh quality when faced with severe deformations.

Shi, A.↗

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.↗

Mesh objective stochastic simulations of quasibrittle fracture

Continuum finite element (FE) modeling of damage and failure of quasibrittle structures suffers from the spurious mesh sensitivity due to strain localization. Here this issue has been addressed for deterministic analysis through the development of localization limiters. Here this study proposes a mechanism-based model to mitigate the mesh sensitivity in stochastic FE simulations of quasibrittle fracture. The interest is placed on the analysis of large-size structures, where the mesh size is conveniently chosen to be larger than the width of the fracture process zone as well as the correlation length of the random fields of constitutive properties. The present model is formulated within the framework of continuum damage mechanics. Two localization parameters are introduced to describe the evolution of the damage pattern of each finite element. These parameters are used to guide the energy regularization of the constitutive law, as well as to formulate the mesh-dependent probability distributions of constitutive properties. Depending on the prevailing damage pattern, different energy regularization schemes and mesh dependence of the probability distribution functions are used in the constitutive law. The model is applied to simulate the stochastic failure behavior of quasibrittle structures of different geometries featuring different failure processes including damage initiation, localization, and propagation. It is shown that using fixed probability distribution functions of constitutive properties could lead to strong mesh dependence of the prediction of the mean and variance of the structural load capacity. The probability distribution functions of constitutive properties must be linked to the damage pattern, which may evolve during the failure process. Such a mechanism-based modeling of the probability distributions of constitutive properties is essential for mitigating the spurious mesh sensitivity in stochastic FE analysis of quasibrittle fracture.

42 ENGINEERING↗

ARPIST: Provably accurate and stable numerical integration over spherical triangles

Numerical integration on spherical triangles, including the computation of their areas, is a core computation in geomathematics. The commonly used techniques sometimes suffer from instabilities and significant loss of accuracy. We describe a new algorithm, called ARPIST, for accurate and stable integration of functions on spherical triangles. ARPIST is based on an easy-to-implement transformation to the spherical triangle from its corresponding linear triangle via radial projection to achieve high accuracy and efficiency. More importantly, ARPIST overcomes potential instabilities in computing the Jacobian of the transformation, even for poorly shaped triangles that may occur at poles in regular longitude-latitude meshes, by avoiding potential catastrophic rounding errors. We compare our proposed technique with L’Huilier’s Theorem for computing the area of spherical triangles, and also compare it with the recently developed LSQST method (Beckmann et al., 2014) and a radial-basis-function-based technique (Reeger and Fornberg, 2016) for integration of smooth functions on spherical triangulations. In conclusion, our results show that ARPIST enables better or comparable accuracy over previous methods while being easier to implement, significantly faster, and more tolerant of poor element shapes.

97 MATHEMATICS AND COMPUTING↗

PyHydroGeophysX: An extensible open-source platform for integrating hydrological models with geophysical measurements

Hydrological models and geophysical measurements are widely used tools for understanding subsurface hydrological processes relevant to water resource management, yet they typically remain disconnected due to technical barriers. We present PyHydroGeophysX, an open-source Python platform bridging this gap by providing standardized interfaces between hydrological modeling software (MODFLOW, ParFlow) and geophysical simulation tools (PyGIMLi, SimPEG). The platform implements bidirectional workflows: translating hydrological outputs into simulated geophysical responses through petrophysical models, and extracting hydrological information from geophysical inversions. Key features include bidirectional workflow modules, configurable petrophysical models, time-lapse inversion with temporal regularization, parallel computing, and mesh utilities for property transfer between geophysical and hydrological grids. The modular architecture of PyHydroGeophysX enables researchers to incorporate additional models and methods, fostering broader adoption of integrated hydrogeophysical approaches. The software is freely available on GitHub and is intended for researchers and practitioners working at the intersection of hydrology and geophysics.

Hydrogeophysics↗

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.↗