查询词典 unique factorization theorem

Firstly, based on natural gradient and nonlinear principal component analysis, a matrix equation is obtained by block recursive updating,and then the matrix equation is solved using QR factorization and back substitution to obtain the optimal separating matrix.

此外，结合自然梯度和非线性主分量分析提出了一种块递归的盲源分离方法，构造出按块递归更新的矩阵方程，然后用QR分解和回代法求解该矩阵方程得到最优分离矩阵。

Firstly, based on natural gradient and nonlinear principle component analysis, a matrix equation is obtained by block recursive updating, and then the matrix equation is solved by using QR factorization and back substitution to obtain the optimal separating matrix.

首先基于自然梯度和非线性主分量分析，构造出按块递归更新的矩阵方程，然后用QR分解和回代法逐块求解该矩阵方程得到最优分离矩阵。

The last part of the chapter is devoted to the elementary factorization theory of commutative monoids with cancellation property and of commutative domains

后一部分主要介绍了关于交换幺半群的关于消去律的初等的因式分解理论以及交换整环的理论

By using the QCD factorization approach, we calculated the new physics contributions to the branching ratios of eight two-body charmless decays: B → Kπ, Kη~ After the inclusion of new physics corrections in the MSSM, the agreement between theoretical predictions and the measured values are improved.

2我们还在最小超对称标准模型下，计算了对B→KπKη~(等8个非粲强子衰变道的新物理修正。从整体上来看，新物理修正改善了理论预言和实验数据之间的符合程度。

Then,a new fast algorithm of the minimal norm least squares solution for linear system whose coefficients is an m×n symmetric Loewner matrix with full column rank is given by forming a special block matrix and researching the triangular factorization of its inverse.

对于工程计算中常常遇到的一类线性方程组的求解，通过构造特殊分块矩阵并研究其逆矩阵的三角分解，给出了求秩为n的m×n阶对称Loewner矩阵为系数阵的线性方程组，及极小范数最小二乘解的快速算法，该算法的计算复杂度为O+O(n2)，而一般方法的计算复杂度为O(mn2)+O(n3)。

In this paper, for m× n Loewner-type matrix or symmetric Loewner-type matrix with full column rank, we form special block matrix firstly and research their triangular factorization or of its inverse, and then get the fast algorithm of the minimal norm least squaresolution .

本文对于秩为n的m×n阶Loewner型或对称Loewner型矩阵L，通过构造特殊分块矩阵并研究其逆的三角分解或自身三角分解，进而得到了线性方程组Lx=b的极小范数最小二乘解快速算法，计算复杂度为O+O(n~2)，而一般方法的计算复杂度为O(mn~2)+O(n~3)。

A new fast algorithm of the minimal norm least squares solution for the linear system whose coefficient matrix is an m×n Loewner-type matrix with full column rank is given by forming a special block matrix and researching its triangular factorization.

通过构造特殊分块矩阵及其三角分解给出了求秩为n的m×n阶Loewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法，该算法的计算复杂度为O+O(n2)，而一般方法的计算复杂度为O(mn2)+O(n3)。

In Chapter three, by constructing a special partitioned matrix and studying the fast triangular factorization of its inverse matrix, we respectively give fast algorithms for the minimal norm least squares solutions of linear equations which coefficient matrices are n×m Toeplitz type matrices and Vandermonde-Loewner type matrices with full column rank.

第三章通过构造特殊分块矩阵并研究其逆矩阵的快速三角分解，分别给出了求以秩为m的n×m阶Toeplitz型矩阵和Vandermonde-Loewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法，并通过算例将新算法与已有的法方程组的方法和正交化方法作了比较。

In this paper, firstly the elimination tree theory is introduced in brief, and the structure of Jacobian matrix is determined by use of symbolic factorization; then by use of sparse vector method each column of lower triangular matrix L and each row of upper triangular matrix U are solved.

介绍了消去树理论，并采用符号因子分解技术确定雅可比矩阵的结构，然后采用稀疏向量法求取L阵的每行和U阵的每列。

It is based on the difficulty of computing the discrete logarithm modulo for a composite number and the factorization problem of large integer.The size of the group signature and verification time of the group signature are equivalent to that of an individual signature.

该方案的安全性是基于求离散对数和RSA大整数因式分解的困难，其群签名长度和群签名的验证时间只相当于一般个人签名。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。