H-matrix (iterative method)
 | This article needs attention from an expert in mathematics. The specific problem is: to review the article. (July 2018) |
In mathematics, 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 i ≠ j, 1 ≤ i,j ≤ n and αij = |Aij| for all i = j, 1 ≤ i,j ≤ n. If M(A) is a M-matrix, A is a H-matrix.
Invertible H-matrix guarantees convergence of Gauss–Seidel iterative methods.[1]
See also
[edit]- Hurwitz-stable matrix
- P-matrix
- Perron–Frobenius theorem
- Z-matrix
- L-matrix
- M-matrix
- Comparison matrix
References
[edit]- ^ 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. arXiv:1410.3196. doi:10.13001/1081-3810.1972. Retrieved 21 June 2018.
 | This article about matrices is a stub. You can help Wikipedia by expanding it. |