A Comparison of Jacobi and Gauss-Seidel Parallel Iterations
نویسنده
چکیده
We consider an iterative algorithm in which several components are updated in parallel at each stage. We assume that the underlying iteration mapping is monotone and we show that the speed of convergence is maximized when all components are updated at each iteration.
منابع مشابه
Generalized Jacobi and Gauss-Seidel Methods for Solving Linear System of Equations
respectively. There are many iterative methods such as GMRES [7] and Bi-CGSTAB [9] algorithms for solving Eq. (1.1) which are more efficient than the Jacobi and Gauss-Seidel methods. However, when these methods are combined with the more efficient methods, for example as a preconditioner, can be quite successful. For example see [4, 6]. It has been proved that if A is a strictly diagonally domi...
متن کاملFixed-point Fast Sweeping Weno Methods for Steady State Solution of Scalar Hyperbolic Conservation Laws
Fast sweeping methods were developed in the literature to efficiently solve static Hamilton-Jacobi equations. This class of methods utilize the Gauss-Seidel iterations and alternating sweeping strategy to achieve fast convergence rate. They take advantage of the properties of hyperbolic partial differential equations (PDEs) and try to cover a family of characteristics of the corresponding Hamil...
متن کاملSome p-norm convergence results for Jacobi and Gauss-Seidel iterations
Let A be a matrix such that the diagonal matrix D with the same diagonal as A is invertible. It is well known that if (1) A satisfies the Sassenfeld condition then its Gauss-Seidel scheme is convergent, and (2) if D−1A certifies certain classical diagonal dominance conditions then the Jacobi iterations for A are convergent. In this paper we generalize the second result and extend the first resu...
متن کاملAsynchronous Analogs of Iterative Methods and Their Efficiency for Parallel Computers
This paper gives the comparison of some iterative methods (Jacobi method, Gauss–Seidel method and the Successive over-relaxation method) for solving systems of linear equations with their asynchronous implementations. Experiments show the effectiveness of asynchronous iterative methods for solving linear algebra problems on parallel multiprocessor systems.
متن کاملPreconditioning Waveform Relaxation Iterations for Differential Systems
We discuss preconditioning and overlapping of waveform relaxation methods for sparse linear diierential systems. It is demonstrated that these techniques signiicantly improve the speed of convergence of the waveform relaxation iterations resulting from application of various modes of block Gauss-Jacobi and block Gauss-Seidel methods to diierential systems. Numerical results are presented for li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989