Determining radii of meromorphy via orthogonal polynomials on the unit circle

Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg functions.     

氟化类金刚石薄膜的拉曼和红外光谱结构研究

关键词：     

Fourier regularization for a backward heat equation

In this paper a simple and convenient new regularization method for solving backward heat equation—Fourier regularization method is given. Meanwhile, some quite sharp error estimates between the approximate solution and exact solution are provided. A numerical example also shows that the method works effectively.     

不同温度均匀二半空间接触后产生的辐射场

 应用电磁线路中涨落耗散理论，推导了不同温度均匀二半空间接触后产生辐射场密度的公式。将此公式近似展开后，即得Grover和Urtiew所获得的表示式，不过多了一松弛项，该项如用非富里叶热传导理论推导，也是存在的。该结果和实验结果一致，不过这里的松驰时间可以应用介质性质进行计算。     

Sparse-grid finite-volume multigrid for 3D-problems

We introduce a multigrid algorithm for the solution of a second order elliptic equation in three dimensions. For the approximation of the solution we use a partially ordered hierarchy of finite-volume discretisations. We show that there is a relation with semicoarsening and approximation by more-dimensional Haar wavelets. By taking a proper subset of all possible meshes in the hierarchy, a sparse grid finite-volume discretisation can be constructed.The multigrid algorithm consists of a simple damped point-Jacobi relaxation as the smoothing procedure, while the coarse grid correction is made by interpolation from several coarser grid levels.The combination of sparse grids and multigrid with semi-coarsening leads to a relatively small number of degrees of freedom,N, to obtain an accurate approximation, together with anO(N) method for the solution. The algorithm is symmetric with respect to the three coordinate directions and it is fit for combination with adaptive techniques.To analyse the convergence of the multigrid algorithm we develop the necessary Fourier analysis tools. All techniques, designed for 3D-problems, can also be applied for the 2D case, and — for simplicity — we apply the tools to study the convergence behaviour for the anisotropic Poisson equation for this 2D case.     

在相干理论的基础上分析光栅成像

本文在相干理论的基础上,推导了光栅成像中的光强分布和物像位置关系,并给出一组具有不同参数的实验照片及一组借助计算机绘制的强度分布图。     

A fast modified sine transform for solving block-tridiagonal systems with Toeplitz blocks

In this report we consider block-tridiagonal systems with Toeplitz blocks. Each block is of sizen×n consisting ofn _c×n _c matrices as entries, and there arem×m blocks in the system. The solution of those systems consists of 2n _c m modified sine transforms and an intermediate solution ofn block-tridiagonal systems. Symmetries in the data vectors are exploited such that one modified sine transform can be computed in terms of one Fourier transform of half the length of the original one, hence requiringO(2.5nlog₂ n) operations. Similarly, we only have to solve (n+1)/2 of the intermediate systems due to symmetry.This work was supported by the Swedish National Board for Industrial and Technical Development, NUTEK, under contract No. 89-02539 P.     

How should one define a (weak) crystal?

We compare two proposals for the study of positional long-range order: one in terms of the spectrum of the translation operator, the other in terms of the Fourier spectrum. We point out that only the first one allows for the consideration of molecular, as opposed to atomic, (weakly) periodic structures. We illustrate this point on the Thue-Morse system.     

On a fast direct elliptic solver by a modified Fourier method

We describe high order numerical algorithms for the solution of second order elliptic equations in rectangular domains. These algorithms are based on the Fourier method in combination with a subtraction procedure. The singularities at the corner points, arising due to non-smoothness of the boundaries, are treated explicitly using properly constructed singular corner functions. The present algorithm is a generalization of the Fast Poisson Solver developed in our previous paper. This revised version was published online in August 2006 with corrections to the Cover Date.     

Cyclic reduction and FACR methods for piecewise hermite bicubic orthogonal spline collocation

Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N ²log₂ N) andO(N ²log₂log₂ N) arithmetic operations, respectively.