• CN:11-2187/TH
  • ISSN:0577-6686

›› 2006, Vol. 42 ›› Issue (9): 117-122.

• 论文 • 上一篇    下一篇

基于不可微问题优化的四面体网格光顺算法

关振群;于文会;陈飙松;刘景鹏   

  1. 大连理工大学工业装备结构分析国家重点实验室;大连重工起重集团有限公司
  • 发布日期:2006-09-15

TETRAHEDRAL MESH SMOOTHING BASED ON NON-SMOOTH OPTIMIZATION PROBLEM

GUAN Zhenqun;YU Wenhui;CHEN Biaosong;LIU Jingpeng   

  1. State Key Laboratory of Structural Analysis for Industrial Equipment, Dalian University of Technology Dalian Heavy Industry Crane Works Group Co., Ltd
  • Published:2006-09-15

摘要: 提出一种基于不可微问题优化的四面体网格光顺算法。针对四面体网格光顺的最小最大约束优化问题,应用一类不可微优化问题的有效解法,提出与不可微目标函数等价的可微目标函数,进一步转化为无约束极小优化问题,进而调用现有的优化程序库进行网格优化。该算法实现了多点并发优化技术,能够有效地实现四面体网格的质量优化,特别是能够有效地解决非孤立劣质单元优化问题。算例表明,该算法计算效率高,且易于实现,能够优化得到较高质量的四面体网格。

关键词: 不可微优化, 基于优化的光顺, 四面体网格光顺

Abstract: A tetrahedral mesh smoothing algorithm based on non-smooth problem optimization is presented. Firstly the tetrahedral mesh smoothing problem is formulated as a min-max constrained optimization problem. And then an efficient solution algorithm based on entropy theory for non-smooth optimization problem is employed. The algorithm provides an equivalent smooth function of the non-smooth objective function and transforms the constrained optimization problem into a minimum unconstraint optimization problem, and then it is solved with the common optimization toolkit. In the process of mesh smoothing, a multi-point concurrent optimization technique is proposed, which can solve the optimization of tetrahedral mesh efficiently, and especially will be suitable for the optimization problem of non-insular bad element. The numerical examples show that the algorithm is efficient, easy to be implemented and can get quality elements.

Key words: Mesh smoothing based on optimization method, Non-smooth optimization, Tetrahedral mesh smoothing

中图分类号: