Randomized sparse direct solvers
DOI10.1137/12087116XzbMATH Open1269.65029OpenAlexW2083903752MaRDI QIDQ5300552FDOQ5300552
Authors: Jianlin Xia 
Publication date: 27 June 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/12087116x
Recommendations
- A distributed-memory randomized structured multifrontal method for sparse direct solutions
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Efficient structured multifrontal factorization for general large sparse matrices
algorithmsnumerical examplespreconditioningfactorizationlarge sparse linear systemshierarchically semiseparable matrixstructured multifrontal methodgraph methodsadaptive schemematrix-vector multiplicationsmatrix-free sparse direct solversrandomized sparse solverrank relaxationskinny extend-add operation
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08)
Cited In (39)
- A Hierarchical Preconditioner for Wave Problems in Quasilinear Complexity
- A survey of direct methods for sparse linear systems
- Distributed-memory hierarchical interpolative factorization
- Interconnected hierarchical structures for fast direct elliptic solution
- A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices
- Randomized numerical linear algebra: Foundations and algorithms
- Analytical Low-Rank Compression via Proxy Point Selection
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- A Low-Rank Schwarz Method for Radiative Transfer Equation With Heterogeneous Scattering Coefficient
- Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations
- Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients
- Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations
- An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices
- Effective matrix-free preconditioning for the augmented immersed interface method
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations
- Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations
- Transformations of matrix structures work again
- A constrained spline dynamics (CSD) method for interactive simulation of elastic rods
- A direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operators
- Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Sparsified block elimination for directed laplacians
- SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices
- Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates
- Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction
- A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions
- A fast block low-rank dense solver with applications to finite-element matrices
- On the application of a hierarchically semi-separable compression for space-fractional parabolic problems with varying time steps
- Title not available (Why is that?)
- A fast memory efficient construction algorithm for hierarchically semi-separable representations
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Compressing Rank-Structured Matrices via Randomized Sampling
- A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
- Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions
- Fast Sparse Selected Inversion
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
This page was built for publication: Randomized sparse direct solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300552)
