The algorithm of adaptation by using graded meshes generator

Jan Kucwaj

Jan Kucwaj Cracow University of Technology

Abstract

An algorithm of remeshing based on graded meshes generator is presented. The algorithm starts with an initial grid, which is iteratively improved taking into account error estimate. Mesh density functions are used to generate grid over domain on which boundary value problem is solved. It is observed, that successive meshes are convergent and especially they become denser near singularities. For unstructured grid generation the advancing front technique combined with Delaunay triangulation is used. The boundary of 2-D domain may be represented by B-spline curves. It may be multiconnected.

Keywords

References

[1] M.B. Bieterman, J.E. Bussoletti, C.L. Hilmes, F.T. Johnson, R.G. Melvin, D.P. Young. An adaptive grid method for analysis of 3D aircraft configuration. Computer Methods in Applid Mechanics and Engineering, 101: 225- 249, 1992.
[2] B. Delaunay. Sur la Sphere Vide. Bulletin De L'Academie des Sciences de L'URSS, Classe des Sciences Mathematiques et Naturelles, 793- 800, 1934.
[3] J.T. Oden, L. Demkowicz, W. Rachowicz, T.A. Westermann. Towards a Universal h-p finite element strategy. Comput. Methods Appl. Mech. Engrg., 77: 113- 180, 1989.
[4] J . Kucwaj. Unstructured Grid Generation Package. Cracow University of Technology, Applied Mathematics Section, Report No 1/1997, September 1997.
[5] J . Kucwaj. Automatic grid generation over plain domains and surfaces. Zeszyty Naukowe P.K., 5: 61- 82, 1995.

The algorithm of adaptation by using graded meshes generator

Abstract

Keywords

References

Most read articles by the same author(s)