The uniqueness of parameter identification is guaranteed by the full column rank of the coefficient matrix of the linear equations.
参数的唯一可辨识性由线性方程组系数矩阵的列满秩保证。
The number of chosen transmit antennas is equal to the rank of channel matrix to ensure that the resulting channel matrix is full column rank.
为了保证信道矩阵是列满秩，因此选择出的天线子集中的发射天线数量等于信道矩阵的帙数。
Let A be a matrix of full column rank, and let x be a computed solution to the linear system ATAx = b.
设A是一个列满秩矩阵，x是线性方程组ATAx=b的一个计算解。
Using an aggregation matrix with full column rank to map the on-line optimization variable sequence into a new one, the number of on-line optimization variables is cut down without reducing the control horizon. A sufficient condition is presented to check whether the control variable sequence can be aggregated.
通过一个列满秩的集结矩阵将维数较小的控制变量序列映射成在线优化变量序列，在不缩短控制时域的情况下，降低了在线优化变量的个数。
In addition, the formulas of the full rank factorization, rank factorization and generalized inverse of row (column) antisymmetric matrix are given, which make calculation easier and accurate.
利用分块矩阵理论获得了许多新的结果，给出了行（列）反对称矩阵的满秩分解、秩分解和广义逆的公式及快速算法。
The full rank factorization and Moore-Penrose inverse for generalized row (column) unitary symmetric matrix
广义行（列）酉对称矩阵的满秩分解及其Moore-Penrose逆
In this paper, the sufficient and necessary conditions of row (column) full rank matrix and the row (column) full rank solution to homogeneous matrix equation are obtained. It also discusses the matrix decomposition and its application in the theory of homogeneous linear equations
本文建立了行（列）满秩矩阵和齐次矩阵方程有行（列）满秩解的充要条件，并讨论了矩阵分解及其在齐次线性方程组的应用
In this paper, a fast algorithm for the Moore-Penrose inverse of an m × n Cauchy matrix with full column rank is given.
给出了求以秩为n的m×n阶Cauchy矩阵Moore-Penrose逆的快速算法，该算法的计算复杂度为O（mn）+O（n2）。
Finally, the method is extended to the case of high-matrix (when the row number is greater than the column number) for column non-full ranks, and the example in the computation of adjustments of rank-defect is given.
最后将该方法推广到列不满秩的高矩阵（即行数大于列数）的情形，给出了亏秩平差计算中的一个实例。
Using the criteria on a full row or column rank solutions of Sylvester equation, the authors discuss the full row or column rank properties of generalized Loewner matrice、Hankel matrice and generalized Cauchy matrice.
利用Sylvester方程具有行满秩或列满秩解的判定准则研究广义Loewner矩阵、Hankel矩阵和广义Cauchy矩阵的行（列）满秩性。
In particular, extremely concise proofs for famous results such as Frobenius inequality and Sylvester inequality are obtained, and some related problems and facts in linear algebra, including properties of matrices with full column rank, and discussed.
特别是，给出了Frobenius不等式，Sylvester不等式等著名结果的极其简洁的证明，据此探讨了线性代数中有关问题和实例，包括列满秩矩阵的特点等。
Using the criteria on a full row or column rank solutions of Sylvester equation, the authors discuss the full row or column rank properties of generalized Loewner matrice 、 Hankel matrice and generalized Cauchy matrice.
利用Sylvester方程具有行满秩或列满秩解的判定准则研究广义Loewner矩阵、Hankel矩阵和广义Cauchy矩阵的行（列）满秩性。