Learn More
To obtain an eecient parallel algorithm to solve sparse linear systems with the preconditioned conjugate gradient method, a parallel polynomial preconditioner based on a multisplitting of the matrix system is introduced. The preconditioner is obtained considering only the diagonal blocks of the multisplitting. The BSP complexity of the algorithm is analyzed(More)
  • 1