We present a new algorithm for computing the Perron root of a nonnegative irreducible matrix. The algorithm is formulated by combining a reciprocal of the well known Collatz's formula with a special inverse iteration algorithm discussed in [10, Linear Algebra Appl., 15 (1976), pp 235-242]. Numerical experiments demonstrate that our algorithm is able to compute the Perron root accurately and faster than other well known algorithms; in particular, when the size of the matrix is large. The proof of convergence of our algorithm is also presented.
| Identifer | oai:union.ndltd.org:NCSU/oai:NCSU:etd-02192007-224304 |
| Date | 09 March 2007 |
| Creators | chanchana, prakash |
| Contributors | Carl D. Meyer, Ernie L. Stitzinger, Zhilin Li, Min Kang |
| Publisher | NCSU |
| Source Sets | North Carolina State University |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://www.lib.ncsu.edu/theses/available/etd-02192007-224304/ |
| Rights | unrestricted, I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dis sertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. |
Page generated in 0.0084 seconds