Performance Of H-Lu Preconditioning For Sparse Matrices
From MaRDI portal
Publication:3549585
Recommendations
- Survey on the technique of hierarchical matrices
- An algebraic approach for \({\mathcal{H}}\)-matrix preconditioners
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Hierarchical matrix techniques for a domain decomposition algorithm
Cited in
(14)- Sparse hierarchical solvers with guaranteed convergence
- \(\mathcal H\)-LU factorization in preconditioners for augmented Lagrangian and grad-div stabilized saddle point systems
- Rapid error reduction for block Gauss-Seidel based onp-hierarchical basis
- Survey on the technique of hierarchical matrices
- Existence of $\mathcal {H}$-matrix approximants to the inverses of BEM matrices: The simple-layer operator
- \(\mathcal {H}\)-matrix approximability of the inverses of FEM matrices
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
- H-LU factorization on many-core systems
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Approximating inverse FEM matrices on non-uniform meshes with \(\mathcal{H}\)-matrices
- Hierarchical matrix techniques for a domain decomposition algorithm
- \({\mathscr{H}} \)-matrix approximability of inverses of discretizations of the fractional Laplacian
This page was built for publication: Performance Of H-Lu Preconditioning For Sparse Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549585)
