The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study
From MaRDI portal
Publication:2340362
DOI10.1007/s11075-014-9873-5zbMath1312.65037OpenAlexW1969096420MaRDI QIDQ2340362
Nicola Castelletto, Massimiliano Ferronato, Carlo Janna
Publication date: 16 April 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9873-5
linear systemsnumerical examplespreconditioningiterative methodsparallel computinggraph partitioning
Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08)
Related Items (5)
On the impact of heterogeneity-aware mesh partitioning and non-contributing computation removal on parallel reservoir simulations ⋮ A supernodal block factorized sparse approximate inverse for non-symmetric linear systems ⋮ A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems ⋮ Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations ⋮ A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- FSAI-based parallel mixed constraint preconditioners for saddle point problems arising in geomechanics
- Block approximate inverse preconditioners for sparse nonsymmetric linear systems
- A comparison of projective and direct solvers for finite elements in elastostatics
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- Factorized sparse approximate inverses for preconditioning
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- A generalized block FSAI preconditioner for nonsymmetric linear systems
- Preconditioners based on strong subgraphs
- Enhanced Block FSAI Preconditioning Using Domain Decomposition Techniques
- Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models
- The university of Florida sparse matrix collection
- A Block FSAI-ILU Parallel Preconditioner for Symmetric Positive Definite Linear Systems
- Factorized parallel preconditioner for the saddle point problem
- Adaptive Pattern Research for Block FSAI Preconditioning
- The Evolution of the Minimum Degree Ordering Algorithm
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Parallel Preconditioning with Sparse Approximate Inverses
- Crout Versions of ILU for General Sparse Matrices
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- Orderings for Factorized Sparse Approximate Inverse Preconditioners
- Sparse Approximate Inverses and Target Matrices
- Ordering, Anisotropy, and Factored Sparse Approximate Inverses
- An Approximate Minimum Degree Ordering Algorithm
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- New convergence results and preconditioning strategies for the conjugate gradient method
- ILUT: A dual threshold incomplete LU factorization
- Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning
- Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms
- Graph Partitioning Using Matrix Values for Preconditioning Symmetric Positive Definite Systems
This page was built for publication: The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study
