期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
Graph-Directed Coalescence Hidden Variable Fractal Interpolation Functions
1
作者 Md. Nasim Akhtar M. Guru Prem Prasad 《Applied Mathematics》 2016年第4期335-345,共11页
Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated Function System (IFS) corresponding to a data set is the graph of the... Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated Function System (IFS) corresponding to a data set is the graph of the FIF. Coalescence Hidden-variable Fractal Interpolation Function (CHFIF) is both self-affine and non self-affine in nature depending on the free variables and constrained free variables for a generalized IFS. In this article, graph directed iterated function system for a finite number of generalized data sets is considered and it is shown that the projection of the attractors on is the graph of the CHFIFs interpolating the corresponding data sets. 展开更多
关键词 Iterated Function System graph-directed Iterated Function System Fractal Interpolation Functions Coalescence Hidden Variable FIFs
下载PDF
Connectedness of Invariant Sets of Graph-Directed IFS
2
作者 ZHANG Yanfang 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2016年第5期445-447,共3页
In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system(IFS). For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets ... In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system(IFS). For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets are connected, if and only if all the N graphs are connected; in this case, the invariant sets are all locally connected and path connected. Our result extends the results on the connectedness of the self-similar sets. 展开更多
关键词 self-similar set graph-directed iterated function system(IFS) connectedness locally connectedness
原文传递
GRAPH-DIRECTED STRUCTURES OFSELF-SIMILAR SETS WITH OVERLAPSGRAPH-DIRECTED STRUCTURES OFSELF-SIMILAR SETS WITH OVERLAPSS
3
《Chinese Annals of Mathematics,Series B》 SCIE CSCD 2000年第4期403-412,共页
关键词 SELF-SIMILAR SETS graph-directed SETS OVERLAPPING LABEL Pisot number
全文增补中
THE REGULARITY OF RANDOM GRAPH DIRECTED SELF-SIMILAR SETS 被引量:2
4
作者 ZhangXiaoqun LiuYanyan 《Acta Mathematica Scientia》 SCIE CSCD 2004年第3期485-492,共8页
A set in Rd is called regular if its Hausdorff dimension coincides with its upper box counting dimension. It is proved that a random graph-directed self-similar set is regular a.e..
关键词 Random graph-directed self-similar set Hausdorff dimension box-counting dimension REGULAR
下载PDF
Lipschitz equivalence of generalized {1,3,5}-{1,4,5} self-similar sets 被引量:11
5
作者 Li-feng XI~(1+) Huo-jun RUAN~2 1 Institute of Mathematics,Zhejiang Wanli University,Ningbo 315100,China 2 Department of Mathematics,Zhejiang University,Hangzhou 310027,China 《Science China Mathematics》 SCIE 2007年第11期1537-1551,共15页
This paper investigates the Lipschitz equivalence of generalized {1,3,5}-{1,4,5} self-similar sets D = (r1D) ∪ (r2D + (1 + r1 - r2 - r3)/2) ∪ (r3D + 1 - r3) and E = (r1E) ∪ (r2E + 1 - r2 -r3) ∪ (r3E + 1 - r3),and ... This paper investigates the Lipschitz equivalence of generalized {1,3,5}-{1,4,5} self-similar sets D = (r1D) ∪ (r2D + (1 + r1 - r2 - r3)/2) ∪ (r3D + 1 - r3) and E = (r1E) ∪ (r2E + 1 - r2 -r3) ∪ (r3E + 1 - r3),and proves that D and E areLipschitz equivalent if and only if there are positive integers m and n such that rm1= rn3. 展开更多
关键词 SELF-SIMILAR set OVERLAP LIPSCHITZ EQUIVALENCE graph-directed construction ERGODICITY MARTINGALE
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部