高级检索

基于不完全LU分解的逆Broyden秩1拟Newton快速多极边界元法

Rank-one inverse Broyden quasi-Newton fast multipole boundary element method based on incomplete LU decomposition

  • 摘要: 针对大规模声学问题的求解,快速多极边界元法是一种高效的数值计算方法。快速多极边界元法通常需要结合线性方程组的迭代算法求解,其计算效率也受迭代算法收敛特性的影响,为此本文将具有超线性收敛性的逆Broyden秩1拟Newton迭代法应用于快速多极边界元法的迭代求解中,针对该迭代法中初始矩阵 \boldsymbolH_0 的选取和存储问题,本文采用不完全LU分解并提出一种阈值舍弃原则进行计算 \boldsymbolH_0 ,针对迭代修正矩阵 \boldsymbolH_k 的非显式直接存储计算提出了一种有效的解决方法,同时引入多核并行算法提高求解效率。通过将其应用于快速多极边界元法求解声学问题的典型算例对比表明,与目前使用最广泛的广义最小残差法在近远场影响系数计算次数的对比,本文所提的方法中计算次数更少,表明其具有更高的求解效率。

     

    Abstract: For the solution of large-scale acoustic problems, the fast multipole boundary element method (FMBEM) is an efficient numerical technique. It is typically coupled with iterative algorithms for solving the resulting linear systems; thus, its overall computational efficiency is strongly influenced by the convergence behavior of the chosen iterative solver. In this paper, we adopt the rank-one inverse Broyden quasi-Newton iterative method—a method exhibiting superlinear convergence—for the iterative solution within the FMBEM framework. Regarding the selection and storage of the initial approximation matrix in this iterative scheme, we employ incomplete LU (ILU) decomposition and propose a threshold-ratio-based elimination criterion to construct the preconditioner. Moreover, to avoid explicit formation and direct storage of the iterative correction matrix, we develop an efficient implicit update strategy. Furthermore, a multi-core parallelization algorithm is introduced to accelerate the entire iterative solution procedure. Numerical comparisons on representative acoustic benchmark problems demonstrate that the proposed iterative approach reduces the number of influence coefficient evaluations—both in the near-field and far-field interactions—compared with the widely used generalized minimum residual (GMRES) method. This reduction confirms the superior computational efficiency of the method presented in this paper.

     

/

返回文章
返回