摘要
迭代是广泛存在的,而且是拓扑动力系统的基础,但它的运算却相当复杂.介绍了利用递归的办法来进行迭代运算的部分实例.
Iteration not only exists extensively, but also is the basis of Topology Dynamical Systems,nevertheless it is very complicated in operation. This article introduces some examples of iteration operation by using the recursion tree.
出处
《成都大学学报(自然科学版)》
2006年第4期257-259,共3页
Journal of Chengdu University(Natural Science Edition)
关键词
迭代
迭代运算
递归树
递归方程
渐近阶
iteration
iteration operation
recursion tree
recursion equation
asymptotic order