An improved algorithm to smooth graded quadrilateral meshes preserving the prescribed element size (Q2717837)

Mesh smoothing is a critical step in making an automatically generated mesh suitable for use in a finite element or finite volume analysis. The mesh smoothing algorithm must not only make the mesh smoother, but it also must retain desirable features of the mesh. One such desirable feature is sharp grading, by size, of mesh elements. Sharply graded meshes arise in modelling boundary layers, for example. NEWLINENEWLINENEWLINEIn this paper, the authors extend earlier work by \textit{Giuiani} [An algorithm for continuous rezoning of the hydrodynamic grid in arbitrary Lagrangian-Eulerian codes, Nuclear Engineering and Design 72, No. 2, 205-212 (1982)] to make it more suited to sharply-graded meshes. The modification also improves the rate of convergence of the iteration. Numerical examples are presented to illustrate how the modified algorithm improves the final mesh.