location: Current position: Home >> Scientific Research >> Paper Publications

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

Hits:

Date of Publication:2022-10-10

Journal:机械工程学报

Affiliation of Author(s):运载工程与力学学部

Issue:9

Page Number:117-122

ISSN No.:0577-6686

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.

Note:新增回溯数据

Pre One:基于几何造型的圆柱组合曲面网格生成方法

Next One:基于多体动力学的CPC工艺链系统数值仿真分析