Testing the irreducibility of nonsquare Perron-Frobenius systems
DOI10.1016/J.IPL.2014.05.004zbMATH Open1360.65107OpenAlexW1997611828MaRDI QIDQ402391FDOQ402391
Authors: Y. Haddad, David Peleg, Chen Avin, Michael Borokhovich, E. Kantor, Zvi Lotker, M. 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
Recommendations
- Generalized Perron-Frobenius theorem for multiple choice matrices, and applications
- scientific article; zbMATH DE number 1135796
- Perron-Frobenius theory in nearly linear time: positive eigenvectors, M-matrices, graph kernels, and other applications
- Criteria and algorithms for irreducibility and aperiodicity of nonnegative matrices
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
Applications of graph theory (05C90) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Fundamentals of Wireless Communication
- Title not available (Why is that?)
- The Generalized Eigenvalue Problem for Nonsquare Pencils Using a Minimal Perturbation Approach
- Perron-Frobenius properties of \(Ax-\lambda Bx\)
- Testing the irreducibility of nonsquare Perron-Frobenius systems
- On a Generalized Eigenvalue Problem for Nonsquare Pencils
- Generalized Perron-Frobenius theorem for multiple choice matrices, and applications
Cited In (3)
This page was built for publication: Testing the irreducibility of nonsquare Perron-Frobenius systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402391)
