𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improving Jacobi and Gauss-Seidel Iterations

✍ Scribed by J.P. Milaszewicz

Book ID
104155895
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
500 KB
Volume
93
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

When convergent Jacobi or Gauss-Seidel iterations can be applied to solve systems of linear equations, a natural question is how convergence rates are affected if the original system is modified by performing some Gaussian elimination. We prove that if the initial iteration matrix is nonnegative, then such elimination improves convergence. Our results extend those contained in [4].

πŸ“œ SIMILAR VOLUMES

Post-processing of Gauss–Seidel iteratio
Post-processing of Gauss–Seidel iterations
✍ Michal KΕ™Γ­ΕΎek; Liping Liu; Pekka NeittaanmΓ€ki πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 66 KB

We examine a simple post-processing technique when solving the system of n linear algebraic equations Ax = b with a nonsingular matrix using the classical iterative methods such as the Gauss-Seidel method. We prove that this technique accelerates the convergence of iterations. Its efficiency is demo

Improving the modified Gauss-Seidel meth
Improving the modified Gauss-Seidel method for Z-matrices
✍ Toshiyuki Kohno; Hisashi Kotakemori; Hiroshi Niki; Masataka Usui πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 409 KB

In 1991 A. D. Gunawardena et al. reported that the convergence rate of the Gauss-Seidel method with a preconditioning matrix Z + S is superior to that of the basic iterative method. In this paper, we use the preconditioning matrix Z + S(a). If a coefficient matrix A is an irreducibly diagonally domi