一类特殊矩阵的广义特征值反问题

在给定部分特征值及部分特征向量的情况下讨论了一类特殊矩阵的议特征值反问题，给出了问题可解的条件及相应的算法和算例。     

Jordan标准形过渡矩阵的一种算法

给出Jordan定理的一个证明,以及Jordan标准形过渡矩阵的一种算法:求出一线性方程组解空间的基,解空间即是矩阵关于某特征值的特征向量、广义特征向量所张成的子空间,在该解空间中依次找出各特征向量及所对应的广义特征向量.一个8阶矩阵的计算实例表明算法简便实用.     

关于周期对称三对角矩阵的广义特征值反问题

在给定部分特征值、部分特征向量及附加条件下提出了一类反问题,并给出了此问题解存在性的证明及求解的算法.     

多参数结构特征二阶灵敏度

提出了一种有效计算多参数结构特征值与特征向量二阶灵敏度矩阵--Hessian矩阵的方法.将特征值和特征向量二阶摄动法转变为多参数形式,推导出二阶摄动灵敏度矩阵,由此得到特征值和特征向量的二阶估计式.该法解决了无法用直接求导法计算特征值和特征向量二阶灵敏度矩阵的问题.数值算例说明了该算法的应用和计算精度.     

二次特征值问题中特征值和特征向量的可微性

二次特征值问题中特征值和特征向量的可微性,给出了其导数的计算公式及其算法.     

关于完全完备分配格上矩阵相对于特征值的特征向量

借助于伪补和矩阵的幂序列研究了完全完备分配格上矩阵相对于特征值的特征向量的计算方法,利用特征向量的性质证明了最大特征向量的计算公式,并给出了一般特征向量的计算方法.     

广义实对称矩阵及有关性质

给出了广义实对称矩阵的定义,得到的基本运算结果仍然是广义实对称矩阵,并讨论了它的特征值和特征向量.     

特征值及特征向量微商的解析表达式

利用左、右特征向量方法,Lancoster(1964)给出单参数下单特征根的微商表达式。本文则在多参数下,对具有不同特征值的任意方阵得出下面结果: 1.证明了任单特征值及对应的特征向量是多元解析函数。 2.给出了左、右特征向量微商的解析表达式,进一步可得出它们的任何阶偏微商的表达式。 3.给出每一个特征向量的一阶全微分,特征值的一阶及二阶全微分表达式,进而求出每一个特征值残差佑计的理论性公式及实用性公式。     

用简单反迭代法计算三对角矩阵的特征向量

与特征值计算的算法丰富多彩相比,在已知比较精确的特征值的情况下,求其相应的特征向量的算法却不多见,已有的算法有基本反迭代法[1][2][4][5]、交替法[3]等.到目前为止,计算特征向量的算法都是基于反迭代法的,衡量算法是否收敛都是以残量的大小为标准,本文的算法也不例外.本文的目的就是计算不可约实对称三对角矩阵T=[bj-1,aj,bj]的相应于某个特征值λi（已得到其近似λ）的特征向量.首先我们来看下面的例子:例1 我们取T为201阶的Wilkinson负矩阵,λ取计算的最大特征值,分别令迭代的初始向量是e1,e100,e201,e=（1,1,…,1）T.图1反映了反迭代的收敛速度.     

一类三对角矩阵的特征值和特征向量的研究

讨论了一种三对角矩阵的特征值和特征向量.按矩阵右下角对角元素的参数分为两类,得出特征值和特征向量的结论或数值算法.举例说明了算法的有效性.     

矩阵约当标准化的一个新方法

在线性和非线性问题的研究中,常需要构造一个基,使线性算子T在此基础下的矩阵表示为约当标准型,本文介绍了构造这种基的一个方法,我们从T的每个特征向量开始,通过求解一系列线性方程组而求得广义特征向量的一个链,将所有这种链放在一起,便构成想要的一组基,与通常的方法相比,这一方法较易操作,计算量小。     

Calculating the minimal/maximal eigenvalue of symmetric parameterized matrices using projection

In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters ω and we are interested in the minimal eigenvalue of a matrix pencil ( A , B ) with A , B symmetric and B positive definite. If ω can be interpreted as the realization of random variables, one may be interested in statistical moments of the minimal eigenvalue. In order to obtain statistical moments, we need a fast evaluation of the eigenvalue as a function of ω . Because this is costly for large matrices, we are looking for a small parameterized eigenvalue problem whose minimal eigenvalue makes a small error with the minimal eigenvalue of the large eigenvalue problem. The advantage, in comparison with a global polynomial approximation (on which, e.g., the polynomial chaos approximation relies), is that we do not suffer from the possible nonsmoothness of the minimal eigenvalue. The small‐scale eigenvalue problem is obtained by projection of the large‐scale problem. Our main contribution is that, for constructing the subspace, we use multiple eigenvectors and derivatives of eigenvectors. We provide theoretical results and document numerical experiments regarding the beneficial effect of adding multiple eigenvectors and derivatives.     

A note on spectrum distribution of constraint preconditioned generalized saddle point matrices

In this note, results concerning the eigenvalue distribution and form of the eigenvectors of the constraint preconditioned generalized saddle point matrix and its minimal polynomial are given. These results extend previous ones that appeared in the literature. Copyright © 2009 John Wiley & Sons, Ltd.     

On the Analytical Approach of Codimension-Three Degenerate Bogdanov-Takens (B-T) Bifurcation in Satellite Dynamical System

In this paper, we have conducted parametric analysis on the dynamics of satellite complex system using bifurcation theory. At first, five equilibrium points $\mathcal{E}_{0,1,2,3,4}$ are symbolically computed in which $\mathcal{E}_{1,3}$ and $\mathcal{E}_{2,4}$ are symmetric. Then, several theorems are stated and proved for the existence of B-T bifurcation on all equilibrium points with the aid of generalized eigenvectors and practical formulae instead of linearizations. Moreover, a special case $\alpha_{2}=0$ is observed, which confirms all the discussed cases belong to a codimension-three bifurcation along with degeneracy conditions.     

An Eigenvalue Approach to Analyzing a Finite Source Priority Queueing Model

In this paper, we present a novel approach to determining the steady-state distribution for the number of jobs present in a 2-class, single server preemptive priority queueing model where the low priority source population is finite. Arrivals are assumed to be Poisson with exponential service times. The system investigated is a quasi birth and death process, and the joint distribution is derived via the method of generalized eigenvalues. Using this approach, we are able to obtain all eigenvalues and corresponding eigenvectors explicitly. Furthermore, we link this method to the matrix analytic approach by obtaining an explicit solution for the rate matrix R. Two numerical examples are given to illustrate the procedure and highlight some important computational features.     

On the matrix algebra of elliptic biquaternions

In this study, we introduce the concept of elliptic biquaternion matrices. Firstly, we obtain elliptic matrix representations of elliptic biquaternion matrices and establish a universal similarity factorization equality for elliptic biquaternion matrices. Afterwards, with the aid of these representations and this equality, we obtain various results on some basic topics such as generalized inverses, eigenvalues and eigenvectors, determinants, and similarity of elliptic biquaternion matrices. These valuable results may be useful for developing a perfect theory on matrix analysis over elliptic biquaternion algebra in the future.     

Modified block preconditioner for generalized saddle point matrices with highly singular(1,1) blocks

ABSTRACT

In this paper, based on the preconditioners presented by Zhang [A new preconditioner for generalized saddle matrices with highly singular(1,1) blocks. Int J Comput Maths. 2014;91(9):2091-2101], we consider a modified block preconditioner for generalized saddle point matrices whose coefficient matrices have singular (1,1) blocks. Moreover, theoretical analysis gives the eigenvalue distribution, forms of the eigenvectors and the minimal polynomial. Finally, numerical examples show the eigenvalue distribution with the presented preconditioner and confirm our analysis.     

A note on constraint preconditioners for nonsymmetric saddle point problems

A class of constraint preconditioners for solving two‐by‐two block linear equations with the (1,2)‐block being the transpose of the (2,1)‐block and the (2,2)‐block being zero was investigated in a recent paper of Cao (Numer. Math. 2006; 103 :47–61). In this short note, we extend his idea by allowing the (1,2)‐block to be not equal to the transpose of the (2,1)‐block. Results concerning the spectrum, the form of the eigenvectors and the convergence behaviour of a Krylov subspace method, such as GMRES are presented. Copyright © 2007 John Wiley & Sons, Ltd.