An O(N) Direct Solver for Integral Equations on the Plane

An efficient direct solver for volume integral equations with O(N) complexity for a broad range of problems is presented. The solver relies on hierarchical compression of the discretized integral operator, and exploits that off-diagonal blocks of certain dense matrices have numerically low rank. Technically, the solver is inspired by previously developed direct solvers for integral equations based on "recursive skeletonization" and "Hierarchically Semi-Separable" (HSS) matrices, but it improves on the asymptotic complexity of existing solvers by incorporating an additional level of compression. The resulting solver has optimal O(N) complexity for all stages of the computation, as demonstrated by both theoretical analysis and numerical examples. The computational examples further display good practical performance in terms of both speed and memory usage. In particular, it is demonstrated that even problems involving 10^{7} unknowns can be solved to precision 10^{-10} using a simple Matlab implementation of the algorithm executed on a single core.

[1]  Henk A. van der Vorst,et al.  Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..

[2]  Ran Duan,et al.  High-order quadratures for the solution of scattering problems in two dimensions , 2009, J. Comput. Phys..

[3]  Leslie Greengard,et al.  A Fast Semidirect Least Squares Algorithm for Hierarchically Block Separable Matrices , 2012, SIAM J. Matrix Anal. Appl..

[4]  Steffen Börm.  Construction of Data-Sparse H2-Matrices by Hierarchical Compression , 2009, SIAM J. Sci. Comput..

[5]  L. Grasedyck,et al.  Domain-decomposition Based ℌ-LU Preconditioners , 2007 .

[6]  Y. Mukaigawa,et al.  Large Deviations Estimates for Some Non-local Equations I. Fast Decaying Kernels and Explicit Bounds , 2022 .

[7]  Steffen Börm,et al.  H 2-matrix arithmetics in linear complexity , 2022 .

[8]  Zydrunas Gimbutas,et al.  A Generalized Fast Multipole Method for Nonoscillatory Kernels , 2003, SIAM J. Sci. Comput..

[9]  Leslie Greengard,et al.  On the Numerical Solution of Two-Point Boundary Value Problems , 1991 .

[10]  Nathan Halko,et al.  Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..

[11]  Jianlin Xia,et al.  On the Complexity of Some Hierarchical Structured Matrix Algorithms , 2012, SIAM J. Matrix Anal. Appl..

[12]  V. Rokhlin,et al.  A randomized algorithm for the approximation of matrices , 2006 .

[13]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[14]  Per-Gunnar Martinsson,et al.  Randomized algorithms for the low-rank approximation of matrices , 2007, Proceedings of the National Academy of Sciences.

[15]  Lexing Ying,et al.  A fast direct solver for elliptic problems on general meshes in 2D , 2012, J. Comput. Phys..

[16]  W. Hackbusch,et al.  On the fast matrix multiplication in the boundary element method by panel clustering , 1989 .

[17]  James Bremer.  A fast direct solver for the integral equations of scattering theory on planar curves with corners , 2012, J. Comput. Phys..

[18]  Jianlin Xia,et al.  Superfast Multifrontal Method for Large Structured Linear Systems of Equations , 2009, SIAM J. Matrix Anal. Appl..

[19]  Vladimir Rokhlin,et al.  On the numerical solution of two-point boundary value problems II , 1994 .

[20]  Leslie Greengard,et al.  A fast algorithm for particle simulations , 1987 .

[21]  Per-Gunnar Martinsson,et al.  Fast direct solvers for integral equations in complex three-dimensional domains , 2009, Acta Numerica.

[22]  Shivkumar Chandrasekaran,et al.  On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs , 2010, SIAM J. Matrix Anal. Appl..

[23]  K. Abdella.  Numerical Solution of two-point boundary value problems using Sinc interpolation , 2012 .

[24]  Adrianna Gillman,et al.  Fast Direct Solvers for Elliptic Partial Differential Equations , 2011 .

[25]  V. Rokhlin,et al.  A fast randomized algorithm for the approximation of matrices ✩ , 2007 .

[26]  Per-Gunnar Martinsson,et al.  A direct solver with O(N) complexity for integral equations on one-dimensional domains , 2011, 1105.5372.

[27]  Yu Chen,et al.  A Fast, Direct Algorithm for the Lippmann–Schwinger Integral Equation in Two Dimensions , 2002, Adv. Comput. Math..

[28]  Mario Bebendorf,et al.  Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems , 2008 .

[29]  Steffen Börm.  -Matrix Arithmetics in Linear Complexity , 2005, Computing.

[30]  S. Börm.  Efficient Numerical Methods for Non-local Operators , 2010 .

[31]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[32]  Per-Gunnar Martinsson,et al.  A fast direct solver for scattering problems involving elongated structures , 2007, J. Comput. Phys..

[33]  K. Atkinson.  The Numerical Solution of Integral Equations of the Second Kind , 1997 .

[34]  V. Rokhlin,et al.  A fast direct solver for boundary integral equations in two dimensions , 2003 .

[35]  A. George.  Nested Dissection of a Regular Finite Element Mesh , 1973 .

[36]  Leslie Greengard,et al.  A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization , 2012, SIAM J. Sci. Comput..

[37]  Per-Gunnar Martinsson,et al.  A Fast Direct Solver for a Class of Elliptic Partial Differential Equations , 2009, J. Sci. Comput..

[38]  D. Zorin,et al.  A kernel-independent adaptive fast multipole algorithm in two and three dimensions , 2004 .

[39]  O. Widlund,et al.  Domain Decomposition Methods in Science and Engineering XVI , 2007 .

[40]  V. Rokhlin.  Rapid solution of integral equations of classical potential theory , 1985 .

[41]  Shivkumar Chandrasekaran,et al.  A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations , 2006, SIAM J. Matrix Anal. Appl..

[42]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[43]  D. Rose,et al.  Complexity Bounds for Regular Finite Difference and Finite Element Grids , 1973 .

[44]  L. Greengard,et al.  A new version of the Fast Multipole Method for the Laplace equation in three dimensions , 1997, Acta Numerica.

[45]  Jianlin Xia,et al.  Fast algorithms for hierarchically semiseparable matrices , 2010, Numer. Linear Algebra Appl..

[46]  Shivkumar Chandrasekaran,et al.  A Hierarchical Semi-separable Moore-Penrose Equation Solver , 2006 .

[47]  Shivkumar Chandrasekaran,et al.  A Fast Solver for HSS Representations via Sparse Matrices , 2006, SIAM J. Matrix Anal. Appl..