Self-Affine Sets and Graph-Directed Systems

   Abstract. A self-affine set in R ⁿ is a compact set T with A(T)= ∪ _{d∈ D} (T+d) where A is an expanding n× n matrix with integer entries and D ={d ₁ , d ₂ ,···, d _N } ⊂ Z ⁿ is an N -digit set. For the case N = | det(A)| the set T has been studied in great detail in the context of self-affine tiles. Our main interest in this paper is to consider the case N > | det(A)| , but the theorems and proofs apply to all the N . The self-affine sets arise naturally in fractal geometry and, moreover, they are the support of the scaling functions in wavelet theory. The main difficulty in studying such sets is that the pieces T+d, d∈ D, overlap and it is harder to trace the iteration. For this we construct a new graph-directed system to determine whether such a set T will have a nonvoid interior, and to use the system to calculate the dimension of T or its boundary (if T ^o ≠  ). By using this setup we also show that the Lebesgue measure of such T is a rational number, in contrast to the case where, for a self-affine tile, it is an integer.     

ILL-POSEDNESS FOR THE NONLINEAR DAVEY-STEWARTSON EQUATION

The nonlinear D-S equations on R^d, with general power nonlinearity and with both the focusing and defocusing signs, are proved to be ill-posed in the Sobolev space H^s whenever the exponent s is lower than that predicted by scaling or Galilean invariance, or when the regularity is too low to support distributional solutions. Authors analyze a class of solutions for which the zero-dispersion limit provides good approximations.     

抛物方程时间周期问题的有限元多格子动力学迭代

本文我们研究线性周期抛物方程的有限元多格子动力学迭代.多格子动力学迭代又称多重网格波形松弛,它是在函数空间中的一种迭代过程.对于由加速技术得到的多格子动力学迭代算子,我们通过计算周期函数的Fourier系数给出了新的谱表达式.从这些有用的表达式出发,我们推导了时间连续和离散格式的迭代收敛条件.数值实验进一步验证了本文的理论结果.     

计算最小奇异组的一个精化调和 Lanczos双对角化方法

在很多实际应用中需要计算大规模矩阵的若干个最小奇异组.调和投影方法是计算内部特征对的常用方法,其原理可用于求解大规模奇异值分解问题.本文证明了,当投影空间足够好时,该方法得到的近似奇异值收敛,但近似奇异向量可能收敛很慢甚至不收敛.根据第二作者近年来提出的精化投影方法的原理,本文提出一种精化的调和Lanczos双对角化方法,证明了它的收敛性.然后将该方法与Sorensen提出的隐式重新启动技术相结合,开发出隐式重新启动的调和Lanczos双对角化算法(IRHLB)和隐式重新启动的精化调和Lanczos双对角化算法(IRRHLB).位移的合理选取是算法成功的关键之一,本文对精化算法提出了一种新的位移策略,称之为"精化调和位移".理论分析表明,精化调和位移比IRHLB中所用的调和位移要好,且可以廉价可靠地计算出来.数值实验表明,IRRHLB比IRHLB要显著优越,而且比目前常用的隐式重新启动的Lanczos双对角化方法(IRLB)和精化算法IRRLB更有效.     

ERROR ESTIMATES FOR THE TIME DISCRETIZATION FOR NONLINEAR MAXWELL＇S EQUATIONS

This paper is devoted to the study of a nonlinear evolution eddy current model of the type δtB（H） ＋ △↓× （ △↓ × H） =0 subject to homogeneous Dirichlet boundary conditions H × v = 0 and a given initial datum. Here, the magnetic properties of a soft ferromagnet are linked by a nonlinear material law described by B（H）. We apply the backward Euler method for the time discretization and we derive the error estimates in suitable function spaces. The results depend on the nonlinearity of B（H）.     

Calculation of geometrical coupling coefficients for the hyperspherical harmonics approach

An elegant and fast method for the calculation of geometrical structure coefficients needed for an expansion of a few-body wavefunction and interaction in hyperspherical harmonics has been proposed. A sum rule for the GSC has also been derived, which is useful for an independent check of the coefficients. The proposed method of computation is many orders of magnitude faster than conventional methods.     

Boundary integral equations in time-dependent bending of thermoelastic plates

The initial-boundary value problems with the Dirichlet and Neumann boundary conditions arising in the theory of bending of thermoelastic plates with transverse shear deformation are reduced to time-dependent boundary integral equations by means of layer potentials. The solvability of these equations is then investigated in Sobolev-type spaces.     

Approximation of finite-section equations by piecewise constant functions

The problem is studied of reducing the amount of discrete information required for achieving a prescribed accuracy of solving Fredholm integral equations of the first kind on a half-line. The equations are solved by the finite-section method combined with piecewise constant interpolation of the kernel and the right-hand side at uniform grid points. The approximating properties of the discretization schemes are examined, and the corresponding computational costs are analyzed.     

Function-valued Padé-type approximant via the formal orthogonal polynomials and its applications in solving integral equations

A kind of function-valued Padé-type approximant via the formal orthogonal polynomials (FPTAVOP) is introduced on the polynomial space and an algorithm is sketched by means of the formal orthogonal polynomials. This method can be applied to approximate characteristic values and the corresponding characteristic function of Fredholm integral equation of the second kind. Moreover, theoretical analyses show that FPTAVOP method is the most effective one for accelerating the convergence of a sequence of functions. In addition, a typical numerical example is presented to illustrate when the estimates of characteristic value and characteristic function by using this new method are more accurate than other methods.