由自相似集生成强分离图递归集的算法  

An Algorithm to Generate Directed-graph Sets with the SSC from Self-similar Sets

作　　者：邓国泰[1] 刘春苔[2] 

机构地区：[1]华中师范大学数学与统计学学院,武汉430079 [2]武汉工业学院数理科学系,武汉430023

出　　处：《工程数学学报》2010年第4期699-703,共5页Chinese Journal of Engineering Mathematics

基　　金：国家自然科学基金(10771082;10926126)~~

摘　　要：本文讨论了由自相似集生成图递归集的算法。利用辅助函数迭代系,针对压缩率的为整数的倒数和数字集为有理数的自相似集,给出了一个新的算法,使得所生成的图递归集满足强分离条件。This paper discusses an algorithm to generate graph-directed sets from a self-similar set. Based on auxiliary iterated function systems, we give a new algorithm which can deal with a self-similar set whose compression ratio is a reciprocal of some positive integer and all entries of the digit set are rational numbers. Moreover, we prove that the generated graph-directed sets satisfy the strong separation condition.

关 键 词：迭代函数系 强分离条件 图递归集 

分 类 号：O174[理学—数学]