arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.00799math.NAcs.NA
收藏

逼近超收敛CAD曲线的高效并行optimization

Efficient parallel optimization for approximating CAD curves featuring super-convergence

Julia Docampo Sánchez

摘要:

我们提出了一种高效的,并行的,约束优化技术近似CAD曲线的超收敛率。优化函数是分段多项式逼近和曲线重新参数化方面的视差度量。约束问题求解固定网格单元界面的视差泛函。我们有数值证据表明,受约束的视差保持原来的超收敛:${2p}$阶平面曲线和$\lfloor\frac 32(p-1)\rfloor + 2$三维曲线,$p$是网格多项式的程度。我们的优化方案包括一个全球化的牛顿法与非单调线搜索,和日志障碍函数防止元素反演曲线重新参数化。此外,我们引入了一个\emph{Julia}接口的EGADS几何内核和并行优化算法。我们测试的潜力,我们的曲线网格生成工具的计算机集群上使用几个飞机CAD模型。我们的结论是求解器是非常适合并行计算,产生超收敛近似CAD曲线。

英文摘要:

We present an efficient, parallel, constrained optimization technique for approximating CAD curves with super-convergent rates. The optimization function is a disparity measure in terms of a piece-wise polynomial approximation and a curve re-parametrization. The constrained problem solves the disparity functional fixing the mesh element interfaces. We have numerical evidence that the constrained disparity preserves the original super-convergence: ${2p}$ order for planar curves and $\lfloor\frac 32(p-1)\rfloor + 2$ for 3D curves, $p$ being the mesh polynomial degree. Our optimization scheme consists of a globalized Newton method with a nonmonotone line search, and a log barrier function preventing element inversion in the curve re-parameterization. Moreover, we introduce a \emph{Julia} interface to the EGADS geometry kernel and a parallel optimization algorithm. We test the potential of our curve mesh generation tool on a computer cluster using several aircraft CAD models. We conclude that the solver is well-suited for parallel computing, producing super-convergent approximations to CAD curves.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑