Abstract
Fast algorithms are proposed for calculating error bounds for a numerically computed Perron root and vector of an irreducible nonnegative matrix. Emphasis is put on the computational efficiency of these algorithms. Error bounds for the root and vector are based on the Collatz--Wielandt theorem, and estimating a solution of a linear system whose coefficient matrix is an $M$-matrix, respectively. We introduce a technique for obtaining better error bounds. Numerical results show properties of the algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
