A new algorithmic characterization of \(H\)-matrices (Q864819)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5125254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithmic characterization of \(H\)-matrices |
scientific article; zbMATH DE number 5125254 |
Statements
A new algorithmic characterization of \(H\)-matrices (English)
0 references
13 February 2007
0 references
The authors present a new iterative non-parameter method which allows an algorithmic characterization of \(H\)-matrices.This means that the proposed algorithm stops after a finite number of steps if and only if the input matrix \(A\) is an \(H\)-matrix. Actually, the method is an improvement of a known algorithm already presented in literature by \textit{T.-Z. Huang, J.-S. Long, E. L. Wachspress} and \textit{Y. Y. Tang} [Comput. Math. Appl. 48, 1587--1601 (2004; Zbl 1075.65044)], but it really works differently and significantly better. Two examples are reported to enlighten the features of this new method.
0 references
\(H\)-matrix
0 references
diagonally dominant matrix
0 references
iterative algorithm
0 references
numerical examples
0 references
0.8947421312332153
0 references
0.8779416680335999
0 references
0.8755562901496887
0 references
0.8728722333908081
0 references
