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

一种 $C^1$ 虚拟元方法用于带有多边形网格的Cahn-Hilliard方程

A $C^1$ virtual element method for the Cahn-Hilliard equation with polygonal meshes

Politecnico di Milano(米兰理工大学);Università degli Studi di Milano(米兰大学)

Paola F. Antonietti, Lourenco Beirao da Veiga, Simone Scacchi, Marco Verani

AI总结:

本文提出了一种基于最小次数 $C^1$ 虚拟元方法的Cahn-Hilliard方程近似方法,该方法在 $H^2$ 空间中是符合的,并且每个网格顶点仅使用3个自由度。通过数值测试验证了半离散方案的收敛性和全离散方案的性能。

摘要:

本文提出了一种基于最小次数 $C^1$ 虚拟元方法的Cahn-Hilliard方程近似方法。该方法在 $H^2$ 空间中是符合的,并且每个网格顶点仅使用3个自由度。此外,尽管该方法在三角形网格上也是新的,但它可以利用一般的多边形网格。作为理论和实际支持,我们证明了半离散方案的收敛性,并通过一组数值测试研究了全离散方案的性能。

英文摘要:

In this paper we develop an evolution of the $C^1$ virtual elements of minimal degree for the approximation of the Cahn-Hilliard equation. The proposed method has the advantage of being conforming in $H^2$ and making use of a very simple set of degrees of freedom, namely 3 degrees of freedom per vertex of the mesh. Moreover, although the present method is new also on triangles, it can make use of general polygonal meshes. As a theoretical and practical support, we prove the convergence of the semi-discrete scheme and investigate the performance of the fully discrete scheme through a set of numerical tests.

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

↑