高频率渐近压缩密集BEM矩阵以适应一般几何形状而无需射线追踪
High-frequency asymptotic compression of dense BEM matrices for general geometries without ray tracing
AI总结:
本文提出了一种基于渐近压缩的BEM矩阵方法,通过显式局部化格林函数来减少计算规模,提高矩阵-向量乘积速度和条件数,适用于复杂几何形状的高频声学问题。
摘要:
声学中的波传播和散射问题通常通过边界元方法求解。它们导致一个通常密集且大的离散化矩阵:其大小和条件数随着频率的增加而增长。然而,高频散射问题本质上是局部的,这很好地由高度局部化的射线反弹表示。渐进方法可以用来减少线性系统的规模,甚至使其频率无关,通过显式提取解的振荡特性来实现,使用射线追踪或类似技术。然而,在存在(多个)散射障碍物的复杂几何形状中,射线追踪变得昂贵或难以处理。在本文中,我们从构造完全解析的大而密集矩阵的相同离散化开始,通过显式局部化格林函数来实现渐进压缩。这导致一个大但稀疏的矩阵,具有更快的矩阵-向量乘积速度,并且如数值实验所示,条件数显著提高。尽管适当的格林函数局部化也取决于一般几何形状中不可用的渐进信息,我们可以在频率扫描从小到大频率的过程中自适应地构造它,这种方式会自动考虑一般入射波。我们证明了该方法对非凸、多散射和甚至近陷阱域具有鲁棒性,尽管在后者情况下压缩率明显较低。此外,尽管其渐进性质,该方法对低阶离散化如分段常数、线性或立方体,通常在应用中使用,具有鲁棒性。另一方面,我们没有减少与传统经典离散化相比的总自由度数量。该方法的组合...
英文摘要:
Wave propagation and scattering problems in acoustics are often solved with boundary element methods. They lead to a discretization matrix that is typically dense and large: its size and condition number grow with increasing frequency. Yet, high frequency scattering problems are intrinsically local in nature, which is well represented by highly localized rays bouncing around. Asymptotic methods can be used to reduce the size of the linear system, even making it frequency independent, by explicitly extracting the oscillatory properties from the solution using ray tracing or analogous techniques. However, ray tracing becomes expensive or even intractable in the presence of (multiple) scattering obstacles with complicated geometries. In this paper, we start from the same discretization that constructs the fully resolved large and dense matrix, and achieve asymptotic compression by explicitly localizing the Green's function instead. This results in a large but sparse matrix, with a faster associated matrix-vector product and, as numerical experiments indicate, a much improved condition number. Though an appropriate localisation of the Green's function also depends on asymptotic information unavailable for general geometries, we can construct it adaptively in a frequency sweep from small to large frequencies in a way which automatically takes into account a general incident wave. We show that the approach is robust with respect to non-convex, multiple and even near-trapping domains, though the compression rate is clearly lower in the latter case. Furthermore, in spite of its asymptotic nature, the method is robust with respect to low-order discretizations such as piecewise constants, linears or cubics, commonly used in applications. On the other hand, we do not decrease the total number of degrees of freedom compared to a conventional classical discretization. The combination of the ...
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。