An iterative criterion for \(H\)-matrices (Q1379090)
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: An iterative criterion for \(H\)-matrices |
scientific article; zbMATH DE number 1116050
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative criterion for \(H\)-matrices |
scientific article; zbMATH DE number 1116050 |
Statements
An iterative criterion for \(H\)-matrices (English)
0 references
30 June 1998
0 references
A matrix \(A\) is a \(H\)-matrix if there is a positive diagonal matrix \(D\) such that \(AD\) is strictly diagonal dominant. This paper gives an algorithm (and a matlab implementation) that will construct the matrix \(D\) or will conclude that \(A\) is not a \(H\)-matrix. To within numerical precision this will be obtained in a finite number of iterations.
0 references
\(H\)-matrix
0 references
\(M\)-matrix
0 references
eigenvalues
0 references
diagonal dominant
0 references
matlab
0 references
algorithm
0 references
0 references
0.9721066
0 references
0.96706736
0 references
0.9633877
0 references
0.9534687
0 references
