Parallel randomized and matrix-free direct solvers for large structured dense linear systems
From MaRDI portal
Publication:2830628
DOI10.1137/15M1023774zbMATH Open1352.65094MaRDI QIDQ2830628FDOQ2830628
Authors: Jianlin Xia, Maarten V. De Hoop, Xiao Liu 
Publication date: 28 October 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Recommendations
- A distributed-memory randomized structured multifrontal method for sparse direct solutions
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- scientific article; zbMATH DE number 6796233
- Randomized sparse direct solvers
- Efficient scalable algorithms for solving dense linear systems with hierarchically semiseparable structures
distributed memoryscalable algorithmtree structurehierarchically semiseparable (HSS) matricesmatrix-free direct solvernumerical rank detectionparallel hierarchical algorithmsrandomized compression
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- ScaLAPACK Users' Guide
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Fast algorithms for hierarchically semiseparable matrices
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A fast algorithm for particle simulations
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Incomplete cross approximation in the mosaic-skeleton method
- A high-performance, portable implementation of the MPI message passing interface standard
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- Randomized algorithms for the low-rank approximation of matrices
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- The Multiple Scattering of Waves. I. General Theory of Isotropic Scattering by Randomly Distributed Scatterers
- Introduction to hierarchical matrices with applications.
- On a new class of structured matrices
- A randomized algorithm for the decomposition of matrices
- A fast randomized algorithm for the approximation of matrices
- Multiple Scattering of Waves
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- On the complexity of some hierarchical structured matrix algorithms
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Randomized sparse direct solvers
- An introduction to hierarchical matrices
- On the stability of some hierarchical rank structured matrix algorithms
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- Efficient scalable algorithms for solving dense linear systems with hierarchically semiseparable structures
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- A fast randomized eigensolver with structured LDL factorization update
- Imaging strong localized scatterers with sparsity promoting optimization
- Effective matrix-free preconditioning for the augmented immersed interface method
Cited In (19)
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- A distributed-memory randomized structured multifrontal method for sparse direct solutions
- Distributed-memory hierarchical interpolative factorization
- Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Interconnected hierarchical structures for fast direct elliptic solution
- Efficient scalable algorithms for solving dense linear systems with hierarchically semiseparable structures
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- 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
- A parallel implementation of the CMRH method for dense linear systems
- Analytical low-rank compression via proxy point selection
- A fast contour-integral eigensolver for non-Hermitian matrices
- Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates
- Solving the three-dimensional high-frequency Helmholtz equation using contour integration and polynomial preconditioning
- A numerical study of multi-parameter full waveform inversion with iterative regularization using multi-frequency vibroseis data
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Randomized sparse direct solvers
- A stable matrix version of the fast multipole method: stabilization strategies and examples
Uses Software
This page was built for publication: Parallel randomized and matrix-free direct solvers for large structured dense linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830628)
