The Braided product of Ockham algebras

In this paper we introduce an algebraic concept of the product of Ockham algebras called the Braided product. We show that ifL _i MS(i=1, 2, ,n) then the Braided product ofL _i(i=1, 2, ,n) exists if and only ifL ₁, ,L _n have isomorphic skeletons.     

Derivative of the exponential mapping for infinite dimensional lie groups

It is proved that for infinite dimensional Lie groups in the sense of the differential calculus of Frölicher and Kriegl the derivative of the exponential mappings is given by the formula d(exp)(X)Y=d_exp(X)(e) ₀ ¹ Ad_exp(–tX) Y dt, where stands for the left translation ande is the neutral element.This work was supported by the Alexander von Humboldt-Stiftung.     

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

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

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.     

多模海森堡代数的算符恒等式

利用算符代数中的分析方法,得到了多模海森堡(Heisenberg)代数中的BCH公式和压缩算符的展开式。     

关于BCI逻辑的一种偏序代数

通常,人们认为Kiyoshi Iséki在20世纪60年代引入的BCI-代数是组合逻辑中BCI逻辑的代数对等物。然而这种广为人知的断言却是有问题的,因为BCI逻辑关于BCI代数是不完备的。在本文中,我们引入一种称为MPE的偏序代数。在MPE中的每个不等式对应BCI逻辑中的一个重言式且反之亦然,从而MPE代数是与BCI逻辑完备的代数类。