arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.01181math.NAcs.NA
收藏

凸极小化问题的收敛自适应混合高阶格式

Convergent adaptive hybrid higher-order schemes for convex minimization

Carsten Carstensen, Ngoc Tien Tran

AI总结:

本文针对双边p-增长凸极小化问题提出两种收敛的自适应混合高阶网格细化算法,证明能量及原始对偶变量逼近的收敛性,并通过数值实验验证其能高效逼近奇异解、提升高阶收敛速率并克服Lavrentiev间隙现象。

摘要:

本文针对具有双边p-增长的凸极小化问题,提出了两种收敛的自适应网格细化算法,用于混合高阶(hybrid high-order, HHO)方法。典型例子包括p-Laplacian、拓扑优化中的一个最优设计问题以及凸化双井问题。混合高阶方法在单纯形剖分上使用分片Raviart-Thomas有限元函数空间中的梯度重构且无需稳定化,或在多面体网格上使用带稳定化的分片多项式空间中的梯度重构。主要结果蕴含了能量的收敛性,并且在进一步的凸性条件下,还蕴含了原始变量和对偶变量逼近的收敛性。数值实验展示了对奇异极小化子的高效逼近以及更高多项式次数下改进的收敛速率。计算机模拟提供了显著的数值证据,表明所采用的自适应HHO算法能够克服Lavrentiev间隙现象,甚至具有经验上更高的收敛速率。

英文摘要:

This paper proposes two convergent adaptive mesh-refining algorithms for the hybrid high-order method in convex minimization problems with two-sided p-growth. Examples include the p-Laplacian, an optimal design problem in topology optimization, and the convexified double-well problem. The hybrid high-order method utilizes a gradient reconstruction in the space of piecewise Raviart-Thomas finite element functions without stabilization on triangulations into simplices or in the space of piecewise polynomials with stabilization on polytopal meshes. The main results imply the convergence of the energy and, under further convexity properties, of the approximations of the primal resp. dual variable. Numerical experiments illustrate an efficient approximation of singular minimizers and improved convergence rates for higher polynomial degrees. Computer simulations provide striking numerical evidence that an adopted adaptive HHO algorithm can overcome the Lavrentiev gap phenomenon even with empirical higher convergence rates.

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

↑