平移不变核函数的$\mathcal{H}^2$-矩阵
$\mathcal{H}^2$-matrices for translation-invariant kernel functions
AI总结:
本文针对平移不变核函数的边界积分算子,提出一种改进的$\mathcal{H}^2$-矩阵构造方法,利用平移不变性和盒子均匀性显著降低存储需求,并在简单假设下证明了存储复杂度估计。
摘要:
椭圆型偏微分方程的边界元方法通常会产生具有平移不变核函数的边界积分算子。对于粒子方法(例如Nystrom型离散化),利用这一性质相当简单,但如果必须考虑基函数的支集,则更具挑战性。在本文中,我们提出了一种改进的$\mathcal{H}^2$-矩阵构造方法,利用平移不变性显著降低存储需求。由于构造所用的盒子具有均匀性,我们只需少量简单的假设即可证明所得存储复杂度的估计。
英文摘要:
Boundary element methods for elliptic partial differential equations typically lead to boundary integral operators with translation-invariant kernel functions. Taking advantage of this property is fairly simple for particle methods, e.g., Nystrom-type discretizations, but more challenging if the supports of basis functions have to be taken into account. In this article, we present a modified construction for $\mathcal{H}^2$-matrices that uses translation-invariance to significantly reduce the storage requirements. Due to the uniformity of the boxes used for the construction, we need only a few uncomplicated assumptions to prove estimates for the resulting storage complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。