A study was conducted to derive number of sufficient conditions for the convex combination of a set of M-matrices to be an M-matrix. The conditions are obtained using as diverse tools as M-matrix properties and linear programming, mathematical induction and linear matrix inequalities, and, expectedly, the conditions are independent of each other. They can be used to verify with a varying degree of efficiency if all matrices in a given polytope are M-matrices by testing only the vertices of the polytope.
|Original language||English (US)|
|Number of pages||21|
|Journal||Nonlinear Analysis, Theory, Methods and Applications|
|State||Published - 2000|
ASJC Scopus subject areas
- Applied Mathematics