将A-L理论推广到无限维李代数

为使由Alhassid与Levine所提出的动力学李代数方法（简称A－L理论）能适用于更多的散射体系，在h(∞)中引入了有效集合C（有限维）的概念．按照微扰理论的意义，C中的代数元所对应的群参量是较低次微扰的结果，而不属于C的代数元所对应的群参量则相当于较高次做扰所产生的修正结果．因此可以近似地利用C来代替h(∞)．这样，不仅简化了计算程序并且对于很多具有现实意义的散射过程的计算成为可能．     

共线散射体系A+BC的平-振能量传递──无限维李代数处理方法

利用无限维李代数方法处理了在BC分子能谱中含有二级与三级非简谐项的散射体系A＋BC的平-振能量传递问题，获得了散射过程的含有主要动力学参量的跃迁矩阵元和跃迁几率的解析表达式     

On solving sparse band systems with three algorithms of the ABS family

In this paper, we examine three algorithms in the ABS family and consider their storage requirements on sparse band systems. It is shown that, when using the implicit Cholesky algorithm on a band matrix with band width 2q+1, onlyq additional vectors are required. Indeed, for any matrix with upper band widthq, onlyq additional vectors are needed. More generally, ifa _kj 0,j>k, then thejth row ofH _i is effectively nonzero ifj>i>k. The arithmetic operations involved in solving a band matrix by this method are dominated by (1/2)n ² q. Special results are obtained forq-band tridiagonal matrices and cyclic band matrices.The implicit Cholesky algorithm may require pivoting if the matrixA does not possess positive-definite principal minors, so two further algorithms were considered that do not require this property. When using the implicit QR algorithm, a matrix with band widthq needs at most 2q additional vectors. Similar results forq-band tridiagonal matrices and cyclic band matrices are obtained.For the symmetric Huang algorithm, a matrix with band widthq requiresq–1 additional vectors. The storage required forq-band tridiagonal matrices and cyclic band matrices are again analyzed.This work was undertaken during the visit of Dr. J. Abaffy to Hatfield Polytechnic, sponsored by SERC Grant No. GR/E-07760.     

Reachable and controllable sets for two-dimensional,linear, discrete-time systems

We consider two-dimensional discrete-time linear systems with constrained controls. We propose a simple polynomial time procedure to give an exact external representation of theN-step reachable set and controllable set. The bounding hyperplanes are explicitly derived in terms of the data of the problem. By using a result in computational geometry, all the calculations are made in polynomial time in contrast to classical methods. The limit case asN is also investigated.     

Improving the rate of convergence of interior point methods for linear programming

This paper proposes a procedure for improving the rate of convergence of interior point methods for linear programming. If (x ^k ) is the sequence generated by an interior point method, the procedure derives an auxiliary sequence ( ). Under the suitable assumptions it is shown that the sequence ( ) converges superlinearly faster to the solution than (x ^k ). Application of the procedure to the projective and afflne scaling algorithms is discussed and some computational illustration is provided.     

Coulomb scattering of an electron by a monopole

The Coulomb scattering of an electron by a magnetic monopole is analyzed using a lowest-order quantum perturbation approximation suggested by a two-potential Lagrangian form for classical electromagnetism, generalized through the use of spacetime algebra to include magnetic monopoles. Good agreement with existing conventional analyses of this problem is demonstrated.1. Work supported by Department of Energy contract DE-AC03-76SF00515.2. The idea to employ spacetime algebra (sometimes called Dirac algebra) to incorporate magnetic monopoles into classical electromagnetic theory was proposed by de Faria-Rosaet al. [3].3. This is a factori difference between the definition of 5 by Eq. (3) and that by Bjorken and Drell [6]. Since a cross section (without interference terms) is being calculated, we can ignore this distinction.     

Classification of extensions of torus algebra II

We use extension theory and algebraic methods to give a complete characterization of extensions of torus algebra by stable Cuntz algebras,and prove certain classification theorems of these extension algebras.     

The a posteriori error estimates of Chebyshev–Petrov–Galerkin methods for second-order equations

In this paper, the a posteriori error estimates of Chebyshev–Petrov–Galerkin approximations are investigated. For simplicity, we choose the Poisson equation with Dirichlet boundary conditions to discuss the a posteriori error estimators, and deduce their efficient and reliable properties. Some numerical experiments are performed to verify the theoretical analysis for the a posteriori error estimators.