椭圆型偏微分方程的行抽样随机有限元法
A row-sampling-based randomised finite element method for elliptic partial differential equations
摘要:
我们考虑了高维模型上椭圆型偏微分方程的有限元法的随机实现。这是由模型预测对于实时过程诊断至关重要的应用所激发的。在这些情况下,必须加快预测而不显著损害模型的保真度,模型的保真度又依赖于通常在多查询上下文中的相关联的方程组的快速组装和求解。我们的方法涉及到线性,对称正定有限元系统的解决方案转换成一个超定最小二乘问题,其解决方案,然后投影到一个低维子空间。由此产生的低维系统可以有效地勾勒为两个高维矩阵的产品使用参数依赖的非均匀采样分布,仅利用模型的参数的一个小的子集。虽然不同的最佳抽样分布的基础上的统计的行的矩阵的分数,我们表明,它们之间的距离缩小适当的选择的投影子空间。对于近似解,我们限制了由于投影、子空间近似和草图而引起的误差,并表明总体误差由投影刚度矩阵的条件数决定。我们的方法进行了测试模拟的Dirichlet和Neumann问题的稳态扩散方程。结果表明,我们的方法平均有一个十倍的改进的计算时间相比,经典的确定性框架的代价是一个适度小的近似误差。
英文摘要:
We consider a randomised implementation of the finite element method (FEM) for elliptic partial differential equations on high-dimensional models. This is motivated by applications where model predictions are essential for real-time process diagnostics. In these circumstances it is imperative to expedite prediction without a significant compromise in the model's fidelity, which in turn relies on the rapid assembly and solution of the associated system of equations typically at the many-query context. Our approach involves converting the solution of the linear, symmetric positive definite FEM system into an over-determined least squares problem, whose solution is then projected onto a low-dimensional subspace. The resulting low-dimensional system can be effectively sketched as a product of two high-dimensional matrices using a parameter-dependent non-uniform sampling distribution, utilising only a small subset of the model's parameters. Although different to the optimal sampling distributions based on the statistical leverage-scores of the rows of the matrices, we show that the distance between them shrinks for an appropriate choice of the projection subspace. For the approximate solution we bound the incurring errors due to the projection, subspace approximation and sketching and show that the overall error is dominated by the condition number of the projected stiffness matrix. Our approach is tested on simulations on the Dirichlet and Neumann problems for the steady-state diffusion equation. The results show that our approach has on average a tenfold improvement on the computational times compared to the classical deterministic framework at the expense of a moderately small approximation error.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。