We consider the iterative schemes for the large sparse linear system to solve partial differential equations. Using spectral radius of iteration matrices, the optimal relaxation parameters and good parameters can be obtained. With those parameters we compare the effectiveness of the SOR and SSOR algorithms. Applying Crank-Nicolson approximation, we observe the error distribution according to domain decomposition. The number of processors due to domain decomposition affects time and error. Numerical experiments show that effectiveness of SOR and SSOR can be reversed as time size varies, which is not the usual case. Finally, these phenomena suggest conjectures about equilibrium time grid for SOR and SSOR.