An iterative criterion for \(H\)-matrices (Q1379090): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4326384 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Criteria for generalized diagonally dominant matrices and \(M\)-matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Criteria for generalized diagonally dominant matrices and \(M\)-matrices. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040931 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extension of the criteria for generalized diagonally dominant matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on generalized diagonally dominant matrices / rank | |||
Normal rank |
Latest revision as of 11:04, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An iterative criterion for \(H\)-matrices |
scientific article |
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