Mathematics – Classical Analysis and ODEs
Scientific paper
1998-06-08
Indiana Univ. Math. J. 48 No. 2 (1999), 429-448
Mathematics
Classical Analysis and ODEs
15 pages, 5 figures, TeX (amstex amsppt boxedeps)
Scientific paper
Suppose a graph-directed iterated function system consists of maps f_e with upper estimates of the form d(f_e(x),f_e(y)) <= r_e d(x,y). Then the fractal dimension of the attractor K_v of the IFS is bounded above by the dimension associated to the Mauldin--Williams graph with ratios r_e. Suppose the maps f_e also have lower estimates of the form d(f_e(x),f_e(y)) >= r'_e d(x,y) and that the IFS also satisfies the strong open set condition. Then the fractal dimension of the attractor K_v of the IFS is bounded below by the dimension associated to the Mauldin--Williams graph with ratios r'_e. When r_e = r'_e, then the maps are similarities and this reduces to the dimension computation of Mauldin & Williams for that case.
Edgar G. A.
Golds Jeffrey
No associations
LandOfFree
A fractal dimension estimate for a graph-directed IFS of non-similarities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A fractal dimension estimate for a graph-directed IFS of non-similarities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fractal dimension estimate for a graph-directed IFS of non-similarities will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-412748