Graph partitioning using matrix values for preconditioning symmetric positive definite systems

Eugene Vecharynski, Yousef Saad, Masha Sosonkina

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


Prior to the parallel solution of a large linear system, it is required to perform a partitioning of its equations/unknowns. Standard partitioning algorithms are designed using the considerations of the efficiency of the parallel matrix-vector multiplication, and typically disregard the information on the coefficients of the matrix. This information, however, may have a significant impact on the quality of the preconditioning procedure used within the chosen iterative scheme. In the present paper, we suggest a spectral partitioning algorithm, which takes into account the information on the matrix coefficients and constructs partitions with respect to the objective of enhancing the quality of the nonoverlapping additive Schwarz (block Jacobi) preconditioning for symmetric positive definite linear systems. For a set of test problems with large variations in magnitudes of matrix coefficients, our numerical experiments demonstrate a noticeable improvement in the convergence of the resulting solution scheme when using the new partitioning approach.

Original languageEnglish (US)
Pages (from-to)A63-A87
JournalSIAM Journal on Scientific Computing
Issue number1
StatePublished - 2014


  • Cauchy Bunyakowski Schwarz (CBS) constant
  • Graph partitioning
  • Iterative linear system solution
  • Preconditioning
  • Spectral partitioning
  • Symmetric positive definite


Dive into the research topics of 'Graph partitioning using matrix values for preconditioning symmetric positive definite systems'. Together they form a unique fingerprint.

Cite this