.png){kind=icon}
.png){kind=icon}
Return
Extensions of certain graph-based algorithms for preconditioning
.png){kind=icon}
OA
AI
DOI：10.1137/060661284.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The original TPABLO algorithms are a collection of algorithms which compute a symmetric permutation of a linear system such that the permuted system has a relatively full block diagonal with relatively large nonzero entries. This block diagonal can then be used as a preconditioner. We propose and analyze three extensions of this approach: We incorporate a nonsymmetric permutation to obtain a large diagonal, we use a more general parametrization for TPABLO, and we use a block Gauss-Seidel preconditioner which can be implemented to have the same execution time as the corresponding block Jacobi preconditioner. Experiments are presented showing that for certain classes of matrices, the block Gauss-Seidel preconditioner used with the system permuted with the new algorithm can outperform the best ILUT preconditioners in a large set of experiments.
Keywords:
block partitioning
PABLO
TPABLO
preconditioning
block gauss-seidel
ILU decomposition
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available