NANAApr 18, 2017

Lower bounds of the minimum eigenvalue for $M$-matrices

arXiv:1704.05218h-index: 12
Originality Synthesis-oriented
AI Analysis

For researchers working on eigenvalue estimation of M-matrices, this offers improved lower bounds that are more accurate and can converge to the true value.

The paper provides monotone increasing sequences of lower bounds for the minimum eigenvalue of M-matrices, proving convergence and improvement over existing results, with numerical examples showing higher accuracy and occasional exactness.

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences are more accurate than some existing results and could reach the true value of the minimum eigenvalue in some cases.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes