A parallel algorithm for computing the group inverse via perron complementation

Electronic Journal of Linear Algebra

Volumn 13, Issue , 2005, Pages

  Neumann, Michael ^a   Xu, Jianhong ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b UNIVERSITY OF WEST FLORIDA   (United States)

Author keywords

Group inverses; M matrices; Parallel algorithm; Perron complements

Indexed keywords

EID: 21244499371     PISSN: 10813810     EISSN: 10813810     Source Type: Journal    
DOI: 10.13001/1081-3810.1155     Document Type: Article

References (30)

1. K. M. Anstreicher and U. G. Rothblum. Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverses. Lin. Alg. Appl, 85:221-239, 1987.
2. A. Ben-Israel and T. N. E. Greville. Generalized Inverses: Theory and Applications, 2nd ed. Springer, New York, 2003.
3. A. Berman and R. J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. SIAM, Philadelphia, 1994.
4. S. L. Campbell and C. D. J. Meyer. Generalized Inverses of Linear Transformations. Dover Publications, New York, 1991.
5. E. Deutsch and M. Neumann. Derivatives of the Perron root at an essentially nonnegative matrix and the group inverse of an M-matrix. J. Math. Anal. Appl., 102:1-29, 1984.
6. E. Deutsch and M. Neumann. On the first and second order derivatives of the Perron vector. Lin. Alg. Appl., 71:57-76, 1985.
7. M. Eiermann, I. Marek, and W. Niethammer. On the solution of singular linear equations by semiiterative equations. Numer. Math., 53:265-283, 1988.
8. R. Funderlic and C. D. Meyer. Sensitivity of the stationary distribution vector for an ergodic Markov chain. Lin. Alg. Appl., 76:1-17, 1986.
9. G. Golub and C. D. Meyer. Using the QR factorization and group inversion to compute, differentiate, and estimate the sensitivity of stationary probabilities for Markov chains. SIAM J. Alg. Disc. Meth., 7:273-281, 1986.
10. G. Golub and C. Van Loan. Matrix Computation, 3rd ed. The John Hopkins Univ. Press, Baltimore, Maryland, 1996.
11. T. N. E. Greville. The Souriau-Prame algorithm and the Drazin pseudoinverse. MRC. Tech. Sum. Rep., 1182, 1972.
12. M. Hanke and M. Neumann. Preconditionings and splitting for singular systems. Numer. Math., 57:85-89, 1990.
13. R. E. Hartwig. More on the Souriau-Frame algorithm and the Drazin inverses. SIAM J. Appl. Math., 31:42-46, 1976.
14. M. Haviv and L. Van der Heyden. Perturbation bounds for the stationary probabilities of a finite Markov chain. Adv. Appl. Prob., 16:804-818, 1984.
15. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge Univ. Press, New York, 1985.
16. J. J. Hunter. Mixing times with applications to perturbed Markov chains. Preprint, Massey Univ., Auckland, New Zealand, 2003.
17. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Van Nostrand, Princeton, New Jersey, 1960.
18. S. J. Kirkland. The group inverse associated with an irreducible periodic nonnegative matrix. SIAM J. Matrix Anal. Appl., 16:1127-1134, 1995.
19. S. J. Kirkland and M. Neumann. Convexity and concavity of the Perron root and vector of Leslie matrices with applications to a population model. SIAM J. Matrix Anal. Appl., 15:1092-1107, 1994.
20. S. J. Kirkland and M. Neumann. Outpoint decoupling and first passage times for random walks on graphs. SIAM J. Matrix Anal. Appl., 20:860-870, 1999.
21. S. J. Kirkland, M. Neumann, and B. Shader. Application of Paz's inequality to perturbation bounds for Markov chains. Lin. Alg. Appl., 268:183-196, 1998.
22. S. J. Kirkland, M. Neumann, and J. Xu. A divide and conquer approach to computing the mean first passage matrix for Markov chains via Perron complement reduction. Numer. Lin. Alg. Appl., 8:287-295, 2001.
23. S. J. Kirkland, M. Neumann, and J. Xu. Convexity and elasticity of the growth rate in sizeclassified population models. SIAM J. Matrix Anal. Appl., 26:170-185, 2004.
24. M. Levene and G. Loizou. Kemeny's constant and the random surfer. Amer. Math. Month., 109:741-745, 2002.
25. C. D. J. Meyer. The role of the group generalized inverse in the theory of finite Markov chains. SIAM Rev., 17:443-464, 1975.
26. C. D. Meyer. The condition of a finite Markov chain and perturbation bounds for the limiting probabilities. SIAM J. Alg. Disc. Meth., 1:273-283, 1980.
27. C. D. Meyer. Uncoupling the Perron eigenvector problem. Lin. Alg. Appl., 114/115:69-94, 1989.
28. C. D. Meyer. Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. SIAM Rev., 31:240-272, 1989.
29. M. Neumann and J. Xu. On the stability of the computation of the stationary probabilities of Markov chains using Perron complements. Numer. Lin. Alg. Appl., 10:603-618, 2003.
30. E. Seneta. Sensitivity analysis, ergodicity coefficients, and rank-one updates for finite Markov chains. (W. J. Stewart, ed.) Numerical Solution of Markov Chains, Marcel Dekker, New York, 1991.