Parallel hybrid preconditioning: incomplete factorization with selective sparse approximate inversion
From MaRDI portal
Recommendations
Cited in
(15)- Fine-grained parallel incomplete LU factorization
- Recent advancements in preconditioning techniques for large size linear systems suited for high performance computing
- A robust multilevel approximate inverse preconditioner for symmetric positive definite matrices
- A supernodal block factorized sparse approximate inverse for non-symmetric linear systems
- How to generate effective block Jacobi preconditioners for solving large sparse linear systems
- A parallel wavelet-based algebraic multigrid black-box solver and preconditioner
- A latency tolerant hybrid sparse solver using incomplete Cholesky factorization
- High Performance Computing for Computational Science - VECPAR 2004
- A class of symmetric factored approximate inverses and hybrid two-level solver
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
- MSP: A Class of Parallel Multistep Successive Sparse Approximate Inverse Preconditioning Strategies
- Preconditioners based on strong subgraphs
- Scalable Parallel Preconditioning with the Sparse Approximate Inverse of Triangular Matrices
- scientific article; zbMATH DE number 2099046 (Why is no real title available?)
- A scalable parallel algorithm for incomplete factor preconditioning
Describes a project that uses
Uses Software
This page was built for publication: Parallel hybrid preconditioning: incomplete factorization with selective sparse approximate inversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168795)