Arbitrarily finely divisible stochastic matrices
From MaRDI portal
Cites work
- A Schur Algorithm for Computing Matrix pth Roots
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- A solution to the reversible embedding problem for finite Markov chains
- Algorithms for the matrix \(p\)th root
- Embeddability and rate identifiability of Kimura 2-parameter matrices
- Explicit \(p\)-dependent convergence regions of Newton's method for the matrix \(p\)th root
- Finding generators for Markov chains via empirical transition matrices, with applications to credit ratings
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 1235881 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 3027889 (Why is no real title available?)
- Infinitely divisible nonnegative matrices, M-matrices, and the embedding problem for finite state stationary Markov chains
- Matrix roots and embedding conditions for three-state discrete-time Markov chains with complex eigenvalues
- Nonnegative square roots of matrices
- On \(p\)th roots of stochastic matrices
- On the m-th roots of a complex matrix
- Some results on the embeddable problem for discrete-time Markov models in manpower planning
- Stochastic pth root approximation of a stochastic matrix: A Riemannian optimization approach
- Sufficient embedding conditions for three-state discrete-time Markov chains with real eigenvalues
- The imbedding problem for finite Markov chains
This page was built for publication: Arbitrarily finely divisible stochastic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963344)