An iterative algorithm for computing mean first passage times of Markov chains
type: Item
instance of: scholarly article
title: An iterative algorithm for computing mean first passage times of Markov chains
zbMATH Open document ID: 1328.65016
author: Jianhong Xu
published in: Applied Mathematics and Computation
publication date: 2016-01-04T00:00:00Z
Mathematics Subject Classification ID: 65C40
Mathematics Subject Classification ID: 60J10
zbMATH DE Number: 6525911
zbMATH Keywords: mean first passage times
zbMATH Keywords: Markov chains
zbMATH Keywords: iterative algorithm
zbMATH Keywords: convergence
zbMATH Keywords: rank one updates
zbMATH Keywords: eigenvalues
describes a project that uses: mctoolbox
MaRDI profile type: Publication
full work available at URL: j.amc.2014.11.001
OpenAlex ID: W1978050747
cites work: Generalized inverses. Theory and applications.
cites work: Q4326384
cites work: Sharp bounds on the spectral radius of nonnegative matrices and digraphs
cites work: Generalized Inverses of Linear Transformations
cites work: Matrix analysis of a Markov chain small-world model
cites work: Derivatives of the spectral radius as a function of non-negative matrix elements
cites work: Derivatives of the Perron root at an essentially nonnegative matrix and the group inverse of an M-matrix
cites work: On the first and second order derivatives of the Perron vector
cites work: Eigenvalues of rank-one updated matrices with some applications
cites work: A classification of matrices of class Z
cites work: Q4134790
cites work: Some inequalities for the spectral radius of non-negative matrices and applications
cites work: LU decomposition of M-matrices by elimination without pivoting
cites work: Q5689624
cites work: Accurate Computation of the Fundamental Matrix of a Markov Chain
cites work: Overcoming Instability In Computing The Fundamental Matrix For A Markov Chain
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Q3998992
cites work: Q4303969
cites work: Q3326556
cites work: SIMPLE PROCEDURES FOR FINDING MEAN FIRST PASSAGE TIMES IN MARKOV CHAINS
cites work: A generalization of N-matrices
cites work: Q4094202
cites work: A divide and conquer approach to computing the mean first passage matrix for Markov chains via Perron complement reductions
cites work: Transition matrices for well-conditioned Markov chains
cites work: Perron complement and Perron root
cites work: Eigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations
cites work: The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
cites work: Typical changes in spectral properties under perturbation by an operator of rank one.
cites work: Recursive algorithm for the fundamental group inverse matrix of a Markov chain from an explicit formula
cites work: Q3998482
cites work: Q4947421
cites work: On the LU factorization of M-matrices
cites work: Q4039860
cites work: Markov chain small-world model with asymmetry: a unified and multivariate perspective
cites work: Average case analysis of the Markov chain small-world model
DOI: 10.1016/J.AMC.2014.11.001
Recommended article: The computation of the mean first passage times for Markov chains
Recommended article: First passage times and their algorithms for markov processes
Recommended article: Computing mean first passage times for a Markov chain
Recommended article: SIMPLE PROCEDURES FOR FINDING MEAN FIRST PASSAGE TIMES IN MARKOV CHAINS
Recommended article: An iterative approximation scheme for repetitive Markov processes
Recommended article: A computational approach to first-passage-time problems for Gauss-Markov processes
Recommended article: Computing Moments of First Passage Times to a Subset of States in Markov Chains
description: scientific article; zbMATH DE number 6525911