I have a linear problem with a sparse, psd and strictly diagonally dominant matrix. Can you please point me to some known best solvers (in terms of runtime, or easy to be practically optimized for multicore and SIMD system)?Currently my direction was to try conjugate gradient method, and it seems to solve the problem in about 8-10 iterations (for specific use case), which is pretty good. However I wonder if there are other solvers that take the advantages of those characteristics even better. Much thanks! 
LP solver for sparse, PSD and strictly diagonally dominant matrix
optimization;linear programming;convex optimization;sparse matrix