A Recursive Skeletonization Factorization Based on Strong Admissibility
From MaRDI portal
Publication:5737769
DOI10.1137/16M1095949zbMath1365.65286arXiv1609.08130MaRDI QIDQ5737769
Victor Minden, Lexing Ying, Kenneth L. Ho
Publication date: 30 May 2017
Published in: Multiscale Modeling & Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.08130
numerical exampleselliptic partial differential equationspreconditionersfast multipole methodmatrix factorizationlinear integral equationsfast direct solverslinear computational complexitystrong admissibilityhierarchical factorizations
Numerical methods for integral equations (65R20) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Boundary element methods for boundary value problems involving PDEs (65N38) Linear integral equations (45A05) Preconditioners for iterative methods (65F08)
Related Items
Approximate inversion of discrete Fourier integral operators ⋮ Overlapping Domain Decomposition Preconditioner for Integral Equations ⋮ An accelerated, high-order accurate direct solver for the Lippmann-Schwinger equation for acoustic scattering in the plane ⋮ On Integral Equation Methods for the First Dirichlet Problem of the Biharmonic and Modified Biharmonic Equations in NonSmooth Domains ⋮ FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions ⋮ Simple non-extensive sparsification of the hierarchical matrices ⋮ Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems ⋮ Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver ⋮ A fast solver for the narrow capture and narrow escape problems in the sphere ⋮ Asymmetric transport computations in Dirac models of topological insulators ⋮ Interpolative Decomposition Butterfly Factorization ⋮ Fast Spatial Gaussian Process Maximum Likelihood Estimation via Skeletonization Factorizations ⋮ Fast multipole methods for the evaluation of layer potentials with locally-corrected quadratures ⋮ A hierarchical butterfly LU preconditioner for two-dimensional electromagnetic scattering problems involving open surfaces ⋮ Analytical Low-Rank Compression via Proxy Point Selection ⋮ Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors ⋮ Parallel Skeletonization for Integral Equations in Evolving Multiply-Connected Domains
Cites Work
- Unnamed Item
- Unnamed Item
- A fast direct solver for the integral equations of scattering theory on planar curves with corners
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A fast direct solver for a class of elliptic partial differential equations
- A direct solver with \(O(N)\) complexity for integral equations on one-dimensional domains
- The black-box fast multipole method
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A fast direct solver for boundary integral equations in two dimensions
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- An \(O(N)\) direct solver for integral equations on the plane
- Hierarchical Interpolative Factorization for Elliptic Operators: Integral Equations
- Estimating Extremal Eigenvalues and Condition Numbers of Matrices
- A Technique for Updating Hierarchical Skeletonization-Based Factorizations of Integral Operators
- An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Fast direct solvers for integral equations in complex three-dimensional domains
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
- Fast Spatial Gaussian Process Maximum Likelihood Estimation via Skeletonization Factorizations
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
- 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
- The Inverse Fast Multipole Method: Using a Fast Approximate Direct Solver as a Preconditioner for Dense Linear Systems
- Methods of conjugate gradients for solving linear systems
- A fast algorithm for particle simulations
- A fast, direct algorithm for the Lippmann-Schwinger integral equation in two dimensions
