上三角无穷维Hamilton算子特征值的代数指标

无穷维Hamilton算子特征函数系是否完备与其代数指标有关,研究了上三角无穷维Hamilton算子特征值的代数指标问题,基于主对角元的特征值和特征向量的某些性质,得到上三角无穷维Hamilton算子的几何重数和代数重数.     

方阵秩与零特征值代数重数相关性探讨

利用方阵的特征方程和Jordan标准型,可得出方阵的秩R、零特征值代数重数r、几何重数s之间存在的两个关系式．即n-r≤R〈n和R=n-s．而这两个关系式又可用于简化方阵特征值和秩的求解．揭示矩阵零特征值代数重数与矩阵秩之间的内在必然联系．     

一类四阶Hamilton算子特征值的代数指标

研究了一类四阶Hamilton算子H_A特征值的代数指标问题.根据算子A与Hamilton算子H_A的关系,讨论了Hamilton算子H_A特征值的几何重数,代数指标及代数重数.最后结合例子说明其结果的有效性.     

高阶常微分算子特征值的重数关系

本文借助于边条件空间的几何结构,证明了自伴的高阶常微分算子特征值的解析重数等于几何重数,这是对常型Sturm-Liouville问题相关结果的一个推广.     

秩1矩阵及其修正矩阵的特征值

本文通过示例探讨了秩1矩阵及其修正矩阵特征值的求法.     

一类Hamilton算子的重数和完备性及其应用

对于一类Hamilton算子,考虑其特征值的重数,以及特征向量组和根向量组的完备性.首先给出了特征值的几何重数、代数指标和代数重数,再结合特征向量和根向量的辛正交性得到了特征向量组和根向量组完备的充分必要条件,最后将上述结果应用于板弯曲方程、平面弹性问题和Stokes流等问题中.     

一类具有转移条件的向量Sturm-Liouville问题的特征值

考虑了一类具有转移条件的向量Sturm-Liouville问题的特征值及其重数问题.首先构造了与问题相关的新内积和基本解,得到特征值的充要条件.在此基础上证明了二维情况下,问题特征值的代数重数与几何重数相等.     

二部竞赛矩阵的实特征值

令ζm,n表示所有的不可约m×n二部竞赛矩阵,M∈ζm,n和实数k≠0,本文主要获得了下述结论:首先研究k是M的特征值时k的几何重数,然后研究k是M的特征值的一些充要条件,最后讨论k是M的特征值时M的性质.     

一类矩阵特征值的扰动

本文讨论可正规化矩阵和可对称化矩阵特征值的扰动。所谓可正规化矩阵和可对称化矩阵分别指相似于正规矩阵和Hermite矩阵的矩阵。     

一类可靠性模型的另一个特征值

研究带无穷多个部件的,由一个可靠机器,一个不可靠机器与一个缓冲库构成的系统主算子在左半复平面中的特征值,证明2√λη1μη2-λη1-μη2是该主算子的几何重数为1的一个特征值．     

两部件并联维修系统算子的性质

研究了两部件并联维修系统算子的性质,通过选取空间和定义算子将模型方程转化成了抽象柯西问题,证明了系统算子是定义域稠的预解正算子,0是系统算子的几何重数为1的本征值.讨论了系统算子的共轭算子及其定义域,证明了0是共轭算子的代数重数为1的特征值.     

带特殊重试时间的M/M/1重试排队模型的一个特征值

证明0是对应于带特殊重试时间的M/M/1重试排队模型主算子的几何重数为1的特征值,0是此主算子的共轭算子的特征值.     

M／M／1算子的另一个特征值

证明2√λμ-λ-μ是偏微分方程形式的M／M／1排队模型主算子的几何重数为1的特征值．     

Eigenvalue Multiplicity Estimate in Semidefinite Programming

A semidefinite programming problem is a mathematical program in which the objective function is linear in the unknowns and the constraint set is defined by a linear matrix inequality. This problem is nonlinear, nondifferentiable, but convex. It covers several standard problems (such as linear and quadratic programming) and has many applications in engineering. Typically, the optimal eigenvalue multiplicity associated with a linear matrix inequality is larger than one. Algorithms based on prior knowledge of the optimal eigenvalue multiplicity for solving the underlying problem have been shown to be efficient. In this paper, we propose a scheme to estimate the optimal eigenvalue multiplicity from points close to the solution. With some mild assumptions, it is shown that there exists an open neighborhood around the minimizer so that our scheme applied to any point in the neighborhood will always give the correct optimal eigenvalue multiplicity. We then show how to incorporate this result into a generalization of an existing local method for solving the semidefinite programming problem. Finally, a numerical example is included to illustrate the results.     

Eigenvalue problem of a class of fourth-order Hamiltonian operators

The eigenvalue problem of a class of fourth-order Hamiltonian operators is studied. We first obtain the geometric multiplicity, the algebraic index and the algebraic multiplicity of each eigenvalue of the Hamiltonian operators. Then, some necessary and sufficient conditions for the completeness of the eigen or root vector system of the Hamiltonian operators are given, which is characterized by that of the vector system consisting of the first components of all eigenvectors. Moreover, the results are applied to the plate bending problem.     

On a Class of Analytic Operator Functions and Their Linearizations

We consider an operator function T in a Krein space which can formally be written as (0.1)but the last term on the right of (0.1) is replaced by a relatively form‐compact perturbation of a similar form. We study relations between the operator function T, a selfadjoint operator M in some Krein space, associated with T, and an operator which can be constructed with the help of the operator function –T^–1. The results are applied to a Sturm‐Liouville problem with a coefficient depending rationally on the eigenvalue parameter.