H-matrix (iterative method)
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.
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
H-matrix (iterative method)
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.
has abstract
In mathematics, an H-matrix is ...... auss–Seidel iterative methods.
@en
Wikipage page ID
57,726,619
page length (characters) of wiki page
Wikipage revision ID
961,674,098
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In mathematics, an H-matrix is ...... auss–Seidel iterative methods.
@en
label
H-matrix (iterative method)
@en