Some concepts from matrix theory are recalled and used to present an algorithm for nonnegative matrices that decides about the primitivity and reducibility of a given matrix. The algorithm is based on consideration on the level of the quiver of a nonnegative matrix and its corresponding path category. Necessary tools from representation theory and equivalence relations are used to study properties of a nonnegative matrix which leads to the proposed algorithm. It is pointed out that several aspects of additional statements about a matrix can be derived from the results of the algorithm.
- scientific article; zbMATH DE number 45862 (Why is no real title available?)
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1033392 (Why is no real title available?)
- scientific article; zbMATH DE number 3275139 (Why is no real title available?)
- Tame algebras and integral quadratic forms
- Criteria and algorithms for irreducibility and aperiodicity of nonnegative matrices
- On stability indicators of nonnegative matrices
- scientific article; zbMATH DE number 1135796 (Why is no real title available?)
- Positive properties of non-negative matrices
- A probabilistic algorithm for finding the term rank of non-negative matrices
This page was built for publication: Another algorithm for nonnegative matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874285)
