rank of a matrix 中文意思是什麼
rank of a matrix
解釋
矩陣的秩-
In this paper we first give the definition of a type of block upper triangular matrix algebras and then characterize linear surjective maps that preserve rank one from one block upper triangular matrix algebra of this type to another
本文的主要結果是確定了一類分塊上三角矩陣代數的保持秩一的線性滿射。本文首先定義了一類分塊上三角矩陣代數（ c ） ，然後確定了保持秩一的線性滿射。 -
This dissertation proves that a single m - partite entangled mixed state in the system whose dimension of each subsystem is two cannot be purified to an m - partite entangled pure state. in general, a single m - partite entangled mixed state whose density matrix has higher rank cannot be purified to an m - partite entangled pure state. for a class of entangled mixed states, its fidelity cannot be increased under locc
論證了在局域操作和經典通信下，單個多體糾纏混合態（每個子系統的維數都為2 ）不可能被純化；密度矩陣有著較高秩的混合態也不可能被純化；給出了一類多體糾纏混合態，在局域操作和經典通信下，對某一糾纏純態的忠實度不能增加。 -
We can find a polynomial model of a time series in case its associated matrix is not diagonal and not of full rank by using the transformations of the exponential and the logarithm
對于不能對角和不滿秩的時間序列矩陣，運用指數對數的可逆變換及相關的列變換化為滿秩可對角的時間序列矩陣，從而找到代數多項式模型。 -
We define the rank of a matrix as the number of linearly independent rows which it contains.
我們把這個矩陣的秩定義為它所包含的線性無關行的數目。 -
Lastly, the dissertation designs a rank - reduced blind space - time 2 - d rake receiver using time extraction which has not only the capability of space - time equilibrium but also reduces the convergence time of adaptive array and the rank of correlated matrix of the received data
最後，設計了一種時間抽取降秩盲空時2 - drake接收機。分析了其性能和參考信號的提取方法。該接收機不但具有空時均衡的能力，而且降低了陣列的收斂時間和接收數據相關矩陣的秩。 -
Abstract : by comparing the channel capacities hetwem orthogonal space - time block coding and multi - antenna array system over rayleigh fading channel, some capacity loss for orthogonal space - time block coding is obtained, which is a function of the code rate, the rank of channel matrix and the number of transmitter and receive antennas, although the system of orthogonal space - time block codes is simple and easy to implemented. if is also shown that there is no capacity loss only if both the code rate and the channel matrix rank are all one
文摘:在研究瑞利衰落條件下正交空時分組編碼通道容量的基礎上，將其與多發送多接收天線系統的通道容量進行了比較.比較結果表明，正交空時分組碼雖編碼簡單，易於實現，但在通道容量方面存在較大的損失，損失的程度與編碼碼率、通道矩陣的秩及收發天線數等因素有關.進一步研究表明只有當編碼碼率和通道矩陣的秩都為1時，才沒有通道容量的損失 -
A. p. verbyla and w. n. venables ( 1988 ) extended the ordinary growth curve model into the extension of growth curve model and obtained an estimate of the unknown parameter matrix under the conditions that the matrix of observations follow multivariate normal distribution, where every design matrix has full column rank [ 7 ]
A . p . verbyla和w . n . venables （ 1988 ）將gc模型進行了推廣，得到了推廣增長曲線模型（ theextensionofgrowthcurvemodel簡稱egc模型） ，並在觀察矩陣服從正態分佈，各設計矩陣均為列滿秩的條件下，給出了參數矩陣估計值的一種演算法。 -
Different from other rank reduction methods, such as pca ( principal component analysis ) and vq ( vector quantization ), nmf ( nonnegative matrix factorization ) can get nonnegative, sparse basis vectors which make possible of the concept of a parts - based representation
與pca （主分量分析）和vq （矢量量化）等降維演算法不同， nmf （非負矩陣分解）演算法能夠分解出非負的，稀疏的特徵矩陣和編碼矩陣，能夠提取原始數據向量的局部特徵，使基於局部特徵進行分類的聚類演算法更容易實現。 -
Based on this idea, a general framework for linear analysis in singular case is developed, i. e., pca is first used to reduce the dimension of image space to m ( the rank of the total scatter matrix )
更為重要的是，我們進一步揭示了高維、小樣本情況下線性鑒別分析的本質，即先作k - l變換，再用fisher鑒別變換作二次特徵抽取。 -
By elementary rank transformations of matrix, a method has been obtained to solve linear diophantine equation with some variables. the method overcomes the deficiency of traditional method
摘要利用矩陣的初等列變換，給出了求解多元線性不定方程的一種方法，該方法改進了傳統方法計算量大、步驟多的缺點。 -
Proof of a class of matrix rank identities
一類矩陣秩恆等式的證明 -
On [ 0, oo ) the product l = l2lt of operator z, j and l2 isselfadjointifandonly if where 4 5, c, ? are some ordinary matrix with rank ( a b ) = rank ( c d ) = 4. 2
關于積運算元的自伴性，兩個正則或奇異的二階對稱微分算式生成的積運算元的自伴性已取得一些結果。
分享友人