行矩阵
- 网络row matrix;Column Matrix
-
提出一种以具体说明抽象的教法来讲授狄拉克符号,可以把刃矢和刁矢分别理解为列矩阵和行矩阵。
A method of teaching Dirac symbols that the abstract is represented by the specific is presented . A ket vector and a bra vector can be regarded as a column matrix and a row matrix , respectively .
-
在此基础上,从顶点模型的观点出发,我们利用Yang-Baxter方程和边界反射方程给出了双行monodromy矩阵的矩阵元之间的对易关系。
By expanding the Yang-Baxter relation and the reflection equation , we obtain the commutation relations of the elements of the double-row monodromy matrix .
-
本文给出了行正交矩阵的分层克罗内克积扩大法,以及扩大后矩阵的快速算法,利用分层克罗内克积扩大法构造了L2空间上的正交完全系。
In this paper Layer-built Kronecker Product Expansive Method of Matrix , in Which Rows Are Orthogonal Each Other and fast algorithm of expanded matrix are presented . Using this expansive method , Orthogonal Complete Systems in L2-space are built up .
-
接着借助量子反散射方法,运用两体散射矩阵和反射矩阵,构造了双行monodromy矩阵、转移矩阵和系统的边界反射方程,从而详细证明了系统的精确可解性。
Then , we set up the double-row monodromy matrix of the Hamiltonian , the transfer matrix and the reflection equation of the system with the help of the scattering matrix and the reflecting matrix .
-
行正交矩阵的分层克罗内克积扩大法
Layer-built Kronecker Product Expansive Method Of Matrix , in Which Rows Are Orthogonal Each Other
-
本文用C-程序实现行等和矩阵的构造,并利用行等和矩阵构造阶数为n(n≠4t+2,12t)的全对角线幻方。
A C-program composition method is given to construct pandiagonal magic square . In this paper we define row sum-equal matrix to construct pandiagonal magic square of order n ( n ≠ 4t + 2,12t ) .
-
列(行)酉矩阵与酉变换的可逆性
Column ( Row ) Unital Matrix and the Inverse of Unital Transformation
-
由一列或一行构成的矩阵通称为向量。
A matrix consisting of one column or one row is known as a vector .
-
图解法能够运用建立的图表,直观地查找网络系统内的故障网段;遍历矩阵法通过对应树模型的行、列矩阵,经过简单乘积计算完成故障的定位。
Graphic method can be used to establish charts , visually locate the fault within the network segment ; tree traversal matrix model by the corresponding row , column matrix , can complete failure of the product positioning after a simple calculation .
-
用于行对角占优信道矩阵的MIMO盲均衡算法
Blind MIMO Equalization Algorithm for Row Diagonally Predominant Channel Matrix
-
Meschach能计算快速傅立叶变换(FastFourierTransform)、提取列和行以及计算对称矩阵的特征值。
Meschach computes Fast Fourier Transforms , extracts columns and rows , and computes eigenvalues of symmetric matrices .
-
三行H-B插值关联矩阵的正则性
Regularity of the three & row incidence matrix of H-B interpolation problem
-
用初等行变换求线性矩阵方程的通解
Finding All Solutions of a Linear Matrix Equation by Elementary Row Operations
-
利用初等行变换解线性矩阵方程
To Solve Line Matrix Equation With Elementary Line Operation
-
给出利用矩阵初等行变换直接求得矩阵方程通解的方法。
A method is given to solve directly matrix equations by row-transformation of matrix .
-
首先,利用邻接矩阵生成行码距异或矩阵和行码距同或矩阵;
First , a row code XOR distance matrix and a row code AOR distance matrix are computed in terms of the graph adjacency matrix .
-
本文介绍了矩阵的初等行变换在求矩阵的秩、求可逆矩阵的逆矩阵、解矩阵方程、解线性方程组以及研究向量间的线性关系等方面的应用。
The paper makes an introduction to the applications of elementary row transformation in the solution to the ranks of matrix , finding inverse matrix , resolving matrix equation and linear equations and linear relations among vector .
-
设计的算法是,在约当消元法的基础上,只需对行最简形矩阵进行删除行和列、增加行、交换行等运算即可得到方程组的通解。
The algorithm in this article is designed on the basis of the elimination of Jordan . General solution can be ( obtained ) merely by operation like eliminating , adding or altering row and line of the matrix in its most simplifying form .
-
该快速算法仅用到鳞状因子循环矩阵的第一行元素及对角矩阵中的对角上的常数进行计算。在计算机上实现时只有舍入误差。
There is only an error of approximation when the fast algorithm is implemented on computers , and only the elements in the first row of the scaled factor circulant matrix and the constants in the diagonal matrix are needed by the fast algorithm .
-
内循环建立行,外循环将这些行排成矩阵中的列。
The inner For Loop creates a row , and the outer For Loop " stacks " these rows to fill in the columns of the matrix .
-
规模典型地用代码行(LOC)表示;考虑使用代码行,因为代码行矩阵能够最好地表达真实地逻辑量级。
Size is typically given as Lines of Code ( LOCs ); consider using eLOC as the LOC metric that best represents the true volume of logic .
-
LED阵列由240行×144列(~VGA/8)个象素组成,象素节距为20μm,显示速度每秒60帧,按行主导矩阵寻址方式来驱动。
The LED arrays consisted of 240 columns × 144 rows (~ VGA / 8 ) with pixels on a 20 μ m pitch and were driven in a column major matrix addressing mode at 60 frames per second for image display .