Characterization of H-matrices (Q1779591): Difference between revisions

\(H\)-matrices arise and play an important role in many applications of the mathematical sciences. An algorithmic characterization of \(H\)-matrices was investigated by \textit{B. Li, L. Lei, M. Harada, H. Niki} and \textit{M. J. Tsatsomeros} [Linear Algebra Appl. 271, 179--190, (1998; Zbl 0891.15021)]. Their method is useful, but entails estimating an optimum value for a parameter \(\varepsilon,\) that plays a crucial role in the algorithm. In part I of this paper, the authors present a new method which eliminates the arbitrary parameter and which is an equivalent algorithmic characterization of \(H\)-matrices. A few examples are given to illustrate relative merits of the two methods. Part II describes the author's new algorithm which seems to eliminate deficiencies in methods discussed in part I.