Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

计算全息检测非球面干涉场的理论分析与实验结果

本文应用光学全息术及傅里叶光学的理论对计算全息图干涉检测非球面面形的光路及干涉场进行了理论分析,提出了其干涉场为不定域干涉的观点,并在实验中予以证实.     

Schwinger boson mapping of SO(8) fermion model

The Schwinger representation of the SO(8) fermion pair algebra in terms ofd and quasispin vector (u, s, v) bosons is used in deriving a microscopic boson coherent state having both particle-hole and pair excitations. The coherent state is the exact boson image of the HFB variational solution. We can study the shape phase transition and pairing behaviour of the nuclear ground states using the coherent states.     

An algebraic characterization ofB-convergent Runge-Kutta methods

Summary In the analysis of discretization methods for stiff intial value problems, stability questions have received most part of the attention in the past.B-stability and the equivalent criterion algebraic stability are well known concepts for Runge-Kutta methods applied to dissipative problems. However, for the derivation ofB-convergence results — error bounds which are not affected by stiffness — it is not sufficient in many cases to requireB-stability alone. In this paper, necessary and sufficient conditions forB-convergence are determined.This paper was written while J. Schneid was visiting the Centre for Mathematics and Computer Science with an Erwin-Schrödinger stipend from the Fonds zur Förderung der wissenschaftlichen Forschung     

Point approximation of a space-homogeneous transport equation

Summary We present an approximation method of a space-homogeneous transport equation which we prove is convergent. The method is very promising for numerical computation. Comparison of a numerical computation with an exact solution is given for the Master equation.     

四角晶相HfO2(001)表面原子和电子结构研究

采用基于第一性原理的密度泛函理论研究了四角晶相二氧化铪(t-HfO₂)体相及 其(001)表面的原子几何与电子结构.理论计算结果表明，t-HfO₂(001)表面不会 产生重构现象.与体相电子结构相比, t-HfO₂(001)表面态密度明显高于体相态 密度.其次，表面原子的态密度更靠近费米能级(E_F)，价带往低能量处移动，并 有表面态产生.计算结果表明了t-HfO₂表面禁带宽度明显低于体相的禁带宽度. t-HfO₂(001)的表面态产生以及表面禁带宽度减小是由于Hf原子与O原子的配位 数减少，表面原子周围的环境发生变化而引起的. 关键词： 密度泛函理论 2(001)')" href="#">t-HfO₂(001) 表面电子结构     

Ni(111)表面一氧化碳和氢共吸附的密度泛函理论研究

本文用密度泛函理论(DFT)的总能计算研究了一氧化碳和氢原子在Ni(111)表面上p(2×2)共吸附系统的原子结构和电子态，结果表明CO和H原子分别被吸附于两个对角p(1×1)元胞的hcp和fcc位置.以氢分子和CO分子作为能量参考点，总吸附能为2.81 eV，相应的共吸附表面功函数φ为6.28 eV.计算得到的C—O，C—Ni和H—Ni的键长分别是1.19?, 1.96?和 1.71?，并且CO分子以C原子处于hcp的谷位与金属衬底原子结合.衬底Ni(111)的最外两层的晶面间距在吸附后的相对变化分别是 关键词： Fisher-Tropsch反应 催化作用 Ni(111) p(2×2)/(CO+H) 共吸附