共查询到20条相似文献,搜索用时 93 毫秒
1.
在矩阵理论框架下,引入了模糊有限自动机转移矩阵,变换矩阵半群以及覆盖概念.定义了模糊有限自动机Kronecker积,讨论了其转移矩阵性质及变换矩阵半群间的覆盖关系. 相似文献
2.
本文通过对一般的矩阵方程Am×nXn×s=Bm×s的矩阵A和B作初等行变换及初等列变换,给出了一般矩阵方程的求解方法. 相似文献
3.
消错学的错误矩阵可表达错误逻辑里所定义的分解、相似、增加、置换、毁灭、单位变换等转化词,针对其中的置换变换,构建了二类1错误矩阵方程增优置换变换错误矩阵方程,并讨论了该类错误矩阵方程的求解.用交通管理问题对错误矩阵进行了举例,并构建相应的错误矩阵方程,利用上述的求解方法,对二类1方程置换变换进行了求解. 相似文献
4.
5.
随着新课程的推进,<矩阵与变换>作为一个专题已经进入中学课堂,伸压变换矩阵作为一类重要的变换矩阵与函数的伸缩变换有着本质的联系.将伸压变换矩阵应用到解题中,不但可以拓宽解题思路,而且可以简化解题过程.本文就谈谈利用伸压变换矩阵解椭圆问题. 相似文献
6.
7.
8.
特征值问题的预变换方法(I): 杨辉三角阵变换与二阶PDE 特征多项式 总被引:2,自引:0,他引:2
本文提出一类求解特征值问题的下三角预变换方法, 目标是通过相似变换后矩阵下三角元素平方和明显减少、且变换后的特征值及其特征向量较易求解, 使变换后的对角线可作为全体特征值很好的一组初值, 其作用如同对于解方程组找到好的预条件子, 加速迭代收敛. 以二阶PDE 数值计算为例,对于以Laplace 方程为代表的特征波向量组及正交多项式组有广泛的应用前景.
杨辉三角是我国古代数学家的一项重要成就. 本文引入杨辉三角矩阵作为预变换子, 给出一般矩阵用杨辉三角矩阵作为左、右预变换子时变为上三角矩阵的充要条件, 给出了元素为行指标二次多项式的两个矩阵类(三对角线阵与五对角线阵) 中特征值何时保持二次多项式的充要条件, 并应用于构造新的二元PDE 正交多项式. 相似文献
杨辉三角是我国古代数学家的一项重要成就. 本文引入杨辉三角矩阵作为预变换子, 给出一般矩阵用杨辉三角矩阵作为左、右预变换子时变为上三角矩阵的充要条件, 给出了元素为行指标二次多项式的两个矩阵类(三对角线阵与五对角线阵) 中特征值何时保持二次多项式的充要条件, 并应用于构造新的二元PDE 正交多项式. 相似文献
9.
相似变换矩阵的简单求法 总被引:3,自引:1,他引:3
在研究矩阵相似问题时,如果知道矩阵A及相似变换矩阵P,则可求出与A相似的矩阵B=P~(-1)AP 反过来,如果知道A及其相似矩阵B,如何求相似变换矩阵P的问题,一般线性代数教材都很少提及它。即使个别教材中提到这个问题,也只是针对B是A的Jordan标准形的简单情形,应用解非齐次线性方程组AX=XB的方法求出相似变换矩阵P的,因B是特殊情形,所以这种方法不具有普遍意义。 相似文献
10.
本文介绍线性代数中的二维代数变换与解析几何中的平面仿射变换的关系,代数变换及其变换矩阵的几何意义,各种仿射变换的矩阵表示及其矩阵性质,梳理仿射变换下的不变性质与不变量. 相似文献
11.
Raphaël M. Jungers 《Linear algebra and its applications》2008,428(10):2283-2295
We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. It was conjectured a decade ago that all finite sets of real matrices have the finiteness property. This “finiteness conjecture” is now known to be false but no explicit counterexample is available and in particular it is unclear if a counterexample is possible whose matrices have rational or binary entries. In this paper, we prove that all finite sets of nonnegative rational matrices have the finiteness property if and only if pairs of binary matrices do and we state a similar result when negative entries are allowed. We also show that all pairs of 2×2 binary matrices have the finiteness property. These results have direct implications for the stability problem for sets of matrices. Stability is algorithmically decidable for sets of matrices that have the finiteness property and so it follows from our results that if all pairs of binary matrices have the finiteness property then stability is decidable for nonnegative rational matrices. This would be in sharp contrast with the fact that the related problem of boundedness is known to be undecidable for sets of nonnegative rational matrices. 相似文献
12.
13.
The well-known classes of EP matrices and normal matrices are defined by the matrices that commute with their Moore–Penrose inverse and with their conjugate transpose, respectively. This paper investigates the class of m-EP matrices and m-normal matrices that provide a generalization of EP matrices and normal matrices, respectively, and analyses both of them for their properties and characterizations. 相似文献
14.
15.
Mark-Alexander Henn 《Linear algebra and its applications》2010,433(6):1055-1059
Complex matrices that are structured with respect to a possibly degenerate indefinite inner product are studied. Based on earlier works on normal matrices, the notions of hyponormal and strongly hyponormal matrices are introduced. A full characterization of such matrices is given and it is shown how those matrices are related to different concepts of normal matrices in degenerate inner product spaces. Finally, the existence of invariant semidefinite subspaces for strongly hyponormal matrices is discussed. 相似文献
16.
All equivalence classes of Hadamard matrices of order at most 28 have been found by 1994. Order 32 is where a combinatorial explosion occurs on the number of Hadamard matrices. We find all equivalence classes of Hadamard matrices of order 32 which are of certain types. It turns out that there are exactly 13, 680, 757 Hadamard matrices of one type and 26, 369 such matrices of another type. Based on experience with the classification of Hadamard matrices of smaller order, it is expected that the number of the remaining two types of these matrices, relative to the total number of Hadamard matrices of order 32, to be insignificant. © 2009 Wiley Periodicals, Inc. J Combin Designs 18:328–336, 2010 相似文献
17.
We define the notion of an orbit matrix with respect to standard weighing matrices, and with respect to types of weighing matrices with entries in a finite field. In the latter case we primarily restrict our attention the fields of order 2, 3 and 4. We construct self-orthogonal and Hermitian self-orthogonal linear codes over finite fields from these types of weighing matrices and their orbit matrices respectively. We demonstrate that this approach applies to several combinatorial structures such as Hadamard matrices and balanced generalized weighing matrices. As a case study we construct self-orthogonal codes from some weighing matrices belonging to some well known infinite families, such as the Paley conference matrices, and weighing matrices constructed from ternary periodic Golay pairs. 相似文献
18.
Christian Mehl Volker Mehrmann André C. M. Ran Leiba Rodman 《BIT Numerical Mathematics》2014,54(1):219-255
We study the perturbation theory of structured matrices under structured rank one perturbations, with emphasis on matrices that are unitary, orthogonal, or symplectic with respect to an indefinite inner product. The rank one perturbations are not necessarily of arbitrary small size (in the sense of norm). In the case of sesquilinear forms, results on selfadjoint matrices can be applied to unitary matrices by using the Cayley transformation, but in the case of real or complex symmetric or skew-symmetric bilinear forms additional considerations are necessary. For complex symplectic matrices, it turns out that generically (with respect to the perturbations) the behavior of the Jordan form of the perturbed matrix follows the pattern established earlier for unstructured matrices and their unstructured perturbations, provided the specific properties of the Jordan form of complex symplectic matrices are accounted for. For instance, the number of Jordan blocks of fixed odd size corresponding to the eigenvalue 1 or ?1 have to be even. For complex orthogonal matrices, it is shown that the behavior of the Jordan structures corresponding to the original eigenvalues that are not moved by perturbations follows again the pattern established earlier for unstructured matrices, taking into account the specifics of Jordan forms of complex orthogonal matrices. The proofs are based on general results developed in the paper concerning Jordan forms of structured matrices (which include in particular the classes of orthogonal and symplectic matrices) under structured rank one perturbations. These results are presented and proved in the framework of real as well as of complex matrices. 相似文献
19.
It is known that the diagonal-Schur complements of strictly diagonally dominant matrices are strictly diagonally dominant matrices [J.Z. Liu, Y.Q. Huang, Some properties on Schur complements of H-matrices and diagonally dominant matrices, Linear Algebra Appl. 389 (2004) 365-380], and the same is true for nonsingular H-matrices [J.Z. Liu, J.C. Li, Z.T. Huang, X. Kong, Some properties of Schur complements and diagonal-Schur complements of diagonally dominant matrices, Linear Algebra Appl. 428 (2008) 1009-1030]. In this paper, we research the properties on diagonal-Schur complements of block diagonally dominant matrices and prove that the diagonal-Schur complements of block strictly diagonally dominant matrices are block strictly diagonally dominant matrices, and the same holds for generalized block strictly diagonally dominant matrices. 相似文献