A new algorithmic characterization of \(H\)-matrices (Q864819): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.05.100 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029874443 / rank | |||
Normal rank | |||
Revision as of 23:08, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithmic characterization of \(H\)-matrices |
scientific article |
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
