Testing the irreducibility of nonsquare Perron-Frobenius systems

DOI10.1016/j.ipl.2014.05.004zbMath1360.65107OpenAlexW1997611828MaRDI QIDQ402391

Y. Haddad, David Peleg, Zvi Lotker, Chen Avin, Erez Kantor, Michael Borokhovich, Merav Parter

Publication date: 28 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.05.004

zbMATH Keywords

algorithmsirreducibilityPerron-Frobenius theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (2)

Testing the irreducibility of nonsquare Perron-Frobenius systems ⋮ The Collatz-Wielandt quotient for pairs of nonnegative operators.

Cites Work

• Unnamed Item
• Testing the irreducibility of nonsquare Perron-Frobenius systems
• Perron-Frobenius properties of \(Ax-\lambda Bx\)
• On a Generalized Eigenvalue Problem for Nonsquare Pencils
• Fundamentals of Wireless Communication
• The Generalized Eigenvalue Problem for Nonsquare Pencils Using a Minimal Perturbation Approach
• Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications

This page was built for publication: Testing the irreducibility of nonsquare Perron-Frobenius systems