Accurate computation of the smallest eigenvalue of a diagonally dominant \(M\)-matrix (Q2759093)
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 1680748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accurate computation of the smallest eigenvalue of a diagonally dominant \(M\)-matrix |
scientific article; zbMATH DE number 1680748 |
Statements
10 December 2001
0 references
entrywise perturbation
0 references
diagonal dominant matrix
0 references
\(M\)-matrix
0 references
algorithms
0 references
numerical examples
0 references
smallest eigenvalue
0 references
inverse matrix
0 references
0 references
0 references
Accurate computation of the smallest eigenvalue of a diagonally dominant \(M\)-matrix (English)
0 references
Algorithms for the computation of the smallest eigenvalue and the entries in the inverse matrix of diagonally dominant \(M\)-matrices are devised. The algorithms require the knowledge of each off-diagonal element and the sum of each row within a certain accuracy and compute the aforementioned data within the same accuracy. Numerical examples are given to illustrate the performance of the algorithms.
0 references
0.8368470072746277
0 references
0.7649812698364258
0 references
0.7572776675224304
0 references
