Reduced order mesh optimisation using proper orthogonal decomposition and a modified cuckoo search
Reduced order mesh optimisation using proper orthogonal decomposition and a modified cuckoo search
复制标题
DOI：
10.1002/nme.4400
复制
发表时间：
2013-02
影响因子：
2.9
通讯作者：
S. Walton;O. Hassan;K. Morgan
中科院分区：
文献类型：
--
作者：
S. Walton;O. Hassan;K. Morgan
引入了一种新的网格优化方案，即降阶网格优化。该技术使用适当的正交分解来减少网格优化问题中的维数。这种维度的减少允许全局地表达优化问题，而不是更传统的局部网格优化或平滑算法。为了执行优化，应用了最近开发的改进布谷鸟搜索的无梯度技术。通过考虑优化共体积技术中使用的网格的问题，显示了该算法的有效性。共体积技术要求存在两个相互正交的网格；这是通过利用 Delaunay-Voronoi 对偶来实现的。全局考虑问题和使用无梯度技术的结合产生了一种方案，在解决这个特定问题时明显优于以前的方法。尽管本文中提供的示例特定于优化对偶网格，但该技术是通用的，并且可以简单地修改为任何网格优化问题。版权所有 © 2012 约翰·威利父子有限公司
A new mesh optimisation scheme, reduced order mesh optimisation, is introduced. The technique uses proper orthogonal decomposition to reduce the number of dimensions in a mesh optimisation problem. This reduction in dimensionality allows the expression of the optimisation problem globally rather than the more traditional local mesh optimisation or smoothing algorithms. To perform the optimisation, the recently developed gradient‐free technique modified cuckoo search is applied. The effectiveness of the algorithm is shown by considering the problem of optimising meshes for use in co‐volume techniques. Co‐volume techniques require the existence of two mutually orthogonal meshes; this is achieved by utilising the Delaunay–Voronoi dual. A combination of considering the problem globally and the use of a gradient‐free technique results in a scheme that significantly outperforms previous methods in solving this particular problem. Although the examples presented in this paper are specific to optimising dual meshes, the technique is general and can be simply modified to any mesh optimisation problem. Copyright © 2012 John Wiley & Sons, Ltd.