伸缩方程L_c^p解的讨论

L_c^p-solution of the Matrix Refinement Equation

研究一般扩张矩阵伸缩方程Lcp解的性质,相同分形中的选代函数系统构造tile和tiling性质,克服了通用方法中的不足,得到了这类方程存在紧支撑解的充要条件,从而推广了有关的结果.

In this paper, we discuss some characterization for the general extended matrix refinement equations and obtain the sufficient and necessary conditions of which L^pc - solution exists. The basic technique here is to construct Tiling on Tile which gets over the difficulties in usual methods such as Fourier method and iteration method according to iterated function system of fractal and it has developed the general theorem for the study of the matrix erfinement equations.