Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-29T03:33:18.437Z Has data issue: false hasContentIssue false
  • English
  • Français

Iterations for Diagonally Dominant Matrices

Published online by Cambridge University Press:  20 November 2018

P. N. Shivakumar  and
Kim Ho Chew
P. N. Shivakumar
Affiliation:
Department of Applied Mathematics, The University of Manitoba, Winnipeg, Manitoba, CanadaR3T 2N2
Kim Ho Chew
Affiliation:
School of Mathematical Sciences, University of Siences of Malaysia, Penang, Malaysia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Matrix iterative methods of solving systems of linear algebraic equations for a class of matrices which includes strictly and irreducibly diagonally dominant matrices are considered and a convergence theorem proved.

Keywords

65F1015A0615A15Iterationsalgebraic systemsdiagonally dominant matrices
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 19 , Issue 3 , 01 September 1976 , pp. 375 - 377
Copyright
Copyright © Canadian Mathematical Society 1976

References

1. James, K. R., Convergence of Matrix Iterations Subject to Diagonal Dominance, SIAM J. Numer. Anal. Vol. 10, No. 3, (1973), 478–484.Google Scholar
2. Shivakumar, P. N. and Chew, K. H., A sufficient condition for non-vanishing of determinants, Proc. of Amer. Math. Soc. Vol. 43, 1 (1974), 63–66.Google Scholar
3. Varga, R. S., Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, N.J., 1962.Google Scholar