### Abstract

M-matrices are important in the consideration of rates of convergence of iterative methods for solving large systems of equations and are applicable in areas such as input-output systems in economic modelling, queuing theory, and engineering. The usual definition of an M-matrix has, among other requirements, that it must be non-singular and its inverse non-negative. Following Saad (2003), Young (1971) and Berman and Shaked--Monderer (2003) two more easily checked characterisations of an M-matrix are explored. These require only the evaluation of the spectral radius of an associated non-negative matrix.

Original language | English |
---|---|

Pages (from-to) | C732-C743 |

Journal | ANZIAM Journal |

Volume | 46 |

Issue number | 5 (ELECTRONIC SUPPL.) |

Publication status | Published - 2004 |

## Fingerprint Dive into the research topics of 'A faster algorithm for identification of an M-Matrix'. Together they form a unique fingerprint.

## Cite this

Wood, R., & O'Neill, M. (2004). A faster algorithm for identification of an M-Matrix.

*ANZIAM Journal*,*46*(5 (ELECTRONIC SUPPL.)), C732-C743.