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

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

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.     

用频域法实现圆环形目标物的计数

研究了用频域法实现圆环形目标物计数的方法。对空域中含有圆环形目标物的二值图像，经傅里叶变换后在频域内进行滤波，再经傅里叶反变换后取一阈值进行处理，则对应于圆环形目标物即变为一个实心体，然后对实心体进行计数即可实现对圆环形目标物的计数。对该方法进行了数学描述，并分别用模拟图像和实际图像进行了实验。结果表明，该方法消除噪声的效果好，对部分封闭圆的检测同样有效，且可用于目标物有粘连的情况。该方法对圆环形目标物的尺寸相差不大的情况更为有效。     

Sparse generalized Fourier transforms

Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast. Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant matrix. By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method. A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are preserved. AMS subject classification (2000)  43A30, 65T99, 20B25     

Optimal reconstruction of the solution of the wave equation from inaccurate initial data

In the present paper, we consider the problem of the optimal reconstruction of the solution of the wave equation from the approximate values of the Fourier coefficients of the function specifying the initial form of the string. For an operator defined on the weight space of vectors from l ₂, we present the solution of the more general problem of reconstruction from the approximate values of the coordinates of these vectors.     

On multiple integrals of special form

Multiple integrals generalizing the iterated kernels of integral operators are expressed as single integrals in the case of a special representation of the kernel (this is our theorem). Besides integral equations, Markov processes involve these integrals as well. As a consequence of the theorem, we obtain transition probability densities of certain Markov processes. As an illustration, we consider nine examples.     

用小型全息设备做傅里叶变换全息图存储资料实验

阐述了用小型全息设备做傅里叶变换全息图存储资料实验所采用的光路、详细的操作步骤和实验中的关键问题.