Some p-norm convergence results for Jacobi and Gauss-Seidel iterations

نویسندگان

  • Livinus U. Uko
  • Johnson C. Smith
  • Juan Carlos Orozco
  • J. C. OROZCO
چکیده

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 result to irreducible matrices satisfying a weak Sassenfeld condition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum norm convergence of multigrid methods for elliptic boundary value problems

We consider multigrid methods applied to standard linear finite element discretizations of linear elliptic boundary value problems in 2D. In the multigrid method damped Jacobi or damped Gauss-Seidel is used as a smoother. We prove that the two-grid method with v pre-smoothing iterations has a contraction number with respect to the maximum norm that is (asymptotically) bounded by Cv-~ I1n hkl 2 ...

متن کامل

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...

متن کامل

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.

متن کامل

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...

متن کامل

Generalized iterative methods for solving double saddle point problem

In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version  of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004