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

数据驱动的有限元方法:面向目标计算的机器学习加速

Data-Driven Finite Elements Methods: Machine Learning Acceleration of Goal-Oriented Computations

Ignacio Brevis, Ignacio Muga, Kristoffer G. van der Zee

摘要:

我们引入了数据驱动的有限元法的概念。这些是偏微分方程(PDE)的有限元离散,以惊人的精度解决感兴趣的量,而不管底层的网格步长。这些方法是在机器学习框架内获得的,在此期间,根据可用的训练数据调整定义该方法的参数。特别是,我们使用一个稳定的参数彼得罗夫-伽辽金方法,相当于一个最小的残差制定使用加权范数。虽然试验空间是标准的有限元空间,但测试空间具有在离线阶段调整的参数。因此,找到最佳测试空间相当于获得完全针对感兴趣的量定制的面向目标的离散化。在深度学习中,我们使用人工神经网络来定义测试空间的参数族。通过对一维和二维的拉普拉斯方程和平流方程的数值算例,我们证明了数据驱动的有限元法即使在非常粗糙的网格上也具有对感兴趣的量的优越逼近

英文摘要:

We introduce the concept of data-driven finite element methods. These are finite-element discretizations of partial differential equations (PDEs) that resolve quantities of interest with striking accuracy, regardless of the underlying mesh size. The methods are obtained within a machine-learning framework during which the parameters defining the method are tuned against available training data. In particular, we use a stable parametric Petrov-Galerkin method that is equivalent to a minimal-residual formulation using a weighted norm. While the trial space is a standard finite element space, the test space has parameters that are tuned in an off-line stage. Finding the optimal test space therefore amounts to obtaining a goal-oriented discretization that is completely tailored towards the quantity of interest. As is natural in deep learning, we use an artificial neural network to define the parametric family of test spaces. Using numerical examples for the Laplacian and advection equation in one and two dimensions, we demonstrate that the data-driven finite element method has superior approximation of quantities of interest even on very coarse meshes

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

↑