利用矩阵的初等变换求方阵的特征值

高阶方阵的特征多项式以及特征值的求得,在计算上往往有一定的难度.本文首先从理论上分析了存在一个上三角矩阵或者下三角矩阵与一个方阵相似;接着,提出了相似变换的概念,分析了相似变换中初等矩阵的选择方法;然后指出了利用相似变换在求方阵的特征多项式以及特征值时的方法,并列举若干实例给予了说明.     

An Approach to Solving Inverse Eigenvalue Problems for Matrices

The paper considers different formulations of inverse eigenvalue problems for matrices whose entries either polynomially or rationally depend on unknown parameters. An approach to solving inverse problems together with numerical algorithms is suggested. The solution of inverse problems is reduced to the problem of finding the so-called discrete solutions of nonlinear algebraic systems. The corresponding systems are constructed using the method of traces, and their discrete roots are found by applying the algorithms for solving nonlinear algebraic systems in several variables previously suggested by the author. Bibliography: 30 titles.     

对称双随机矩阵逆特征值问题

主要研究随机矩阵逆特征值问题．特别是对称双随机矩阵和列随机矩阵逆特征值问题．对参考文献[1]与[2]的结论作了一些推广．并给出了—个数值例子．     

利用矩阵的初等变换求方阵的特征值

高阶方阵的特征值的求得,需求解一元高次方程,这往往有一定的难度.本文依据矩阵的初等变换的一些良好性质,介绍两种利用矩阵的初等变换化简方阵的特征值的计算的方法.     

非负矩阵最大特征值的新界值

对最大特征值的上下界进行估计是非负矩阵理论的重要部分,借助两个新的矩阵,从而得到一个判定非负矩阵最大特征值范围的界值定理,其结果比有关结论更加精确.     

非负矩阵最大特征值的估计法

通过构造一个新的矩阵,从而得到一个非负矩阵最大特征值的估计法,该方法将适用范围推广到一般非负矩阵,并通过实例验证了这种新方法精确度更高.     

实对称矩阵的一类逆特征值问题

利用矩阵的奇异值分解及广义逆，给出了矩阵约束下矩阵反问题AX=B有实对称解的充分必要条件及其通解的表达式．此外，给出了在矩阵方程的解集合中与给定矩阵的最佳逼近解的表达式．     

矩阵乘积的初等变换术及其应用

通过矩阵乘法运算的拆行拆列表示,巧妙地绕过初等矩阵,建立了矩阵乘积的初等变换术,进而导出了原来运用初等矩阵才能导出的有关初等变换、逆矩阵、矩阵方程、矩阵等价的若干重要结果.     

一类反对称正交反对称矩阵逆特征值问题

设P为一给定的对称正交矩阵,记AARnP={A∈Rn×n‖AT=-A,(PA)T=-PA}.讨论了下列问题:问题给定X∈Cn×m,Λ=diag(λ1,λ2,…,λm).求A∈AARPn使AX=XΛ.问题设A~∈Rn×n,求A*∈SE使‖A~-A*‖=infA∈SE‖A~-A‖,其中SE为问题的解集合,‖.‖表示Frobenius范数.研究了AARPn中元素的通式,给出了问题解的一般表达式,证明了问题存在唯一逼近解A*,且得到了此解的具体表达式.     

The Cayley Method and the Inverse Eigenvalue Problem for Toeplitz Matrices

Despite the fact that symmetric Toeplitz matrices can have arbitrary eigenvalues, the numerical construction of such a matrix having prescribed eigenvalues remains to be a challenge. A two-step method using the continuation idea is proposed in this paper. The first step constructs a centro-symmetric Jacobi matrix with the prescribed eigenvalues in finitely many steps. The second step uses the Cayley transform to integrate flows in the linear subspace of skew-symmetric and centro-symmetric matrices. No special geometric integrators are needed. The convergence analysis is illustrated for the case of n = 3. Numerical examples are presented.     

等差-等比循环矩阵的逆矩阵求法

本文给出了等差-等此循环矩阵的逆矩阵求法,推广文[5]的结果.     

An Improvement of an Inequality of Fiedler Leading to a New Conjecture on Nonnegative Matrices

Suppose that A is an n × n nonnegative matrix whose eigenvalues are = (A), ₂, ..., _n. Fiedler and others have shown that \det( I -A) ⁿ - ⁿ, for all > with equality for any such if and only if A is the simple cycle matrix. Let a _i be the signed sum of the determinants of the principal submatrices of A of order i × i, i=1, ..., n - 1. We use similar techniques to Fiedler to show that Fiedler's inequality can be strengthened to: for all . We use this inequality to derive the inequality that: . In the spirit of a celebrated conjecture due to Boyle-Handelman, this inequality inspires us to conjecture the following inequality on the nonzero eigenvalues of A: If ₁ = (A), ₂,...,_k are (all) the nonzero eigenvalues of A, then . We prove this conjecture for the case when the spectrum of A is real.     

线性流形上广义次对称矩阵的左右逆特征值问题

研究线性流形上广义次对称矩阵的左右逆特征值问题及其最佳逼近问题.利用广义次对称矩阵的性质及矩阵的奇异值分解得到问题的通解表达式.同时,给出其有唯一的最佳逼近解以及求最佳逼近解的算法.     

An Elementary Approach to Exponential Spaces

In 1970, Day and Kelly characterized exponential spaces by a condition (C). Eight years later, Hofmann and Lawson pointed out that this is equivalent to quasi-local compactness, i.e. every neighborhood V of a point contains a smaller one W such that any open cover of V admits a finite subcover of W. These characterizations work with topologies on topologies and may be felt to be not really elementary. This note instead offers an elementary approach which applies to quotient-reflective subcategories as well and includes a natural generalization of the compact-open topology on function spaces.     

An Elementary Approach to Exponentiable Maps

Originally, exponentiable maps in the category Top of topological spaces were described by Niefield in terms of certain fibrewise Scott-open sets. This generalizes the first characterization of exponentiable spaces by Day and Kelly, which was improved thereafter by Hofmann and Lawson who described them as core-compact spaces.Besides various categorical methods, the Sierpinski-space is an essential tool in Niefield's original proof. Therefore, this approach fails to apply to quotient reflective subcategories of Top like Haus, the category of Hausdorff spaces. A recent generalization of the Hofmann–Lawson improvement to exponentiable maps enables now to reprove the characterization in a completely different and very elementary way. This approach works for any nontrivial quotient reflective subcategory of Top or Top/ _T , the category of all spaces over a fixed base space T, as well as for exponentiable monomorphisms with respect to epi-reflective subcategories.An important special case is the category Sep_Top/ _T of separated maps, i.e. distinct points in the same fibre can be separated in the total space by disjoint open neighbourhoods. The exponentiable objects in Sep turn out to be the open and fibrewise locally compact maps. The same holds for Haus/ _T , T a Hausdorff space. In this case, a similar characterization was obtained by Cagliari and Mantovani.     

On the Minimal Number of Even Submatrices of 0-1 Matrices

An asymptotic formula for the minimum possible number of even p x q submatrices of an m x n 0-1 matrix A is obtained. It is shown that if Ais considered random and pq is even, then the distributionof the number of the even p x q submatricesof A is highly skewed to the right, the left endpointof the distribution being very close to its mean, while its rightendpoint is twice the mean. A relation to Turán numbersis indicated.     

关于区间数决策矩阵的专家群体判断共识性研究

针对群决策中基于区间数决策矩阵形式偏好信息的专家群体判断共识性问题,提出了一种分析方法.首先,给出了有关区间数的定义及其运算法则;然后,通过定义有关区间数决策矩阵的区间数向量,给出了各个专家与专家群体判断的共识性分析方法,同时,也给出了基于区间数决策矩阵的专家群体判断共识性的判别方法.最后,通过一个算例说明了本文提出的分析方法.     

An Elementary Proof of Eigenvalue Preservation for the Co-rotational Beris-Edwards System

Journal of Nonlinear Science - We study the corotational Beris-Edwards system modeling nematic liquid crystals and revisit the eigenvalue preservation property discussed in Wu et al. (Arch Rational...     

Elementary Proof of an Estimate for Kloosterman Sums with Primes

A new elementary proof of an estimate for incomplete Kloosterman sums modulo a prime q is obtained. Along with Bourgain’s 2005 estimate of the double Kloosterman sum of a special form, it leads to an elementary derivation of an estimate for Kloosterman sums with primes for the case in which the length of the sum is of order q^0.5+ε, where ε is an arbitrarily small fixed number.     

An Elementary Approach to the Twin Primes Problem

Hardy-Littlewood [4] conjectured an asymptotic formula for the number of prime pairs (twin primes) (p, p+2d) with p+2dy, where d N is fixed and y . Up to now, no one has been able to prove this conjecture, but employing Hardy-Littlewoods circle method, Lavrik [5] showed that in a certain sense this formula holds true for almost-all dy/2.In the present paper, we use a completely different method to prove Lavriks almost-all result. Our method is based on an elementary approach developed by Pan Chengdong [7] to the twin primes problem. By a slight modification of our method, we get a corresponding almost-all result for the binary Goldbach problem. From this, according to [3], we derive Vinogradovs [8] well-known Three-Primes-Theorem.