盒维数的不确定性与迭代分形维数的算法 |
| |
引用本文: | 杨飞.盒维数的不确定性与迭代分形维数的算法[J].渝西学院学报(自然科学版),2006(5). |
| |
作者姓名: | 杨飞 |
| |
作者单位: | 重庆南开中学 重庆沙坪坝400030 |
| |
摘 要: | 盒维数是分形几何中的一个重要概念,“数盒子法”广泛用于应用学科.盒维数具有不确定性,对于迭代分形对象,其迭代方法与分维数、盒维数存在直接联系,从迭代方法中构造数列,通过数列求得的盒维数,正好与分维数相等.
|
关 键 词: | 分形几何 盒维数 不确定性 分维数 迭代分形对象 |
The Uncertainty of Box-counting and Counting of Iterative Fractal |
| |
Authors: | YANG Fei |
| |
Abstract: | Box-counting is an important definition in fractal geometry,and box-counting method is widely used in applied subjects.We discover that box-counting has the characteristic of uncertainty.As for iterative fractal object,iterative method directly affectes fractal dimension and box-counting.If we build sequence of number with iterative method and we will get box-counting with sequence of number,which is exactly equtl to fractal dimension. |
| |
Keywords: | fractal geometry box-counting uncertainty fractal dimension iterative fractal object |
本文献已被 CNKI 等数据库收录! |
|