A comparison of two optimization methods for mesh quality improvement

Authors:
Lori Freitag Diachin;Patrick Knupp;Todd Munson;Suzanne Shontz
Affiliations:
Lawrence Livermore National Laboratory, Livermore, CA, USA;Sandia National Laboratories, Albuquerque, NM, USA;Argonne National Laboratory, Argonne, IL, USA;University of Minnesota, Minneapolis, MN, USA
Venue:
Engineering with Computers
Year:
2006

Citing 0
Cited 6

A mesh optimization algorithm based on neural networks

Information Sciences: an International Journal
Evaluating approximations generated by the GNG3D method for mesh simplification

AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Error measurements and parameters choice in the GNG3D model for mesh simplification

WSEAS Transactions on Information Science and Applications
Technical Section: Quality encoding for tetrahedral mesh optimization

Computers and Graphics
Improving mesh quality and finite element solution accuracy by GETMe smoothing in solving the Poisson equation

Finite Elements in Analysis and Design
Robust untangling of curvilinear meshes

Journal of Computational Physics

Quantified Score

Hi-index	0.00

Visualization

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.