Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver

DOI10.1016/j.jcp.2023.112627arXiv2301.12704OpenAlexW4388571626MaRDI QIDQ6119254

Vaishnavi Gujjula, Sivaram Ambikasaran

Publication date: 29 February 2024

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.12704

zbMATH Keywords

preconditionerfast multipole methodhierarchical matricesfast direct solverlow-rank matricesextended sparsification

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Numerical methods for partial differential equations, boundary value problems (65Nxx) Computer aspects of numerical algorithms (65Yxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing nested bases approximations from the entries of non-local operators
• A kernel-independent adaptive fast multipole algorithm in two and three dimensions
• An adaptive fast direct solver for boundary integral equations in two dimensions
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• Construction and arithmetics of \(\mathcal H\)-matrices
• Introduction to hierarchical matrices with applications.
• Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates
• Application of the inverse fast multipole method as a preconditioner in a 3D Helmholtz boundary element method
• A fast direct solver for boundary integral equations in two dimensions
• The fast multipole method: Numerical implementation
• An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
• Fast, Adaptive, High-Order Accurate Discretization of the Lippmann--Schwinger Equation in Two Dimensions
• Hierarchical Matrices: Algorithms and Analysis
• Randomized algorithms for the low-rank approximation of matrices
• Fast direct solvers for integral equations in complex three-dimensional domains
• Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
• A New Directional Algebraic Fast Multipole Method Based Iterative Solver for the Lippmann-Schwinger Equation Accelerated with HODLR Preconditioner
• A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
• On the Compression of Low Rank Matrices
• A Fast Solver for HSS Representations via Sparse Matrices
• A Recursive Skeletonization Factorization Based on Strong Admissibility
• The Inverse Fast Multipole Method: Using a Fast Approximate Direct Solver as a Preconditioner for Dense Linear Systems
• A fast algorithm for particle simulations
• HODLR2D: A New Class of Hierarchical Matrices

This page was built for publication: Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver