Abstract
Markov chains are named after Prof. Andrei A. Markov (1856–1922). He was born on June 14, 1856 in Ryazan, Russia and died on July 20, 1922 in St. Petersburg, Russia. Markov enrolled at the University of St. Petersburg, where he earned a master’s degree and a doctorate degree. He was a professor at St. Petersburg and also a member of the Russian Academy of Sciences.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Altman E (1999) Constrained markov decision processes. Chapman and Hall/CRC, London
Axelsson O (1996) Iterative solution methods. Cambridge University Press, New York
Baum L (1972) An inequality and associated maximization techniques in statistical estimation for probabilistic function of Markov processes. Inequality 3:1–8
Berman A, Plemmons R (1994) Nonnegative matrices in the mathematical sciences. Society for industrial and applied mathematics, Philadelphia
Bini D, Latouche G, Meini B (2005) Numerical methods for structured Markov chains. Oxford University Press, New York
Chan R, Ng M (1996) Conjugate gradient method for Toeplitz systems. SIAM Rev 38:427–482
Ching W (1997) Circulant preconditioners for failure prone manufacturing systems. Linear Algebra Appl 266:161–180
Ching W (1997) Markov modulated poisson processes for multi-location inventory problems. Int J Product Econ 53:217–223
Ching W (1998) Iterative methods for manufacturing systems of two stations in Tandem. Appl Math Lett 11:7–12
Ching W (2001) Iterative methods for queuing and manufacturing systems. Springer monographs in mathematics. Springer, London
Golub G, van Loan C (1989) Matrix computations. John Hopkins University Press, Baltimore
Häggström (2002) Finite Markov chains and algorithmic applications. London mathematical society, Student Texts 52. Cambridge University Press, Cambridge
Hestenes M, Stiefel E (1952) Methods of conjugate gradients for solving linear systems. J Res Nat Bureau Stand 49:490–436
Horn R, Johnson C (1985) Matrix analysis. Cambridge University Press, Cambridge
Kahan W (1958) Gauss-Seidel methods of solving large systems of linear equations. Ph.D. thesis, University of Toronto
Kincaid D, Cheney W (2002) Numerical analysis: mathematics of scientific computing, 3rd edn. Books/Cole Thomson Learning, CA
Koski T (2001) Hidden Markov models for bioinformatics. Kluwer, Dordrecht
Lim J (1990) Two-dimensional signal and image processing. Prentice Hall, Englewood Cliffs
MacDonald I, Zucchini W (1997) Hidden Markov and other models for discrete-valued time series. Chapman & Hall, London
Priestley M (1981) Spectral anslysis and time series. Academic, New York
Puterman M (1994) Markov decision processes: discrete stochastic dynamic programming. Wiley, New York
Rabiner L (1989) A tutorial on hidden Markov models and selected applications in speech recognition. Proc IEEE 77:257–286
Ross S (2000) Introduction to probability models, 7th edn. Academic, New York
Saad Y (2003) Iterative methods for sparse linear systems society for industrial and applied mathematics, 2nd edn. SIAM, Philadelphia
Sonneveld P (1989) A fast Lanczos-type solver for non-symmetric linear systems. SIAM J Scientif Comput 10:36–52
Trench W (1964) An algorithm for the inversion of finite Toeplitz matrices. SIAM J Appl Math 12:515–522
Viterbi A (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans Inform Theory 13:260–269
White D (1993) Markov decision processes. Wiley, Chichester
Winston W (1994) Operations research: applications and algorithms, Belmont Calif., 3rd edn. Duxbury, North Scituate
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ching, WK., Huang, X., Ng, M.K., Siu, TK. (2013). Introduction. In: Markov Chains. International Series in Operations Research & Management Science, vol 189. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-6312-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6312-2_1
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-6311-5
Online ISBN: 978-1-4614-6312-2
eBook Packages: Business and EconomicsBusiness and Management (R0)