On a new criterion for the H-matrix property (Q2371124)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a new criterion for the H-matrix property |
scientific article; zbMATH DE number 5168968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a new criterion for the H-matrix property |
scientific article; zbMATH DE number 5168968 |
Statements
On a new criterion for the H-matrix property (English)
0 references
29 June 2007
0 references
A new criterion for identifying generalized diagonally dominant matrices was given by \textit{K. Ojiro, H. Niki}, and \textit{M. Usui} [J. Comput. Appl. Math. 150, No.~2, 293--302 (2003; Zbl 1022.65048)] where the criterion is effective when the given matrix is irreducible. In this work, the authors present an improved method. The new method is always convergent and needs fewer iterations than the earlier one. A sufficient and necessary condition for any weakly diagonally dominant matrix to be an \(H\)-matrix is obtained. Some numerical examples for the effectiveness of the algorithm are presented at the end. As is well known, \(H\)-matrices are a special class of matrices with wide applications in enginnering and scientific computation. So it is very important to search some direct algorithms for identifying \(H\)-matrices.
0 references
generalized diagonally dominant matrix
0 references
\(H\)-matrix
0 references
iteration
0 references
numerical examples
0 references
algorithm
0 references
0.8615067005157471
0 references
0.8496781587600708
0 references
0.8489090800285339
0 references
0.8454160094261169
0 references