scispace - formally typeset
Journal ArticleDOI

Convergence of Matrix Iterations Subject to Diagonal Dominance

K. R. James
- 01 Jun 1973 - 
- Vol. 10, Iss: 3, pp 478-484
TLDR
In this paper, the convergence conditions for stationary relaxation processes of Gauss-Seidel and Jacobi types were established for linear systems of linear equations with respect to necessary and sufficient conditions for convergence.
Abstract
Cyclic iterative methods of solving systems of linear equations are investigated with reference to necessary and sufficient conditions for convergence. A new and concise method of proof is given for the convergence of point Gauss–Seidel and Jacobi iterations subject to strict and irreducible weak diagonal dominance. The method is developed to obtain convergence conditions, not previously established, for stationary relaxation processes of Gauss–Seidel and Jacobi type. Bounds are obtained on the spectral radius of the iteration matrix, hence a range of values of the relaxation parameter is derived sufficient to guarantee convergence.

read more

Citations
More filters
Journal ArticleDOI

Computational methods of linear algebra

TL;DR: A survey of computational methods in linear algebra can be found in this article, where the authors discuss the means and methods of estimating the quality of numerical solution of computational problems, the generalized inverse of a matrix, the solution of systems with rectangular and poorly conditioned matrices, and more traditional questions such as algebraic eigenvalue problems and systems with a square matrix.
Journal ArticleDOI

On recurring theorems on diagonal dominance

TL;DR: In this paper, the authors give a number of equivalent conditions which reproduce, and in some cases strengthen, many consequences of recent generalizations of the property of diagonally dominant n x n complex matrices.
Journal ArticleDOI

A Survey on M-Matrices

George Poole, +1 more
- 01 Oct 1974 - 
TL;DR: In this article, the authors unify many of the more recent results on nonsingular and singular M-matrices (in the sense of Ostrowski and Schneider) and present some new results.
Journal ArticleDOI

Improving the modified Gauss-Seidel method for Z-matrices

TL;DR: This paper uses the preconditioning matrix I + S(α) to show that if a coefficient matrix A is an irreducibly diagonally dominant Z-matrix, then [I + S (α)]A is also a strictly diagonal dominant Z -matrix and is shown that the proposed method is also superior to other iterative methods.
Journal ArticleDOI

Partially asynchronous, parallel algorithms for network flow and other problems

TL;DR: The problem of computing a fixed point of a nonexpansive function f is considered, and simulation results illustrating the attainable speedup and the effects of asynchronism are presented.
References
More filters
Journal ArticleDOI

A Recurring Theorem on Determinants

TL;DR: In this article, a recurring theorem on determinants is proposed for determining determinants, and it is shown that theorem holds for all determinants in the case of determinants.