I am using the METIS to partition a matrix and then using domain decomposition to solve the subdomains in parallel using the Restricted Additive Schwarz method.
I am currently trying to solve some SPD matrices. Using METIS'
METIS_PartGraphKway(...), I partition the matrix. I think this function minimizes edge cuts. I am sorry, my knowledge on graph partitioning is limited. So my question is, after the partition, is the SPD-ness of each of the sub-domain matrix preserved ?
For simple cases of Laplacian 2d or other matrices such as bcsstk10 , bcsstk16 from the Matrix market which have more or less quite regular structure and non-zero entries near the diagonals, this property seems to hold, but for slightly more irregular matrices such as bcsstk38 (which is still SPD) it seems that the local solver does not converge.