N指标d维广义Wiener过程象集的m项代数和的几个性质

设珮犠（狋）：犚犖＋ →犚犱是犖指标犱维广义Ｗｉｅｎｅｒ过程，对任意紧集犈１，…，犈犿犚犖＞ ，该文研究了犿项代数和珮犠（犈１）…珮犠（犈犿）的Ｈａｕｓｄｏｒｆｆ维数，Ｐａｃｋｉｎｇ维数和正的Ｌｅｂｅｓｇｕｅ测度及内点的存在性． 其结果包含并推广了布朗单的结果．     

硬X射线磁圆二色实验方法的建立

在北京同步辐射装置(BSRF)1W1B光束线和XAFS实验站上国内首次建立了硬X射线波段的磁圆二色实验(XMCD)方法. 以单晶金刚石作为相位延迟片, 在透射劳埃(Laue)模式下, 利用衍射双折射效应, 将入射的单色线偏振光转变为相应的左旋和右旋圆偏振光, 测量磁化样品对左旋和右旋圆偏振光吸收的差异, 获得了XMCD信号. 本实验使用透射方法测量了Pt-Fe合金Pt L_2,3边的XMCD, 获得了XMCD信号. XMCD实验方法的建立, 为研究磁性材料尤其是磁性薄膜材料的电子结构和磁结构提供了实验基础.     

Global and uniform convergence of subspace correction methods for some convex optimization problems

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.

     

Laguerre expansion on the Heisenberg group and Fourier-Bessel transform on C~n Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

Given a principal value convolution on the Heisenberg group Hn = Cn×R, we study the relation between its Laguerre expansion and the Fourier-Bessel expansion of its limit on Cn. We also calculate the Dirichlet kernel for the Laguerre expansion on the group Hn.     

Donaldson–Friedman construction and deformations of a triple of compact complex spaces,II

In a previous paper of the same title the author gave a generalization of the constrution of Donaldson–Friedman, to prove the existence of twistor spaces of n CP ² with a special kind of divisors. In the present paper, we consider its equivariant version. When n = 3, this gives another proof of the existence of degenerate double solid with C *–action, and we show that the branch quartic surface is birational to an elliptic ruled surface. In case n ≥ 4, this yields new Moishezon twistor spaces with C *–action, which is shown to be the most degenerate ones among twistor spaces studied by Campana and Kreußler.     

On a Generalized Cochrane Sum and Its Hybrid Mean Value Formula

The main purpose of this paper is to use a mean value theorem of Dirichlet L-functions to study the asymptotic property of a hybrid mean value of a generalized Cochrane sum, and give an interesting mean value formula.2000 Mathematics Subject Classification: Primary—11F20; Secondary—11F99     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

Concerning the multiplicators of Fourier series in the trigonometric system

In this paper we prove theorems on multiplicators of Fourier series inL _p, where the conditions depend on a parameterp. An example illustrating the importance of these conditions is constructed. Translated fromMatematicheskie Zametki, Vol. 63, No. 2, pp. 235–247, February, 1998.     

Normalization and Fermi–Coulomb and Coulomb hole sum rules for approximate wave functions

For approximate wave functions, we prove the theorem that there is a one‐to‐one correspondence between the constraints of normalization and of the Fermi–Coulomb and Coulomb hole charge sum rules at each electron position. This correspondence is surprising in light of the fact that normalization depends on the probability of finding an electron at some position. In contrast, the Fermi–Coulomb hole sum rule depends on the probability of two electrons staying apart because of correlations due to the Pauli exclusion principle and Coulomb repulsion, while the Coulomb hole sum rule depends on Coulomb repulsion. We demonstrate the theorem for the ground state of the He atom by the use of two different approximate wave functions that are functionals rather than functions. The first of these wave function functionals is constructed to satisfy the constraint of normalization, and the second that of the Coulomb hole sum rule for each electron position. Each is then shown to satisfy the other corresponding sum rule. The significance of the theorem for the construction of approximate “exchange‐correlation” and “correlation” energy functionals of density functional theory is also discussed. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2007     

A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations

Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX.