Skip to main content
Log in

A comparison of two optimization methods for mesh quality improvement

  • Original Article
  • Published:
Engineering with Computers Aims and scope Submit manuscript

Abstract

We compare inexact Newton and block coordinate descent optimization methods for improving the quality of a mesh by repositioning the vertices, where the overall quality is measured by the harmonic mean of the mean-ratio metric. The effects of problem size, element size heterogeneity, and various vertex displacement schemes on the performance of these algorithms are assessed for a series of tetrahedral meshes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. An important alternative to mesh optimization often used by the unstructured mesh community employs a series of local objective functions.

  2. For hybrid meshes, the exact definition of q can change depending on the element type. However, we assume that the quality metric, shape, for example, is the same for every element.

  3. This approach excludes elements such as pyramids but includes triangles, tetrahedra, wedges, quadrilaterals, and hexahedra.

  4. We show in [6] that averaging is unnecessary in the case of triangular or tetrahedral elements.

  5. Recall that (2) minimizes the inverse mean-ratio objective function, so the stated algorithms use minimization terminology. However, the same algorithms can be used for the maximization problem (1).

References

  1. Bank R, Smith B (1997) Mesh smoothing using a posteriori error estimates. SIAM J Num Anal 34:979–997

    Article  MATH  MathSciNet  Google Scholar 

  2. Canann SA, Stephenson MB, Blacker T (1993) Optismoothing: an optimization-driven approach to mesh smoothing. Fin Elem Anal Des 13:185–190

    Article  MATH  MathSciNet  Google Scholar 

  3. Parthasarathy VN, Kodiyalam S (1991) A constrained optimization approach to finite element mesh smoothing. Fin Elem Anal Des 9:309–320

    Article  MATH  Google Scholar 

  4. Zavattieri P, Dari E, Buscaglia G (1996) Optimization strategies in unstructured mesh generation. Int J Num Methods Eng 39:2055–2071

    Article  MATH  Google Scholar 

  5. Castillo J (1991) A discrete variational grid generation method. SIAM J Sci Stat Comp 12:454–468

    Article  MATH  MathSciNet  Google Scholar 

  6. Freitag L, Knupp P (2002) Tetrahedral mesh improvement via optimization of the element condition number. Int J Numer Methods Eng 53:1377–1391

    Article  MATH  MathSciNet  Google Scholar 

  7. Anderson D (1990) Grid cell volume control with an adaptive grid generator. Appl Math Comp 35:209–217

    Article  MATH  Google Scholar 

  8. Knupp P (2001) Algebraic mesh quality metrics. SIAM J Sci Comp 23:193–218

    Article  MATH  MathSciNet  Google Scholar 

  9. Knupp P (1999) Matrix norms and the condition number. Proceedings of 8th International Meshing Roundtable, pp 13–22

  10. Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific, Belmont

    MATH  Google Scholar 

  11. Nocedal J, Wright SJ (1999) Numerical optimization. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  12. Munson TS (2004) Mesh shape-quality optimization using the inverse mean-ratio metric. Preprint ANL/MCS-P1136-0304, Argonne National Laboratory, Argonne

  13. Munson TS (2004) Mesh shape-quality optimization using the inverse mean-ratio metric: tetrahedral proofs. Technical memorandum ANL/MCS-TM-275, Argonne National Laboratory, Argonne

  14. Armijo L (1966) Minimization of functions having lipschitz-continuous first partial derivatives. Pac J Math 16:1–3

    MATH  MathSciNet  Google Scholar 

  15. Saad Y (2003) Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelphia

    MATH  Google Scholar 

  16. Griewank A (2000) Evaluating derivatives: principles and techniques of algorithmic differentiation. SIAM, Philadelphia

    MATH  Google Scholar 

  17. Sandia National Laboratories (2003) Albuquerque, New Mexico. CUBIT 80.1 Mesh Generation Toolkit

  18. Ollivier-Gooch CF (1998–2002) GRUMMP—Generation and refinement of unstructured mixed-element meshes in parallel. http://www.tetra.mech.ubc.ca/GRUMMP

Download references

Acknowledgments

The initial version of the analytic gradient for the inverse mean-ratio metric for tetrahedral elements was provided by Paul Hovland (Argonne National Laboratory). The clipped cube mesh image was provided by Carl Ollivier-Gooch (University of British Columbia). The work of the first, second, and third authors was supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, Office of Science, U.S. Department of Energy, under Contracts W-7405-Eng-48 (UCRL-CONF-205150), DE-AC-94AL85000, and W-31-109-Eng-38, respectively. Part of the work of the fourth author was performed while a member of the Center for Applied Mathematics at Cornell University, supported by Sandia National Laboratories, Cornell University, the National Physical Science Consortium, and NSF grant ACI-0085969.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lori Freitag Diachin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Freitag Diachin, L., Knupp, P., Munson, T. et al. A comparison of two optimization methods for mesh quality improvement. Engineering with Computers 22, 61–74 (2006). https://doi.org/10.1007/s00366-006-0015-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00366-006-0015-0

Keywords

Navigation