A block compression algorithm for computing preconditioners
From MaRDI portal
Recommendations
- Finding Exact and Approximate Block Structures for ILU Preconditioning
- scientific article; zbMATH DE number 2098242
- scientific article; zbMATH DE number 434789
- Graph partitioning using matrix values for preconditioning symmetric positive definite systems
- Algorithms for construction of preconditioners based on incomplete block-factorizations of the matrix
Cites work
- A Block Ordering Method for Sparse Matrices
- Approximate Inverse Techniques for Block-Partitioned Matrices
- Block approximate inverse preconditioners for sparse nonsymmetric linear systems
- Compressed Graphs and the Minimum Degree Algorithm
- Finding Exact and Approximate Block Structures for ILU Preconditioning
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- scientific article; zbMATH DE number 1508289 (Why is no real title available?)
- Numerical Linear Algebra for High-Performance Computers
- Refining an approximate inverse
- Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics
This page was built for publication: A block compression algorithm for computing preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448893)