Author(s)

Yong Liu, Shulin Wu

.

In this paper, we investigate an accelerated version of the discrete-time Jacobi waveform relaxation iteration method. Based on the well known Chebyshev polynomial theory, we show that significant speed up can be achieved by taking linear combinations of earlier iterates. The convergence and convergence speed of the new iterative method are presented and it is shown that the convergence speed of the new iterative method is sharper than that of the Jacobi method but blunter than that of the optimal SOR method. Moreover, at every iteration the new iterative method needs almost equal computation work and memory storage with the Jacobi method, and more important it can completely exploit the particular advantages of the Jacobi method in the sense of parallelism. We validate our theoretical conclusions with numerical experiments.

Discrete-Time Waveform Relaxation, Convergence, Parallel Computation, Chebyshev Polynomial, Jacobi Iteration, Optimal SOR

Y. Liu and S. Wu, "A Modified Discrete-Time Jacobi Waveform Relaxation Iteration," Applied Mathematics, Vol. 2 No. 4, 2011, pp. 496-503. doi: 10.4236/am.2011.24064.