## Nonnegative Matrices in the Mathematical SciencesHere is a valuable text and research tool for scientists and engineers who use or work with theory and computation associated with practical problems relating to Markov chains and queuing networks, economic analysis, or mathematical programming. Originally published in 1979, this new edition adds material that updates the subject relative to developments from 1979 to 1993. Theory and applications of nonnegative matrices are blended here, and extensive references are included in each area. You will be led from the theory of positive operators via the Perron-Frobenius theory of nonnegative matrices and the theory of inverse positivity, to the widely used topic of M-matrices. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Nonnegative Matrices | 24 |

Semigroups of Nonnegative Matrices | 63 |

Symmetric Nonnegative Matrices | 87 |

Generalized InversePositivity 1 Introduction | 112 |

Irreducible Monotonicity | 115 |

Generalized InversePositivity | 117 |

Generalized Monomial Matrices _ | 122 |

Set Monotonicity | 127 |

Nonnegativity and Convergence | 181 |

Singular Linear Systems | 196 |

Exercises | 203 |

Notes | 207 |

Finite Markov Chains 1 Introduction | 211 |

Examples | 214 |

Classical Theory of Chains 218 | 218 |

Modern Analysis of Chains | 226 |

Exercises | 128 |

Notes | 130 |

MMatrices 1 Introduction | 132 |

Nonsingular MMatrices | 133 |

MMatrices and Completely Monotonie Functions | 142 |

General MMatrices | 147 |

Exercises | 158 |

Notes | 161 |

Iterative Methods for Linear Systems 1 Introduction ч | 165 |

A Simple Example | 167 |

Basic Iterative Methods | 170 |

The SOR Method | 172 |

Exercises | 237 |

Notes | 241 |

InputOutput Analysis in Economics 1 Introduction _ | 243 |

A Simple Application _ _ | 246 |

The Open Model | 251 |

The Closed Model | 258 |

Exercises | 265 |

Notes | 268 |

The Linear Complementarity Problem | 271 |

Supplement 19791993 | 299 |

322 | |

### Common terms and phrases

algebraic algorithm assume basic Berman Chapter characterizations closed Leontief model coefficient column complementary completely positive compute consider convergence Corollary Let cyclic defined denote diagonal elements diagonal matrix diagonally dominant doubly stochastic matrices doubly stochastic matrix e n(K eigenvalue eigenvector entries equivalent example Exercise extreme points feasible finite Gauss-Seidel method given graph hermitian idempotent implies inequalities input matrix input-output inverse-positive iterative methods Jacobi method K-irreducible K-monotone least element linear equations linear system Markov chain monomial monotone Moreover nonnegative matrix nonsingular M-matrix nonzero notation open Leontief model p-cyclic permutation matrix Perron-Frobenius theorem Plemmons positive definite primitive principal minors probability distribution vector problem Proof Let proper cone Prove regular splitting row sums Section semiconvergent semigroup Show singular solution SOR method spectral radius stationary probability stochastic matrix submatrix Suppose symmetric matrix systems of linear Theorem 2.3 Theorem Let theory transition matrix Varga zero