共查询到19条相似文献,搜索用时 78 毫秒
1.
2.
作为一种新的矩阵乘法,矩阵半张量积正得到国内外学者越来越多的重视和参与,从而使之应用于越来越多的研究课题中.希望分析矩阵半张量积的基本原理,从其合理性说明它产生的必然性和存在的意义.同时,与已有的综述不同,这里不准备具体介绍它在那些问题中得到那些应用,而是从原理出发,说明它可能在那些类型的相关科学问题中得到应用.这使我们能够更主动地去开发它可能的潜在应用. 相似文献
3.
4.
关于矩阵张量积的一类问题 总被引:7,自引:0,他引:7
本文给出有限个矩阵张量积分别是正规矩阵、厄米特矩阵、正定矩阵的条件.推广了Y.E.Kuo的相关结果.另外也给出了两个亚半正定矩阵的张量积还是亚半正定矩阵的充要条件. 相似文献
5.
给出了广义换位矩阵的定义,推导出其主要性质,然后讨论了同一高维数组按不同指标索引的排列之间的相互关系,最后给出广义换位矩阵在矩阵半张量积和张量场中的应用. 相似文献
6.
广义酉矩阵与广义Hermite矩阵的张量积与诱导矩阵 总被引:2,自引:0,他引:2
本文研究了有限个广义酉矩阵与广义(反)Hermite矩阵的张量积和诱导矩阵.利用矩阵的张量积和诱导矩阵的性质,得到了它的张量积和诱导矩阵仍为广义酉矩阵与广义(反)Hermite矩阵. 相似文献
7.
8.
从y-数值半径的定义出发,利用矩阵张量积与诱导矩阵的性质,研究了它们的y-数值半径,得到了矩阵张量积与诱导矩阵y-数值半径的几个不等式. 相似文献
9.
证明了实对称正定矩阵或实对称半正定矩阵与 M-矩阵的 Hadamard乘积满足实对称正定矩阵 Hadamard乘积的 Oppenheim不等式 . 相似文献
10.
关于一个半正定矩阵的Khatri-Rao乘积的不等式的讨论 总被引:1,自引:0,他引:1
得到的一个矩阵乘积不等式及其逆向不等式.应用这些结果,把一个半正定矩阵Khatri-Rao乘积的不等式推广到实对称矩阵.并给出了它的逆向不等式及其等式条件. 相似文献
11.
Dai-zhanCheng 《应用数学学报(英文版)》2003,19(2):219-228
The left semi-tensor product of matrices was proposed in [2]. In this paper the right semi-tensor product is introduced first. Some basic properties are presented and compared with those of the left semi-tensor product.Then two new applications are investigated. Firstly, its applications to connection, an important concept in differential geometry, is considered. The structure matrix and the Christoffel matrix are introduced. The transfer formulas under coordinate transformation are expressed in matrix form. Certain new results are obtained.Secondly, the structure of finite dimensional Lie algebra, etc. are investigated under the matrix expression. These applications demonstrate the usefulness of the new matrix products. 相似文献
12.
讨论了有脉冲影响的κ-值逻辑网络的不动点及稳定性问题.利用矩阵的半张量积方法,首先将有脉冲影响的κ-值逻辑网络转化成基于矩阵的离散时间动态系统.然后,给出一点是系统不动点的充要条件.最后,给出了两种不同类型控制下系统稳定的充要条件. 相似文献
13.
关于随机矩阵Kronecker积的谱半径的不等式 总被引:2,自引:0,他引:2
研究了随机矩阵的Kronecker积的数学期望的性质,得到了随机矩阵的Kronecker积的谱半径的几个不等式. 相似文献
14.
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. 相似文献
15.
A representation for a weakly ergodic sequence of (nonstochastic) matrices allows products of nonnegative matrices which eventually become strictly positive to be expressed via products of some associated stochastic matrices and ratios of values of a certain function. This formula used in a random setup leads to a representation for the logarithm of a random matrix product. If the sequence of random matrices is in addition stationary then automatically almost all sequences are weakly ergodic, and the representation is expressed in terms of an one-dimensional stationary process. This permits properties of products of random matrices to be deduced from the latter. Second moment assumptions guarantee that central limit theorems and laws of the iterated logarithm hold for the random matrix products if and only if they hold for the corresponding stationary process. Finally, a central limit theorem for some classes of weakly dependent stationary random matrices is derived doing away with the restriction of boundedness of the ratios of colum entries assumed by previous studies. Extensions beyond stationarity are discussed. 相似文献
16.
Associative multiplications of cubic matrices are provided. The N3-dimensional 3-Lie algebras are realized by cubic matrices, and structures of the 3-Lie algebras are studied. 相似文献
17.
Mohsen Maesumi 《Linear algebra and its applications》2008,428(10):2324-2338
The notion of spectral radius of a set of matrices is a natural extension of spectral radius of a single matrix. The finiteness conjecture (FC) claims that among the infinite products made from the elements of a given finite set of matrices, there is a certain periodic product, made from the repetition of the optimal product, whose rate of growth is maximal. FC has been disproved. In this paper it is conjectured that FC is almost always true, and an algorithm is presented to verify the optimality of a given product. The algorithm uses optimal norms, as a special subset of extremal norms. Several conjectures related to optimal norms and non-decomposable sets of matrices are presented. The algorithm has successfully calculated the spectral radius of several parametric families of pairs of matrices associated with compactly supported multi-resolution analyses and wavelets. The results of related numerical experiments are presented. 相似文献
18.