nach oben

Erschienen in:

2013 | OriginalPaper | Buchkapitel

1. Introduction

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

Erschienen in: Markov Chains

Verlag: Springer US

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Jetzt informieren

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!

Jetzt informieren

Nächstes Kapitel Queueing Systems and the Web

Altman E (1999) Constrained markov decision processes. Chapman and Hall/CRC, London

Axelsson O (1996) Iterative solution methods. Cambridge University Press, New York

11.

Baum L (1972) An inequality and associated maximization techniques in statistical estimation for probabilistic function of Markov processes. Inequality 3:1–8

15.

Berman A, Plemmons R (1994) Nonnegative matrices in the mathematical sciences. Society for industrial and applied mathematics, PhiladelphiaCrossRef

18.

Bini D, Latouche G, Meini B (2005) Numerical methods for structured Markov chains. Oxford University Press, New YorkCrossRef

39.

Chan R, Ng M (1996) Conjugate gradient method for Toeplitz systems. SIAM Rev 38:427–482CrossRef

41.

Ching W (1997) Circulant preconditioners for failure prone manufacturing systems. Linear Algebra Appl 266:161–180CrossRef

42.

Ching W (1997) Markov modulated poisson processes for multi-location inventory problems. Int J Product Econ 53:217–223CrossRef

43.

Ching W (1998) Iterative methods for manufacturing systems of two stations in Tandem. Appl Math Lett 11:7–12CrossRef

46.

Ching W (2001) Iterative methods for queuing and manufacturing systems. Springer monographs in mathematics. Springer, London

108.

Golub G, van Loan C (1989) Matrix computations. John Hopkins University Press, Baltimore

111.

Häggström (2002) Finite Markov chains and algorithmic applications. London mathematical society, Student Texts 52. Cambridge University Press, Cambridge

117.

Hestenes M, Stiefel E (1952) Methods of conjugate gradients for solving linear systems. J Res Nat Bureau Stand 49:490–436

119.

Horn R, Johnson C (1985) Matrix analysis. Cambridge University Press, CambridgeCrossRef

128.

Kahan W (1958) Gauss-Seidel methods of solving large systems of linear equations. Ph.D. thesis, University of Toronto

132.

Kincaid D, Cheney W (2002) Numerical analysis: mathematics of scientific computing, 3rd edn. Books/Cole Thomson Learning, CA

135.

Koski T (2001) Hidden Markov models for bioinformatics. Kluwer, DordrechtCrossRef

149.

Lim J (1990) Two-dimensional signal and image processing. Prentice Hall, Englewood Cliffs

155.

MacDonald I, Zucchini W (1997) Hidden Markov and other models for discrete-valued time series. Chapman & Hall, London

172.

Priestley M (1981) Spectral anslysis and time series. Academic, New York

173.

Puterman M (1994) Markov decision processes: discrete stochastic dynamic programming. Wiley, New YorkCrossRef

175.

Rabiner L (1989) A tutorial on hidden Markov models and selected applications in speech recognition. Proc IEEE 77:257–286CrossRef

181.

Ross S (2000) Introduction to probability models, 7th edn. Academic, New York

182.

Saad Y (2003) Iterative methods for sparse linear systems society for industrial and applied mathematics, 2nd edn. SIAM, PhiladelphiaCrossRef

190.

Sonneveld P (1989) A fast Lanczos-type solver for non-symmetric linear systems. SIAM J Scientif Comput 10:36–52CrossRef

196.

Trench W (1964) An algorithm for the inversion of finite Toeplitz matrices. SIAM J Appl Math 12:515–522CrossRef

204.

Viterbi A (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans Inform Theory 13:260–269CrossRef

207.

White D (1993) Markov decision processes. Wiley, Chichester

208.

Winston W (1994) Operations research: applications and algorithms, Belmont Calif., 3rd edn. Duxbury, North Scituate

Titel: Introduction
verfasst von: Wai-Ki Ching
Ximin Huang
Michael K. Ng
Tak-Kuen Siu
Verlag: Springer US
Buch: Markov Chains
Print ISBN: 978-1-4614-6311-5

Electronic ISBN: 978-1-4614-6312-2

Copyright-Jahr: 2013
DOI: https://doi.org/10.1007/978-1-4614-6312-2_1