This paper proposes a dynamical approach to determine the optimal values of the parameters used in each iteration of the symmetric successive over-relaxation (SSOR), accelerated over-relaxation (AOR), and symmetric accelerated over-relaxation (SAOR) methods for solving linear equation systems. When the optimal values of the parameters in the SSOR, AOR, and SAOR are hard to determine as some fixed values, they are obtained by minimizing the merit functions, which are based on the maximal projection technique between the left- and right-hand-side vectors, which involves the input vector, the previous step values of the variables, and the parameters. The novelty is a new concept of the dynamical optimal values of the parameters, instead of the fixed values and the maximal projection technique. In a preferred range, the optimal values of the parameters can be quickly determined by using the golden section search algorithm with a loose convergence criterion. Without knowing and having the theoretical optimal values in general, the new methods might provide an alternative and proper choice of the values of the parameters for accelerating the convergence speed. Numerical testings of the linear Poisson equation discretized to a matrix–vector form and a Lyapunov equation form were used to assess the performance of the DOSSOR, DOAOR, and DOSAOR dynamical optimal methods.