第三章有限马尔科夫链的代数处理方法 - 欢迎来到重庆邮电大学理学院.docVIP

编 号： 审定成绩： 重庆邮电大学 毕业设计（论文） 设计（论文）题目： 学 院 名 称 ： 数理学院 学 生 姓 名 ： 专 业 ： 信息与计算科学 班 级 ： 043002 学 号 ： 0120209 指 导 教 师 ： 答辩组 负责人 ： 填表时间：201年月 重庆邮电大学教务处 摘 要【关键词】  ABSTRACT Markov chain is the nature of mathematics with discrete-time Markov random process. Since 1907，Since 1907, Soviet scientists mathematicians A.A.Markov proposed the concept of Markov chain, because of the unremitting efforts of several generations mathematicians around the world, the Markov chain theory recently became a complete content-rich branch of mathematics. Nowadays, as a mathematical tool which becomes more and more complete, Markov chain is used in various fields. With the mutual penetration of the Markov chain and the other branches of mathematics, more and more theories and methods are combined with the Markov chain. And they form into new theories and tools. Those theories and tools are widely used in physics, chemistry, biology, astronomy, meteorology, geology, control theory, communications, random service, economics, management, education, and so many realms. This article will analyze limited Markov chain perspective in Algebra theory. This paper will Focus on the multi-step transition probability and study on it with Algebra theory and tools. Finally, take it in to the comparison with traditional method and theory. This article deduced the computational complexity of expression for the algebraic algorithm and traditional algorithms at first. And then through observing and analyzing the expression to draw conclusions. And by drawing the graphics of expression using MATLAB, more intuitive and specific conclusions are given. Through Compiling multi-step transition probability algebraic algorithm and the traditional algorithm by MATLAB, we can compare their efficiency through actual operations. We get finally conclusion: the algebraic algorithm is more efficient