Randomized Sparse Direct Solvers
From MaRDI portal
Publication:5300552
DOI10.1137/12087116XzbMath1269.65029OpenAlexW2083903752MaRDI QIDQ5300552
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
algorithmsnumerical examplespreconditioningfactorizationlarge sparse linear systemsadaptive schemegraph methodshierarchically semiseparable matrixstructured multifrontal methodmatrix-vector multiplicationsmatrix-free sparse direct solversrandomized sparse solverrank relaxationskinny extend-add operation
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08)
Related Items
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, Randomized numerical linear algebra: Foundations and algorithms, Effective matrix-free preconditioning for the augmented immersed interface method, A fast block low-rank dense solver with applications to finite-element matrices, Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations, Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations, A constrained spline dynamics (CSD) method for interactive simulation of elastic rods, Distributed-memory hierarchical interpolative factorization, Fast Sparse Selected Inversion, A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices, An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations, A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions, A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices, Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems, On the application of a hierarchically semi-separable compression for space-fractional parabolic problems with varying time steps, Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates, An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations, Transformations of matrix structures work again, Analytical Low-Rank Compression via Proxy Point Selection, Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations, Compressing Rank-Structured Matrices via Randomized Sampling, A survey of direct methods for sparse linear systems, Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions, Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients, An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices, A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations, A direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operators, Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations, An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling, Parallel Randomized and Matrix-Free Direct Solvers for Large Structured Dense Linear Systems, A Low-Rank Schwarz Method for Radiative Transfer Equation With Heterogeneous Scattering Coefficient, Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction, Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations, Improving Multifrontal Methods by Means of Block Low-Rank Representations, Interconnected hierarchical structures for fast direct elliptic solution, A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization, A Hierarchical Preconditioner for Wave Problems in Quasilinear Complexity
