Parallel Randomized and Matrix-Free Direct Solvers for Large Structured Dense Linear Systems
From MaRDI portal
Publication:2830628
DOI10.1137/15M1023774zbMath1352.65094MaRDI QIDQ2830628
Maarten V. de Hoop, Jian-Lin Xia, Xiao Liu
Publication date: 28 October 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
distributed memoryscalable algorithmtree structurehierarchically semiseparable (HSS) matricesmatrix-free direct solvernumerical rank detectionparallel hierarchical algorithmsrandomized compression
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (14)
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices ⋮ Distributed-memory hierarchical interpolative factorization ⋮ A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices ⋮ A numerical study of multi-parameter full waveform inversion with iterative regularization using multi-frequency vibroseis data ⋮ A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions ⋮ Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates ⋮ Analytical Low-Rank Compression via Proxy Point Selection ⋮ Robust and Effective eSIF Preconditioning for General Dense SPD Matrices ⋮ Solving the Three-Dimensional High-frequency Helmholtz Equation Using Contour Integration and Polynomial Preconditioning ⋮ A stable matrix version of the fast multipole method: stabilization strategies and examples ⋮ A preconditioning technique for all-at-once system from the nonlinear tempered fractional diffusion equation ⋮ A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems ⋮ Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction ⋮ Interconnected hierarchical structures for fast direct elliptic solution
Uses Software
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- A randomized algorithm for the decomposition of matrices
- A high-performance, portable implementation of the MPI message passing interface standard
- A fast randomized algorithm for the approximation of matrices
- On a new class of structured matrices
- Introduction to hierarchical matrices with applications.
- Incomplete cross approximation in the mosaic-skeleton method
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Effective matrix-free preconditioning for the augmented immersed interface method
- On the Stability of Some Hierarchical Rank Structured Matrix Algorithms
- Imaging Strong Localized Scatterers with Sparsity Promoting Optimization
- Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
- On the Complexity of Some Hierarchical Structured Matrix Algorithms
- A Fast Randomized Eigensolver with Structured LDL Factorization Update
- Randomized algorithms for the low-rank approximation of matrices
- Fast algorithms for hierarchically semiseparable matrices
- 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
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- ScaLAPACK Users' Guide
- An introduction to hierarchical matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Randomized Sparse Direct Solvers
- Efficient Scalable Algorithms for Solving Dense Linear Systems with Hierarchically Semiseparable Structures
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Multiple Scattering of Waves
- The Multiple Scattering of Waves. I. General Theory of Isotropic Scattering by Randomly Distributed Scatterers
- A fast algorithm for particle simulations
This page was built for publication: Parallel Randomized and Matrix-Free Direct Solvers for Large Structured Dense Linear Systems
