Introducing the target-matrix paradigm for mesh optimization via node-movement

A general-purpose algorithm for mesh optimization via node-movement, known as the Target-Matrix Paradigm, is introduced. The algorithm is general purpose in that it can be applied to a wide variety of mesh and element types, and to various commonly recurring mesh optimization problems such as shape improvement, and to more unusual problems like boundary-layer preservation with sliver removal, high-order mesh improvement, and edge-length equalization. The algorithm can be considered to be a direct optimization method in which weights are automatically constructed to enable definitions of application-specific mesh quality. The high-level concepts of the paradigm have been implemented in the Mesquite mesh improvement library, along with a number of concrete algorithms that address mesh quality issues such as those shown in the examples of the present paper.

[1]  Patrick M. Knupp,et al.  Local 2D metrics for mesh optimization in the target-matrix paradigm. , 2006 .

[2]  P. Knupp,et al.  Reference Jacobian optimization-based rezone strategies for arbitrary Lagrangian Eulerian methods , 2002 .

[3]  J. Brackbill,et al.  Adaptive zoning for singular problems in two dimensions , 1982 .

[4]  George S. Dulikravich,et al.  Generation of computational grids using optimization , 1986 .

[5]  Patrick M. Knupp,et al.  Updating meshes on deforming domains : An application of the target-matrix paradigm , 2007 .

[6]  P. Knupp.  Target-matrix Construction Algorithms , 2022 .

[7]  Patrick M. Knupp.  Label-Invariant Mesh Quality Metrics , 2009, IMR.

[8]  Patrick Knupp.  Formulation of a Target-Matrix Paradigm for Mesh Optimization. , 2007 .

[9]  Mark S. Shephard,et al.  Moving curved mesh adaptation for higher-order finite element simulations , 2010, Engineering with Computers.

[10]  Joe F. Thompson,et al.  Automatic numerical generation of body-fitted curvilinear coordinate system for field containing any number of arbitrary two-dimensional bodies , 1974 .

[11]  Patrick M. Knupp,et al.  The Mesquite Mesh Quality Improvement Toolkit , 2003, IMR.

[12]  C. Wayne Mastin,et al.  TOMCAT - A code for numerical generation of boundary-fitted curvilinear coordinate systems on fields containing any number of arbitrary two-dimensional bodies , 1977 .

[13]  Lori A. Freitag,et al.  On combining Laplacian and optimization-based mesh smoothing techniques , 1997 .

[14]  P. George,et al.  Mesh Generation: Application to Finite Elements , 2007 .

[15]  Patrick M. Knupp,et al.  Hexahedral and Tetrahedral Mesh Untangling , 2001, Engineering with Computers.

[16]  Kenji Shimada,et al.  An Angle-Based Approach to Two-Dimensional Mesh Smoothing , 2000, IMR.

[17]  A. Dvinsky.  Adaptive grid generation from harmonic maps on Reimannian manifolds , 1991 .

[18]  José E. Castillo,et al.  A Discrete Variational Grid Generation Method , 1991, SIAM J. Sci. Comput..

[19]  Area Functionals in Plane Grid Generation , 2007 .

[20]  L. Freitag,et al.  Tetrahedral mesh improvement via optimization of the element condition number , 2002 .

[21]  P. Knupp,et al.  Truncation error in grid generation: A case study , 1995 .

[22]  Vladimir D. Liseikin,et al.  A Computational Differential Geometry Approach to Grid Generation (Scientific Computation) , 2003 .

[23]  A. M. Winslow.  Numerical Solution of the Quasilinear Poisson Equation in a Nonuniform Triangle Mesh , 1997 .

[24]  Patrick M. Knupp,et al.  Algebraic Mesh Quality Metrics , 2001, SIAM J. Sci. Comput..

[25]  Patrick J. Roache,et al.  Variational grid generation , 1986 .