Cartan Matrix for the Finite Symplectic Group <Emphasis Type="Italic">Sp</Emphasis>(6, 3)

The Cartan matrix for the finite symplectic group S_p(6, 3) over a field of three elements is computed in this paper by using a computer and the MATLAB software.2000 Mathematics Subject Classification: 20C33 20C40, 20G05Supported in part by the NNSFC (10271088) and the Foundation for the University Science and Technology Development of Shanghai.     

反对称矩阵的一种计算方法

本文讨论反对称矩阵的数值计算问题．指出联立方程求解可以用分块矩阵ＬＤＬ^Ｔ算法．对于反对称阵的辛本征问题论述了辛雅可比算法，辛Ｈｏｕｓｅｈｏｌｄｅｒ变换．分块三对角化等．对最优控制、结构力学、波的传播等，是一种好的算法．     

关于k-广义酉矩阵

本文研究了k-广义酉矩阵的性质及其与酉矩阵、辛矩阵、Householder矩阵之间的联系,取得了许多新的结果,推广了酉矩阵及Householder矩阵的相应结果,特别将正交矩阵的广义Cayley分解推广到了广义酉矩阵上;并将各类酉矩阵及辛矩阵统一了起来.     

传递辛矩阵群收敛于辛Lie群

通过作用量变分原理,给出了Hamilton正则方程离散积分的传递辛矩阵表示,利用Hamilton正则方程给出了其对应的Lie代数．说明了当时间区段长度趋近于0时,离散系统积分的传递辛矩阵群收敛于连续时间Hamilton系统微分方程分析积分得到的辛Lie群．     

关于离散代数Riccati方程的扰动分析

1．引言若不特别说明,以下记号都是常规的,可参见山．在最优控制中占有核心地位的代数Xiccati方程（ARE）有两种基本形式：连续型的ARE（CARE）：离散型的＊＊E（＊＊RE）：其中只兄见NE贮””,GIE皿””m,GZE＊m”m,in＜2,＊T二K＞风＊T二N＞几＊2二＊2＞凡从应用角度看,主要关心＊＊E的对称半正定解．对于＊＊RE,已有大量的研究工作．特别,陈春晖门、徐树方问、Ghwimi－Laub同等研究了扰动理论．对于DARE,它与＊＊＊E的一个明显区别是：＊＊M是二次矩阵方程而＊＊＊E具有高度非线性．这种区别使得DARE远为复杂…     

Zero product determined classical Lie algebras

We show that the Lie algebra ? of skew-symmetric matrices with respect to either transpose or symplectic involution is zero product determined. This means that every bilinear map {·,·} from ? × ? into a vector space X is of the form {x, y} = T ([x, y]) for some linear map T provided that the following condition is fulfilled: [x, y] = 0 implies {x, y} = 0.     

A characterization of the type of the Cauchy-Hua measure on real symmetric matrices

The Cauchy-Hua measure is the probability on the set ofn×n real symmetric matrices of densitys C _n/det(I + s ₂)_{(n + 1)/2} . For any probability measure on the set ofn×n real symmetric matrices, we define (if verifies an additional condition) the image of by a 2n×2n real symplectic matrix, and we introduce the type of . Then, the type of the Cauchy-Hua measure is characterized from its invariance by the symplectic group.     

Zero product determined Jordan algebras,I

We show that the Jordan algebra 𝒮 of symmetric matrices with respect to either transpose or symplectic involution is zero product determined. This means that if a bilinear map {.,?.} from 𝒮?×?𝒮 into a vector space X satisfies {x, y}?=?0 whenever x?○?y?=?0, then there exists a linear map T : 𝒮?→?X such that {x,?y}?=?T(x?○?y) for all x, y?∈?𝒮 (here, x?○?y?=?xy?+?yx).     

Error Analysis of the Symplectic Lanczos Method for the Symplectic Eigenvalue Problem

A rounding error analysis of the symplectic Lanczos algorithm for the symplectic eigenvalue problem is given. It is applicable when no break down occurs and shows that the restriction of preserving the symplectic structure does not destroy the characteristic feature of nonsymmetric Lanczos processes. An analog of Paige's theory on the relationship between the loss of orthogonality among the Lanczos vectors and the convergence of Ritz values in the symmetric Lanczos algorithm is discussed. As to be expected, it follows that (under certain assumptions) the computed J-orthogonal Lanczos vectors loose J-orthogonality when some Ritz values begin to converge.     

奇异辛几何的子空间生成的格(英文)

利用奇异辛几何中的(m,0,1)型子空间构作一类格,并讨论它的几何性.     

带约束动力学辛算法的符号计算

首先对带约束动力学中的辛算法作了改进,利用吴消元法求解多项式类型Euler-Lagrange方程.在辛算法的基础上,根据线性方程组理论和相容条件提出了一个求解约束的新算法.新算法的推导过程比辛算法严格,而且计算也比辛算法简单,并且多项式类型的Euler-Lagrange仍可以用吴消元法求解.另外,对于某些非多项式类型的Euler-Lagrange方程,可以先化为多项式类型,再用吴消元法求解.利用符号计算软件,上述算法都可以在计算机上实现.     

椭圆曲面上的辛循环作用

Let X = E（n） be the relatively minimal elliptic surface with rational base, where n 〉 2. In this paper, several pseudofree, homologically trivial, symplectic cyclic actions by groups whose orders are 2, 3, 5 and 7 on X are studied.     

逆矩阵的判定及计算方法

线性代数是大学教育中一门难度较高的基础必修课程,而逆矩阵是教学过程中一个主要概念,对研究其他线性结构有着非常重要的作用.本文通过对逆矩阵定义的分析,汇总若干个判定矩阵是否可逆的方法,同时提供了多种逆矩阵的计算技巧,包括利用计算机技术简化繁琐的计算过程,这些都是学习者在学习过程中需要掌握的重要内容.本文旨在协助教师在开展教学时,能够举一反三,以点带面来引导学生将所学知识融合,注重知识点之间的相关性学习;同时,也帮助学习者能够更加全面的认识逆矩阵这一重要概念.     

线性时变系统二次最优控制问题的保辛近似求解

状态空间的最优控制体系是保守的,其近似算法应当保辛．提出了基于分段常值精细积分方法的保辛摄动近似方法,在同一框架下求解了线性时变LQ最优控制中的计算问题,即变系数矩阵Riccati方程和状态反馈方程．该算法是保辛的,具有很好的数值稳定性和精度．算例验证了算法的有效性．     

辛矩阵和四阶微分算子自共轭边界条件的基本型

给出了辛矩阵的定义,讨论了它的性质,并通过使用辛矩阵的方法研究四阶自共轭的边界条件,得到了四阶自共轭边界条件的基本型,从而使得其它各种自共轭的边界条件都可以通过基本型的辛变换得到.     

基于Hamilton体系和辛算法的微分对策数值法

微分对策求解往往涉及到困难的两点边值问题（TPBV）,将线性二次型微分对策问题归结于Hamilton体系．对Hamilton系统,辛几何算法具有能复制Hamilton系统的动态结构并保持相平面上的测度的优点．从Hamilton系统角度,探讨了线性二次型微分对策系统的辛性质;作为尝试,对无限期间线性二次型微分对策的计算引入Symplectic-Runge-Kutta算法．给出了一个数值计算实例,从结果可以说明这种方法的可行,也体现了辛算法对系统的能量具有良好的守恒性．     

一种关于图的关联矩阵秩的定理证明的新方法

关于图的关联矩阵的一个重要的定理是r个结点的连通图G的关联矩阵的秩是r-1.利用一般域上的线性空间理论,给出了无向图的关联矩阵秩的定理证明,该方法结构严谨且利于学生理解和接受.     

Self-dual Co des with Symplectic Inner Pro duct

In this paper, we discuss a kind of Hermitian inner product — symplectic inner product, which is different from the original inner product — Euclidean inner product. According to the definition of symplectic inner product, the codes under the symplectic inner product have better properties than those under the general Hermitian inner product. Here we present the necessary and sufficient condition for judging whether a linear code C over Fp with a generator matrix in the standard form is a symplectic self-dual code. In addition, we give a method for constructing a new symplectic self-dual codes over Fp, which is simpler than others.