Add routines to compute stochastic eigenvectors of Markov transition matrices #294
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Hello,
this pull request is to add routines to compute the stationary distribution vector of a Markov matrix, implementing an algorithm called the "GTH-algorithm", a numerically stable variant of Gaussian elimination. They should be useful in particular when the subdominant (second largest) eigenvalue of the Markov matrix is close to 1.
The routines, which are specialized in computing the eigenvector with eigenvalue 1 for irreducible Markov matrices, are much faster than the general purpose routine
eig.I also included some test code and added documents that describe the routines.
I hope you find this useful.