A stable matrix version of the fast multipole method: stabilization strategies and examples
From MaRDI portal
Publication:2055513
DOI10.1553/etna_vol54s581zbMath1475.65026OpenAlexW3203168160MaRDI QIDQ2055513
Publication date: 1 December 2021
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2021-2030/vol54/abstract.php?vol=54&pages=581-609
Factorization of matrices (15A23) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical linear algebra (65F99)
Related Items (2)
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices ⋮ Physics-informed distribution transformers via molecular dynamics and deep neural networks
Uses Software
Cites Work
- Unnamed Item
- Efficient fast multipole method for low-frequency scattering
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A fast algorithm for the inversion of general Toeplitz matrices
- Rapid solution of integral equations of classical potential theory
- A generalized one-dimensional fast multipole method with application to filtering of spherical harmonics
- Hierarchical matrices based on a weak admissibility criterion
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- \(\mathcal H^2\)-matrix approximation of integral operators by interpolation
- The fast multipole method: Numerical implementation
- A fast simple algorithm for computing the potential of charges on a line
- A kernel independent fast multipole algorithm for radial basis functions
- An \(O(N)\) direct solver for integral equations on the plane
- A Matrix Version of the Fast Multipole Method
- Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions
- On the Stability of Some Hierarchical Rank Structured Matrix Algorithms
- Parallel Randomized and Matrix-Free Direct Solvers for Large Structured Dense Linear Systems
- Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
- On the Complexity of Some Hierarchical Structured Matrix Algorithms
- Fast algorithms for hierarchically semiseparable matrices
- SMASH: Structured matrix approximation by separation and hierarchy
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case
- An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- An Implementation of the Fast Multipole Method without Multipoles
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- Accuracy and Stability of Numerical Algorithms
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- Analytical Low-Rank Compression via Proxy Point Selection
- A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A fast multipole method for Maxwell equations stable at all frequencies
- A Fast Solver for HSS Representations via Sparse Matrices
- A fast algorithm for particle simulations
This page was built for publication: A stable matrix version of the fast multipole method: stabilization strategies and examples
