Jump to content

H-matrix (iterative method)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Sharouser (talk | contribs) at 15:27, 20 June 2018 (Created page with 'An '''''H''-matrix''' is a matrix whose comparison matrix is an M-matrix. It is useful in iterative methods. '''Definition:...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

An H-matrix is a matrix whose comparison matrix is an M-matrix. It is useful in iterative methods.

Definition: Let A=(aij) be a n × n complex matrix. Then comparison matrix M(A) of complex matrix A is defined as M(A)ij where αij = -|Aij| for all ij, 1 ≤ i,jn and αij = |Aij| for all i = j, 1 ≤ i,jn. If M(A) is a M-matrix, A is a H-matrix.

Invertible H-matrix guarentees convergence of Gauss-Seidel iterative methods.[1]

See also

References

  1. ^ Zhang, Cheng-yi; Ye, Dan; Zhong, Cong-Lei; SHUANGHUA, SHUANGHUA (2015). "Convergence on Gauss-Seidel iterative methods for linear systems with general H-matrices". The Electronic Journal of Linear Algebra. 30: 843–870. doi:10.13001/1081-3810.1972. Retrieved 21 June 2018.