Fast multipole preconditioners for sparse matrices arising from elliptic equations
From MaRDI portal
Publication:1790219
DOI10.1007/s00791-017-0287-5zbMath1398.65039arXiv1308.3339OpenAlexW1795455446MaRDI QIDQ1790219
Publication date: 2 October 2018
Published in: Computing and Visualization in Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3339
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items (5)
Preconditioners for Krylov subspace methods: An overview ⋮ Exploiting spatial symmetries for solving Poisson's equation ⋮ Fast algorithms for large dense matrices with applications to biofluids ⋮ Distributed and Adaptive Fast Multipole Method in Three Dimensions ⋮ Extreme Scale FMM-Accelerated Boundary Integral Equation Solver for Wave Scattering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An adaptive fast direct solver for boundary integral equations in two dimensions
- A hierarchical \({\mathcal O}(N)\) force calculation algorithm
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
- Fast multipole methods on graphics processors
- Chebyshev semi-iteration in preconditioning for problems including the mass matrix
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- A portable parallel particle program
- Construction and arithmetics of \(\mathcal H\)-matrices
- On the existence and computation of rank-revealing LU factorizations
- Hierarchical quadrature for singular integrals
- Domain decomposition for multiscale PDEs
- Parallel implementation of 3D FFT with volumetric decomposition schemes for efficient molecular dynamics simulations
- A fast block low-rank dense solver with applications to finite-element matrices
- Hybrid cross approximation of integral operators
- FFT, FMM, or Multigrid? A comparative Study of State-Of-the-Art Poisson Solvers for Uniform and Nonuniform Grids in the Unit Cube
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Randomized algorithms for the low-rank approximation of matrices
- Segmental Refinement: A Multigrid Technique for Data Locality
- Numerical solution of saddle point problems
- Algorithm 866
- Performance Of H-Lu Preconditioning For Sparse Matrices
- Fast direct solvers for integral equations in complex three-dimensional domains
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Realistic Eigenvalue Bounds for the Galerkin Mass Matrix
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- Some fast 3D finite element solvers for the generalized Stokes problem
- A boundary integral equation method for the numerical solution of a second order elliptic equation with variable coefficients
- Solution of Sparse Indefinite Systems of Linear Equations
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- 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
- PVFMM: A Parallel Kernel Independent FMM for Particle and Volume Potentials
- Inexact Data‐Sparse Boundary Element Tearing and Interconnecting Methods
- Reducing communication in algebraic multigrid using additive variants
- Electronic Structure
- Use of Fast Direct Methods for the Efficient Numerical Solution of Nonseparable Elliptic Equations
- Methods of conjugate gradients for solving linear systems
- Boundary Element Methods
- A fast algorithm for particle simulations
This page was built for publication: Fast multipole preconditioners for sparse matrices arising from elliptic equations
