An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
From MaRDI portal
Publication:5113365
DOI10.1137/19M123806XzbMath1441.65048arXiv1901.02971MaRDI QIDQ5113365
Sivasankaran Rajamanickam, Erik G. Boman, Leopold Cambier, Chao Chen, Raymond S. Tuminaro, Eric Darve
Publication date: 4 June 2020
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.02971
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20) Preconditioners for iterative methods (65F08)
Related Items (11)
A fast direct solver for nonlocal operators in wavelet coordinates ⋮ Hierarchical orthogonal factorization: sparse least squares problems ⋮ FROSch Preconditioners for Land Ice Simulations of Greenland and Antarctica ⋮ An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations ⋮ Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems ⋮ Hierarchical interpolative factorization preconditioner for parabolic equations ⋮ Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors ⋮ Robust and Effective eSIF Preconditioning for General Dense SPD Matrices ⋮ Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices ⋮ RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems ⋮ Hierarchical Orthogonal Factorization: Sparse Square Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast direct solver for elliptic problems on general meshes in 2D
- Rang revealing QR factorizations
- The black-box fast multipole method
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- \(\mathcal H^2\)-matrix approximation of integral operators by interpolation
- Strong rank revealing LU factorizations
- Recursively preconditioned hierarchical interpolative factorization for elliptic partial differential equations
- A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
- The university of Florida sparse matrix collection
- Randomized algorithms for the low-rank approximation of matrices
- On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Fast algorithms for hierarchically semiseparable matrices
- Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LAPACK Users' Guide
- Generalized Nested Dissection
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
- Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization
- Efficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients
- BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
- ILUT: A dual threshold incomplete LU factorization
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- Randomized Sparse Direct Solvers
- On the Compression of Low Rank Matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
- A relaxation method for solving elliptic difference equations
- Nested Dissection of a Regular Finite Element Mesh
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
- Methods of conjugate gradients for solving linear systems
- A fast algorithm for particle simulations
- A review of algebraic multigrid
- PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
This page was built for publication: An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
