A partitioning algorithm for block-diagonal matrices with overlap

We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form of the matrix as the overlapped block-diagonal matrix. The partitioned matrix is suitable for applying the explicit formulation of Multiplicative Schwarz preconditioner (EFMS) described in [3]. The graph partitioning algorithm partitions the graph of the input matrix into K partitions, such

• Type: Journal
• Year: 2008
• Where: PC
• Authors: Guy Antoine Atenekeng Kahou, Laura Grigori, Masha Sosonkina
• Keywords: Matrix, Overlapped Block-diagonal Matrix, PC 2008, Programming Languages, Sparse Matrix