极大代数意义下矩阵的特征值问题——一类离散事件动态系统运行周期的分析

在分析一类离散事件动态系统的运行周期及稳定性时,必须求解极大代数意义下矩阵的特征值及特征向量,这一直被认为是十分困难和繁复的工作.本文给出了求任一方阵特征值及特征向量的十分简单易行的方法以及有关的定理.     

极大代数意义下矩阵的特征值问题——一类离散事件动态系统运行周期的分析

在分析一类离散事件动态系统的运行周期及稳定性时,必须求解极大代数意义下矩阵的 特征值及特征向量,这一直被认为是十分困难和繁复的工作.本文给出了求任一方阵特征值 及特征向量的十分简单易行的方法以及有关的定理.     

分布时滞系统的反馈镇定

求解特征矩阵是镇定时滞系统的关键问题,本文给出了系统的特征根的代数重复度与几 何重复度均为一般值情况下特征矩阵的求法,即把它归结为求解一组线性代数方程的问题,并 得到了该方程组有解及对应于同一特征值的解向量组线性独立的充分条件.此外,还提出了 一种算法,用以处理系统对应于不同特征值的左特征向量线性相关情况下系统的镇定问题.     

一种计算矩阵特征值特征向量的神经网络方法

当把Oja学习规则描述的连续型全反馈神经网络(Oja-N)用于求解矩阵特征值特征向量时,网络初始向量需位于单位超球面上,这给应用带来不便.由此,提出一种求解矩阵特征值特征向量的神经网络(1yNN)方法.在lyNN解析解基础上得到了以下结果:初始向量属于任意特征值对应特征向量张成的子空间,则网络平衡向量也将属于该空间;分析了lyNN收敛于矩阵最大特征值对应特征向量的初始向量取值条件;明确了lyNN收敛于矩阵不同特征值的特征子空间时,网络初始向量的最大取值空间;网络初始向量与已知特征向量垂直,则lyNN平衡解向量将垂直于该特征向量;证明了平衡解向量位于由非零初始向量确定的超球面上的结论.基于以上分析,设计了用lyNN求矩阵特征值特征向量的具体算法,实例演算验证了该算法的有效性.1yNN不出现有限溢,而基于Oja-N的方法在矩阵负定、初始向量位于单位超球面外时必出现有限溢,算法失效.与基于优化的方法相比,lyNN实现容易,计算量较小.     

线性系统的分散输出反馈特性结构配置

本文考虑了利用分散输出反馈配置多通道线性系统特征结构的问题;建立了闭环特征向量矩阵容许集及分散反馈增益集合关于闭环特征值和四组参向量的两种参量表示。     

基于多子空间直和特征融合的人脸识别算法

多个子空间直和能保证多个子空间数据融合时多个子空间得到的特征向量相互两两正交,融合数据采用该特征表示时冗余最小,更有利于分类识别。本文基于多子空间直和进行特征融合,提出了一种新的人脸识别算法。通过 2DPCA算法,首先分别计算所有训练样本归一化后正脸、左侧脸及右侧脸图像的协方差矩阵的各P个最大特征值对应的P个相互正交的特征向量,然后通过选取3个子空间的部分满足直 和条件的特征向量组成各自的特征空间(投影空间),再将样本正脸、左侧脸及右侧脸图像分别向各自特征空间投影得到3个特征矩阵,最后将此3个特征矩阵融合为该样本的特征矩阵用于最近邻分类器进行分类识别。最终通过本文3组实验数据的对比说明了该 算法能减少计算量并且提高了识别率。     

Jacobi矩阵逆特征问题存在唯一解的条件

（?）1.引 言设n阶Jacobi矩阵为记Jp,q为Jn的主子矩阵;即 关于Jacobi矩阵逆特征值问题的研究文献很多,类型有由两组谱数据或两个特征对（指特征值及相应的特征向量）构造Jacobi矩阵的元素[1].由主子阵及一组谱数据构造Jacobi     

一种求解复Hermite矩阵特征值的方法

介绍几种求解矩阵特征值和特征向量的经典算法及各自优缺点,通过理论推导,提出了一种性能稳健的方法,可以求解信号处理中常见的复Hermite阵.将对复Hermite矩阵求特征值和特征向量的问题转化为求解实对称阵的特征值和特征向量,而实对称阵的求解采用一种改进的三对角Householder法.最后把结果与Matlab仿真结果比较,可以看出该方法有很高的精确度.     

“线性”离散事件动态系统的频域方法

本文应用极大代数研究离散事件动态系统的频域解算法,导出了传递矩阵A(z)的级数A~·(z),给出A~*(z)的存在和收敛条件,给出一种在频域计算特征值的新方法。     

一种基于局部排序PCA的线性鉴别算法

主分量分析(Principal Component Analysis,PCA)是模式识别领域中一种重要的特征抽取方法,该方法通过K-L展开式来抽取样本的主要特征。基于此,提出一种拓展的PCA人脸识别方法,即分块排序PCA人脸识别方法(MSPCA)。分块排序PCA方法先对图像矩阵进行分块,对所有分块得到的子图像矩阵利用PCA方法求出矩阵的所有特征值所对应的特征向量并加以标识;然后找出这些所有的特征值中k个最大的特征值所对应的特征向量,用这些特征向量分别去抽取所属的子图像的特征;最后,在MSPCA的基础上,将抽取子图像所得到的特征矩阵合并,把这个合并后的特征矩阵作为新的样本进行PCA+LDA。与PCA和PCA+LDA方法相比,分块排序PCA由于使用子图像矩阵,可以避免使用奇异值分解理论,从而更加简便。在ORL人脸库上的实验结果表明,所提出的方法在识别性能上明显优于经典的PCA和PCA+LDA方法。     

Eigenfactor solution of the matrix Riccati equation--A continuous square root algorithm

This paper introduces a new algorithm for solving the matrix Riccati equation. Differential equations for the eigenvalues and eigenvectors of the solution matrix are developed in which their derivatives are expressed in terms of the eigenvalues and eigenvectors themselves and not as functions of the solution matrix. The solution of these equations yields, then, the time behavior of the eigenvalues and eigenvectors of the solution matrix. A reconstruction of the matrix itself at any desired time is immediately obtained through a trivial similarity transformation. This algorithm serves two purposes. First, being a square root solution, it entails all the advantages of square root algorithms such as nonnegative definiteness and accuracy. Secondly, it furnishes the eigenvalues and eigenvectors of the solution matrix continuously without resorting to the complicated route of solving the equation directly and then decomposing the solution matrix into its eigenvalues and eigenvectors. The algorithm which handles cases of distinct as well as multiple eigenvalues is tested on several examples. Through these examples it is seen that the algorithm is indeed more accurate than the ordinary one. Moreover, it is seen that the algorithm works in cases where the ordinary algorithm fails and even in cases where the closed-form solution cannot be computed as a result of numerical difficulties.     

Applications of Newton's method to some numerical problems in matrix theory

Newton's classical method is applied to the map (Λ, X)→XΛX^T-A (with Λ diagonal and X orthogonal) for the simultaneous computation of the eigenvalues and the eigenvectors of a symmetric matrix A. It is proved that the method is applicable also to matrices with multiple eigenvalues with the same rate of convergence as for the case of simple eigenvalues. The problem of determining the Schur triangular form of a generic matrix by the same approach is also discussed.     

用神经网络计算矩阵特征值与特征向量

该文研究用神经网格求解一般实对称矩阵的全部特征向量的问题。详细讨论了网络的平均态度合的结构并建立了平衡态集合的构造定理。通过求解简单的一维微分方程求出了网络的解析表达式。这一表达式是由对称矩阵的特征值与特征向量表达的、因而非常清晰利用解的解析表达式分析了网络的解的全局渐近行为。提出了用一些单位向量作为网络初始值计算对称矩阵的全部特征值与特征向量的具体算法。     

自洽场方法中广义本征值方程求解及其C++程序设计

本文研究自洽场方法中广义本征值方程求解的算法,并设计相应的C 程序来实现该算法。首先对重叠矩阵进行分解,并将广义本征值方程化为标准的本征值方程,再利用Householder变换将上一步变换所得的矩阵化为对称三对角矩阵,进而用QL方法求解这个三对角矩阵的本征值和本征矢量,从而得到自洽场方法中广义本征值方程的本征值和本征矢量。     

First- and second-order eigensensitivities of matrices with distinct eigenvalues

Formulae for computation of the first- and second-order sensitivity matrices of the eigenvalues and eigenvectors of a matrix with distinct eigenvalues are derived using matrix calculus and the algebra of Kronecker products. The sensitivities of eigenvalues and eigenvectors to all elements of the matrix can thus be expressed by concise matrix equations.     

Higher order eigensensitivity analysis of damped systems with repeated eigenvalues

A simplified method for the computation of first-, second- and higher-order derivatives of eigenvalues and eigenvectors associated with repeated eigenvalues is presented. Adjacent eigenvectors and orthonormal conditions are used to compose an algebraic equation. The algebraic equation which is developed can be used to compute derivatives of eigenvalues and eigenvectors simultaneously. Since the coefficient matrix in the proposed algebraic equation is non-singular, symmetric and based on N-space, it is numerically stable and very efficient compared to previous methods. To verify the efficiency of the proposed method, the finite element model of the cantilever beam and a mechanical system in the case of a non-proportionally damped system are considered.     

A guided genetic algorithm for diagonalization of symmetric and Hermitian matrices

The eigenvalues and eigenvectors of a matrix have many applications in engineering and science, such us studying and solving structural problems in both the treatment of signal or image processing, and the study of quantum mechanics. One of the most important aspects of an algorithm is the speed of execution, especially when it is used in large arrays. For this reason, in this paper the authors propose a new methodology using a genetic algorithm to compute all the eigenvectors and eigenvalues in real symmetric and Hermitian matrices. The algorithm uses a general-purpose library developed by the authors for genetic algorithms (GALGA). The speed of execution and the influence of population size have been studied. Moreover, the algorithm has been tested in different matrices and population sizes by comparing the speed of execution to the number of the eigenvectors. This new methodology is faster than the previous algorithm developed by the authors and all eigenvectors can be obtained with it. In addition, the performance using the Coope matrix has been tested contrasting the results with another technique published in the scientific literature.