scholarly journals Curved Mesh Generation and Mesh Refinement using Lagrangian Solid Mechanics

2009 ◽  
Author(s):  
Per-Olof Persson ◽  
Jaime Peraire
Keyword(s):  
Mesh Generation ◽  
Solid Mechanics ◽  
Mesh Refinement

A Mesh Refinement Algorithm for Singularly Perturbed Boundary and Interior Layer Problems

2019 ◽  
Vol 17 (07) ◽  
pp. 1950024 ◽  
Author(s):  
Ritesh Kumar Dubey ◽  
Vikas Gupta
Keyword(s):  
Mesh Generation ◽  
Numerical Scheme ◽  
A Priori ◽  
Mesh Refinement ◽  
Singularly Perturbed ◽  
Test Problems ◽  
Interior Layer ◽  
Wide Range ◽  
Region Ii ◽  
Refinement Algorithm

A robust automated mesh refinement algorithm is proposed for numerical solution of singularly perturbed boundary and interior layer problems. The proposed algorithm is heuristically based on two smoothness indicators which are functions of consecutive differences of the computed solution on a given mesh. The main salient features of the proposed heuristic mesh generation algorithm are: (i) it does not require a priori knowledge about the nature or location of the layered region, (ii) it is independent of the problem under consideration and the underlying numerical scheme. The proposed algorithm is applied to solve a wide range of 1D as well as 2D test problems to show its robustness.

Adaptivity and Mesh Generation in 2-D Finite Element Analysis

1994 ◽  
Author(s):  
C. A. Almeida
Keyword(s):  
Finite Element ◽  
Error Estimation ◽  
Mesh Generation ◽  
Strain Energy ◽  
Mesh Refinement ◽  
Stress Recovery ◽  
Error Norm ◽  
Adaptive Process ◽  
Energy Error ◽  
Sampling Points

Abstract A methodology for the automatic mesh generation of triangular and quadrilateral finite element discretizations for two-dimensional elasticity problems is proposed. The methodology is based on: i) an h-adaptive process with powerful mesh generator facilities capable of achieving meshes of specified density, ii) a general stress recovery technique developed for determining the element solutions at the nodes, and iii) an a posteriori error estimation. The h-adaptive process used is based on a complete mesh regeneration procedure which is guided by specified mesh requirements such as geometry definitions, boundary conditions, and space node functions to achieve an optimal refinement. This optimality condition is, as established by Zienkiewicz and Zhu, the mesh refinement with the least number of elements that yields a uniform strain energy norm error distribution in all elements. In the stress recovery process, the nodal values are assumed to belong to a polynomial expansion of the same complete order in the interpolation function basis used, which is valid over all elements adjoining a particular node. A least-squares fit of superconvergent sampling points existing in the path is used to obtain the recovered nodal point parameters for each element. These parameters are averaged to all elements adjoining the node of interest. The technique is simple and cost-effective, and the recovered nodal values of derivatives are superconvergent at the Gauss integration points, which are used as sampling points for quadrilateral elements. This condition is also achieved when centroid and mid-side points are used for triangular elements. The error estimation is done evaluating differences between the post-processed stress gradients and those from the finite element solutions. The energy error norm associated with stress field differences and the finite element predicted strain energy gives an effective error estimate which can be used for comparison with the process tolerance. The technique has been implemented and allows for a fully automatic numerical analysis under a specified global energy error norm. Numerical tests conducted with various planar element formulations illustrate that the proposed technique converges in fewer steps than with previous methods of adaptive mesh refinement.

Sign in / Sign up

Export Citation Format

Share Document