A stable matrix version of the fast multipole method: stabilization strategies and examples
type: Item
instance of: scholarly article
title: A stable matrix version of the fast multipole method: stabilization strategies and examples
zbMATH Open document ID: 1475.65026
author: Difeng Cai
author: Jianlin Xia
publication date: 2021-12-01T00:00:00Z
full work available at URL: http://etna.mcs.kent.edu/volumes/2021-2030/vol54/abstract.php
Mathematics Subject Classification ID: 65F99
Mathematics Subject Classification ID: 15A23
Mathematics Subject Classification ID: 15A60
zbMATH DE Number: 7436831
zbMATH Keywords: numerical stability
zbMATH Keywords: fast multipole method
zbMATH Keywords: FMM matrix
zbMATH Keywords: scaling factor
zbMATH Keywords: low-rank approximation
zbMATH Keywords: HSS matrix
describes a project that uses: STRUMPACK
describes a project that uses: mctoolbox
MaRDI profile type: Publication
OpenAlex ID: W3203168160
cites work: An Implementation of the Fast Multipole Method without Multipoles
cites work: SMASH: Structured matrix approximation by separation and hierarchy
cites work: A Fast Solver for HSS Representations via Sparse Matrices
cites work: A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
cites work: A Superfast Algorithm for Toeplitz Systems of Linear Equations
cites work: An \(O(N)\) direct solver for integral equations on the plane
cites work: The fast multipole method: Numerical implementation
cites work: Efficient fast multipole method for low-frequency scattering
cites work: A fast multipole method for Maxwell equations stable at all frequencies
cites work: Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
cites work: A fast simple algorithm for computing the potential of charges on a line
cites work: A fast algorithm for particle simulations
cites work: \(\mathcal H^2\)-matrix approximation of integral operators by interpolation
cites work: Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
cites work: Hierarchical matrices based on a weak admissibility criterion
cites work: Q4513819
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Parallel randomized and matrix-free direct solvers for large structured dense linear systems
cites work: A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
cites work: An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
cites work: A fast algorithm for the inversion of general Toeplitz matrices
cites work: Rapid solution of integral equations of classical potential theory
cites work: A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
cites work: Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case
cites work: A matrix version of the fast multipole method
cites work: Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
cites work: On the stability of some hierarchical rank structured matrix algorithms
cites work: Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
cites work: On the complexity of some hierarchical structured matrix algorithms
cites work: Fast algorithms for hierarchically semiseparable matrices
cites work: A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
cites work: A generalized one-dimensional fast multipole method with application to filtering of spherical harmonics
cites work: Analytical Low-Rank Compression via Proxy Point Selection
cites work: A kernel independent fast multipole algorithm for radial basis functions
cites work: A kernel-independent adaptive fast multipole algorithm in two and three dimensions
DOI: 10.1553/ETNA_VOL54S581
published in: ETNA - Electronic Transactions on Numerical Analysis
description: scientific article; zbMATH DE number 7436831