一种面向度量感知曲边高阶网格优化的全局化与预处理 Newton-CG 求解器
A globalized and preconditioned Newton-CG solver for metric-aware curved high-order mesh optimization
AI总结:
提出一种专用全局化与预处理的 Newton-CG 求解器,通过专用全局化策略和动态强制项的 Jacobi-iLDL^T(0) 预处理,有效优化刚性曲边高阶网格,将矩阵-向量乘积次数降低一个数量级。
摘要:
我们提出了一种专用全局化与预处理的 Newton-CG 求解器,以最小化度量感知的曲边高阶网格畸变。该求解器专为优化高多项式次数的曲边高阶网格而设计,其目标度量具有非均匀尺寸、高拉伸比和曲边对齐等特征——正是这些特征使优化问题变得刚性。为此,我们考虑两个要素:一种专用全局化策略,以及一种具有变化精度和曲率容差(动态强制项)的专用 Jacobi-$\ ext{iLDL}^{\ ext{T}}(0)$ 预处理方法,用于 CG 方法。这些改进在刚性问题中至关重要,因为若没有它们,大量非线性和线性迭代会使曲边优化变得不切实际。最后,为分析我们方法的性能,结果将专用求解器与标准优化方法进行了比较。为此,我们测量了指示求解器计算成本的矩阵-向量乘积次数,以及指示目标函数评估总次数的线搜索迭代次数。当结合全局化与线性求解器要素时,我们得出结论:专用 Newton-CG 求解器将矩阵-向量乘积总次数减少了一个数量级。此外,非线性和线搜索迭代次数总体更小,但量级相似。
英文摘要:
We present a specific-purpose globalized and preconditioned Newton-CG solver to minimize a metric-aware curved high-order mesh distortion. The solver is specially devised to optimize curved high-order meshes for high polynomial degrees with a target metric featuring non-uniform sizing, high stretching ratios, and curved alignment -- exactly the features that stiffen the optimization problem. To this end, we consider two ingredients: a specific-purpose globalization and a specific-purpose Jacobi-$\text{iLDL}^{\text{T}}(0)$ preconditioning with varying accuracy and curvature tolerances (dynamic forcing terms) for the CG method. These improvements are critical in stiff problems because, without them, the large number of non-linear and linear iterations makes curved optimization impractical. Finally, to analyze the performance of our method, the results compare the specific-purpose solver with standard optimization methods. For this, we measure the matrix-vector products indicating the solver computational cost and the line-search iterations indicating the total amount of objective function evaluations. When we combine the globalization and the linear solver ingredients, we conclude that the specific-purpose Newton-CG solver reduces the total number of matrix-vector products by one order of magnitude. Moreover, the number of non-linear and line-search iterations is mainly smaller but of similar magnitude.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。