A particle swarm optimization approach for hexahedral mesh smoothing

There are some approaches for all-hexahedral mesh quality improvement by means of node-movement while preserving the connectivity. Among these methods, the most easily implemented and well known one is the Laplacian smoothing method; however, for this method mesh quality improvement is not guaranteed in all cases, and this approach might cause inverted elements especially in concave regions. In this work, a method for the improvement of hexahedral mesh shape-quality without causing inverted elements is proposed; which is based on optimization of an objective function calculated by means of the individual qualities of hexahedral elements in the mesh. The shape-quality for each hexahedral element is defined via the condition number of the relevant element. The numerical optimization scheme is the particle swarm optimization method, which originated from observations related to the social behaviors of bird, insect, or fish colonies. The purpose of this paper is to discuss the applicability of this approach to mesh smoothing. Some examples are given in order to demonstrate the applicability. Copyright © 2008 John Wiley & Sons, Ltd.

[1]  Rolf Bünten,et al.  Automatic generation of hexahedral finite element meshes , 1995, Comput. Aided Geom. Des..

[2]  Scott A. Mitchell,et al.  Reliable Whisker Weaving via Curve Contraction , 1999, Engineering with Computers.

[3]  O. Weck,et al.  A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM , 2005 .

[4]  Patrick M. Knupp.  Next-Generation Sweep Tool: A Method for Generating All-Hex Meshes on Two-and-One-Half Dimensional Geometries , 1998, IMR.

[5]  S. Owen,et al.  H-Morph: an indirect approach to advancing front hex meshing , 1999 .

[6]  Chunming Yang,et al.  A new particle swarm optimization technique , 2005, 18th International Conference on Systems Engineering (ICSEng'05).

[7]  Jean-Pierre Berenger,et al.  A perfectly matched layer for the absorption of electromagnetic waves , 1994 .

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

[9]  Charbel Farhat,et al.  A three-dimensional torsional spring analogy method for unstructured dynamic meshes , 2002 .

[10]  Roberto Battiti,et al.  The gregarious particle swarm optimizer (G-PSO) , 2006, GECCO '06.

[11]  Patrick M. Knupp,et al.  Increasing TAU3P Abort-time via Mesh Quality Improvement , 2003, IMR.

[12]  C.A. Coello Coello,et al.  MOPSO: a proposal for multiple objective particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[13]  V. Parthasarathy,et al.  A constrained optimization approach to finite element mesh smoothing , 1991 .

[14]  Z. Lukes,et al.  Multi-Objective Optimization of Wire Antennas: Genetic Algorithms Versus Particle Swarm Optimization , 2005 .

[15]  Patrick M. Knupp.  Mesh quality improvement for SciDAC applications , 2006 .

[16]  Xin Yao,et al.  Evolving artificial neural networks , 1999, Proc. IEEE.

[17]  J. Kennedy,et al.  Matching algorithms to problems: an experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[18]  Matthew L. Staten,et al.  An Approach to Combined Laplacian and Optimization-Based Smoothing for Triangular, Quadrilateral, and Quad-Dominant Meshes , 1998, IMR.

[19]  Nilanjan Mukherjee.  A Hybrid, Variational 3D Smoother For Orphaned Shell Meshes , 2002, IMR.

[20]  Karl O. Jones.  COMPARISON OF GENETIC ALGORITHMS AND PARTICLE SWARM OPTIMISATION FOR FERMENTATION FEED PROFILE DETERMINATION , 2006 .

[21]  Patrick M. Knupp.  A method for hexahedral mesh shape optimization , 2003 .

[22]  K. Kovalev,et al.  Unstructured Hexahedral Non-conformal Mesh Generation , 2005 .

[23]  Jian-Ming Jin,et al.  Complex coordinate stretching as a generalized absorbing boundary condition , 1997 .

[24]  Y. Rahmat-Samii,et al.  Particle swarm optimization in electromagnetics , 2004, IEEE Transactions on Antennas and Propagation.

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

[26]  R. Garimella,et al.  Untangling of 2D meshes in ALE simulations , 2004 .

[27]  P. Hansbo.  Generalized Laplacian smoothing of unstructured grids , 1995 .

[28]  C. Mouser,et al.  Comparing genetic algorithms and particle swarm optimisation for an inverse problem exercise , 2005 .

[29]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[30]  Sergio Idelsohn,et al.  All‐hexahedral mesh smoothing with a node‐based measure of quality , 2001 .

[31]  Gustavo C. Buscaglia,et al.  OPTIMIZATION STRATEGIES IN UNSTRUCTURED MESH GENERATION , 1996 .

[32]  C. Farhat,et al.  Torsional springs for two-dimensional dynamic unstructured fluid meshes , 1998 .

[33]  Mark T. Jones,et al.  An efficient parallel algorithm for mesh smoothing , 1995 .