Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks
From MaRDI portal
Publication:2890429
DOI10.1287/ijoc.1030.0041zbMath1239.65006OpenAlexW2122575996MaRDI QIDQ2890429
Amy N. Langville, William J. Stewart
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c188080cca01524bbade38c41bed477585df1e34
Computational methods in Markov chains (60J22) Formal languages and automata (68Q45) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)
Related Items (5)
A projection method and Kronecker product preconditioner for solving Sylvester tensor equations ⋮ A Machine Learning–Enabled Partially Observable Markov Decision Process Framework for Early Sepsis Prediction ⋮ Tensor product-type methods for solving Sylvester tensor equations ⋮ Multipreconditioned GMRES for simulating stochastic automata networks ⋮ Developing iterative algorithms to solve Sylvester tensor equations
Uses Software
This page was built for publication: Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks
