• And all of these approaches are derived from the full rank decomposition technique for the incidence matrix.

    这些方法都是基于网关联矩阵的满秩分解。

    youdao

  • It is usually required that the design matrix is column full rank in applying recursive weighted least squares algorithm.

    通常在使用递推加权最小二乘算法时,需要设计矩阵列满秩。

    youdao

  • Full rank decomposition of matrix and triangular decomposition of strongly full rank can well be realized by elementary transformation method of matrix.

    通过矩阵的初等变换可实现矩阵的满秩分解和强满秩矩阵的三角分解。

    youdao

  • By the transformation theory of the adjustment, only the full rank transformation could get a full equivalent adjustment result to original observations.

    按照平差变换理论,只有满秩变换,才能得到与原观测完全等价的平差结果。

    youdao

  • Compared with the full rank space-time trellis code (FR-STTC) with the same transmission rate, it can provide a better performance and a lower realization complexity.

    与同速率的满秩网格空时码相比,它能获得更好的误码性能,并且实现简单。

    youdao

  • This paper discusses the way about how to get the reflexive general inverse matrix of a full rank matrix A, and generalize this way, gives the general way for not full rank matrix.

    讨论了当矩阵A为满秩矩阵时求其广义逆的一种方法,并将此方法推广,给出当A为非满秩矩阵时求其广义逆的一般方法,同时给出算例。

    youdao

  • This paper discusses the way about how to get the reflexive general inverse matrix of a full rank matrix A, and generalize this way, gives the general way for not full rank matrix.

    讨论了当矩阵A为满秩矩阵时求其广义逆的一种方法,并将此方法推广,给出当A为非满秩矩阵时求其广义逆的一般方法,同时给出算例。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定