Skip to main content
Top
Published in:
Cover of the book

2013 | OriginalPaper | Chapter

1. Introduction

Authors : Wai-Ki Ching, Ximin Huang, Michael K. Ng, Tak-Kuen Siu

Published in: Markov Chains

Publisher: Springer US

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
3.
go back to reference Altman E (1999) Constrained markov decision processes. Chapman and Hall/CRC, London Altman E (1999) Constrained markov decision processes. Chapman and Hall/CRC, London
8.
go back to reference Axelsson O (1996) Iterative solution methods. Cambridge University Press, New York Axelsson O (1996) Iterative solution methods. Cambridge University Press, New York
11.
go back to reference Baum L (1972) An inequality and associated maximization techniques in statistical estimation for probabilistic function of Markov processes. Inequality 3:1–8 Baum L (1972) An inequality and associated maximization techniques in statistical estimation for probabilistic function of Markov processes. Inequality 3:1–8
15.
go back to reference Berman A, Plemmons R (1994) Nonnegative matrices in the mathematical sciences. Society for industrial and applied mathematics, PhiladelphiaCrossRef Berman A, Plemmons R (1994) Nonnegative matrices in the mathematical sciences. Society for industrial and applied mathematics, PhiladelphiaCrossRef
18.
go back to reference Bini D, Latouche G, Meini B (2005) Numerical methods for structured Markov chains. Oxford University Press, New YorkCrossRef Bini D, Latouche G, Meini B (2005) Numerical methods for structured Markov chains. Oxford University Press, New YorkCrossRef
39.
go back to reference Chan R, Ng M (1996) Conjugate gradient method for Toeplitz systems. SIAM Rev 38:427–482CrossRef Chan R, Ng M (1996) Conjugate gradient method for Toeplitz systems. SIAM Rev 38:427–482CrossRef
41.
go back to reference Ching W (1997) Circulant preconditioners for failure prone manufacturing systems. Linear Algebra Appl 266:161–180CrossRef Ching W (1997) Circulant preconditioners for failure prone manufacturing systems. Linear Algebra Appl 266:161–180CrossRef
42.
go back to reference Ching W (1997) Markov modulated poisson processes for multi-location inventory problems. Int J Product Econ 53:217–223CrossRef Ching W (1997) Markov modulated poisson processes for multi-location inventory problems. Int J Product Econ 53:217–223CrossRef
43.
go back to reference Ching W (1998) Iterative methods for manufacturing systems of two stations in Tandem. Appl Math Lett 11:7–12CrossRef Ching W (1998) Iterative methods for manufacturing systems of two stations in Tandem. Appl Math Lett 11:7–12CrossRef
46.
go back to reference Ching W (2001) Iterative methods for queuing and manufacturing systems. Springer monographs in mathematics. Springer, London Ching W (2001) Iterative methods for queuing and manufacturing systems. Springer monographs in mathematics. Springer, London
108.
go back to reference Golub G, van Loan C (1989) Matrix computations. John Hopkins University Press, Baltimore Golub G, van Loan C (1989) Matrix computations. John Hopkins University Press, Baltimore
111.
go back to reference Häggström (2002) Finite Markov chains and algorithmic applications. London mathematical society, Student Texts 52. Cambridge University Press, Cambridge Häggström (2002) Finite Markov chains and algorithmic applications. London mathematical society, Student Texts 52. Cambridge University Press, Cambridge
117.
go back to reference Hestenes M, Stiefel E (1952) Methods of conjugate gradients for solving linear systems. J Res Nat Bureau Stand 49:490–436 Hestenes M, Stiefel E (1952) Methods of conjugate gradients for solving linear systems. J Res Nat Bureau Stand 49:490–436
119.
go back to reference Horn R, Johnson C (1985) Matrix analysis. Cambridge University Press, CambridgeCrossRef Horn R, Johnson C (1985) Matrix analysis. Cambridge University Press, CambridgeCrossRef
128.
go back to reference Kahan W (1958) Gauss-Seidel methods of solving large systems of linear equations. Ph.D. thesis, University of Toronto Kahan W (1958) Gauss-Seidel methods of solving large systems of linear equations. Ph.D. thesis, University of Toronto
132.
go back to reference Kincaid D, Cheney W (2002) Numerical analysis: mathematics of scientific computing, 3rd edn. Books/Cole Thomson Learning, CA Kincaid D, Cheney W (2002) Numerical analysis: mathematics of scientific computing, 3rd edn. Books/Cole Thomson Learning, CA
135.
149.
go back to reference Lim J (1990) Two-dimensional signal and image processing. Prentice Hall, Englewood Cliffs Lim J (1990) Two-dimensional signal and image processing. Prentice Hall, Englewood Cliffs
155.
go back to reference MacDonald I, Zucchini W (1997) Hidden Markov and other models for discrete-valued time series. Chapman & Hall, London MacDonald I, Zucchini W (1997) Hidden Markov and other models for discrete-valued time series. Chapman & Hall, London
172.
go back to reference Priestley M (1981) Spectral anslysis and time series. Academic, New York Priestley M (1981) Spectral anslysis and time series. Academic, New York
173.
go back to reference Puterman M (1994) Markov decision processes: discrete stochastic dynamic programming. Wiley, New YorkCrossRef Puterman M (1994) Markov decision processes: discrete stochastic dynamic programming. Wiley, New YorkCrossRef
175.
go back to reference Rabiner L (1989) A tutorial on hidden Markov models and selected applications in speech recognition. Proc IEEE 77:257–286CrossRef Rabiner L (1989) A tutorial on hidden Markov models and selected applications in speech recognition. Proc IEEE 77:257–286CrossRef
181.
go back to reference Ross S (2000) Introduction to probability models, 7th edn. Academic, New York Ross S (2000) Introduction to probability models, 7th edn. Academic, New York
182.
go back to reference Saad Y (2003) Iterative methods for sparse linear systems society for industrial and applied mathematics, 2nd edn. SIAM, PhiladelphiaCrossRef Saad Y (2003) Iterative methods for sparse linear systems society for industrial and applied mathematics, 2nd edn. SIAM, PhiladelphiaCrossRef
190.
go back to reference Sonneveld P (1989) A fast Lanczos-type solver for non-symmetric linear systems. SIAM J Scientif Comput 10:36–52CrossRef Sonneveld P (1989) A fast Lanczos-type solver for non-symmetric linear systems. SIAM J Scientif Comput 10:36–52CrossRef
196.
go back to reference Trench W (1964) An algorithm for the inversion of finite Toeplitz matrices. SIAM J Appl Math 12:515–522CrossRef Trench W (1964) An algorithm for the inversion of finite Toeplitz matrices. SIAM J Appl Math 12:515–522CrossRef
204.
go back to reference Viterbi A (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans Inform Theory 13:260–269CrossRef Viterbi A (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans Inform Theory 13:260–269CrossRef
207.
go back to reference White D (1993) Markov decision processes. Wiley, Chichester White D (1993) Markov decision processes. Wiley, Chichester
208.
go back to reference Winston W (1994) Operations research: applications and algorithms, Belmont Calif., 3rd edn. Duxbury, North Scituate Winston W (1994) Operations research: applications and algorithms, Belmont Calif., 3rd edn. Duxbury, North Scituate
Metadata
Title
Introduction
Authors
Wai-Ki Ching
Ximin Huang
Michael K. Ng
Tak-Kuen Siu
Copyright Year
2013
Publisher
Springer US
DOI
https://doi.org/10.1007/978-1-4614-6312-2_1