Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
From MaRDI portal
Recommendations
- Graph partitioning using matrix values for preconditioning symmetric positive definite systems
- Parallel Preconditioning with Sparse Approximate Inverses
- Parallel iterative methods for sparse linear systems
- On two-dimensional sparse matrix partitioning: models, methods, and a recipe
- scientific article; zbMATH DE number 833706
Cited in
(12)- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- Partitioning and reordering for spike-based distributed-memory parallel Gauss-Seidel
- A Matrix Partitioning Interface to PaToH in MATLAB
- Revisiting Hypergraph Models for Sparse Matrix Partitioning
- Preconditioning Sparse Matrices with Alternating and Multiplicative Operator Splittings
- Experiments and recommendations for partitioning systems of equations
- Design of an iterative solution module for a parallel sparse matrix library (P\_SPARSLIB)
- Multilevel iterated tabu search for the multi-constraint graph partitioning problem
- Iterative methods for solving sparse linear systems with a parallel preconditioner
- Graph partitioning using matrix values for preconditioning symmetric positive definite systems
- Greedy Coarsening Strategies for Nonsymmetric Problems
- An exact approach for the multi-constraint graph partitioning problem
This page was built for publication: Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3516105)
