This paper introduces a fast direct algorithm for the singular boundary method (SBM) in two-dimensional (2D) problems, utilizing the hierarchical off-diagonal low-rank (HODLR) matrix concept as the foundation of the fast direct solver. The HODLR matrix is constructed by hierarchically partitioning the coefficient matrix into blocks using a binary tree, with all off-diagonal blocks at each level being represented as low-rank factors. Furthermore, The Sherman-Morrison-Woodbury formula can be used to efficiently compute the inverse of the HODLR matrix. The numerical experiment results demonstrate that the new fast solver can significantly improve the computational efficiency of the SBM while maintaining the same level of precision.
Read full abstract