In the model algorithm, designing two types of computing matrix operations, using MATLAB software to solve the multi-objective optimization model solving complicated problems.
在模型求解算法方面，设计了两种作业类型的计算矩阵，利用MATLAB软件解决了多目标优化模型求解繁琐的难题。
The Matrix coding was visual and brief and characterized by parallel computing.
采用的矩阵编码方法直观、简单，具有并行性运算特性。
Through the adjacency matrix, computing networks, clustering coefficient. Clustering coefficient is a complex network, an important parameter.
通过邻接矩阵，计算网络的聚类系数。聚类系数是复杂网络中一个重要参量。
Method for computing the element restoring force, rather than the stiffness matrix, is the most important factor that determines the accuracy of a geometric nonlinear finite element problem.
几何非线性单元的精度主要决定于单元恢复力的计算方法，刚度矩阵对单元精度的影响很小。
Finally, we present an efficient algorithm for computing the minimal polynomial of a polynomial matrix. It determines the coefficient polynomials term by term from lower to higher degree.
最后，我们给出了一种计算多项式矩阵最小多项式或特征多项式的有效算法，它从低次项到高次项逐项确定最小多项式的系数多项式。
Both of attribute weight frequency and strong compressible set are used to simplify discernibility matrix so that computing complexity is decreased and reduction efficiency is.
同时利用属性加权频率和强等价集概念化简区分矩阵，既减小了计算复杂度又提高了约简效率。
Both of attribute weight frequency and strong compressible set are used to simplify discernibility matrix so that computing complexity is decreased and reduction efficiency is increased.
同时利用属性加权频率和强等价集概念化简区分矩阵，既减小了计算复杂度又提高了约简效率。
The problem of computing a few of the largest (or smallest) eigenvalues of a large sparse symmetric matrix is investigated.
研究了计算大型稀疏对称矩阵的若干个最大或最小特征值的问题。
For the discrete optimal fitting problem, we also give a solving method by matrix computing.
还对有限离散的谱系树最优拟合问题，给出一种利用矩阵运算的求解方法。
Compared to previous methods, this algorithm does not involve the problem of computing projection matrix of camera with all the points and its computing speed is faster.
与已有的加权迭代特征算法比较，该算法避免了所有点参与计算相机的投影矩阵，运算速度更快。
The L-D factorization was also applied into Kalman filter to avoid computing the inverse of matrix, so its stability and precision is improved.
把矩阵分析中的L -D分解算法运用到该算法中以避免计算矩阵的逆，从而改善了算法的稳定性和精度。
A transfer matrix method, suitable for computing the propagation of polarized light in anisotropic media, is described in detail in this paper.
给出了一种可用于计算偏振光在各向异性介质传播问题的传输矩阵方法。
The precise expression of the stiffness matrix and computing code is developed.
推出了精确的刚度矩阵显式，并编制了相应的计算程序。
The extended transfer matrix method is particularly fit for computing the steady state response of multibody system, and directly contributes to the analytic expression of steady state response.
扩展传递矩阵法特别适合于计算多体系统的稳态响应，能直接得到稳态响应的解析表达式。
A method for computing the gain matrix is given based on the modal coordinate equation.
在广义模态坐标的基础上讨论了增益矩阵的计算方法。
It defines illuminance matrix, average illuminance matrix and deviation illuminance matrix, and a method of computing illuminance based on illuminance matrix is explained.
定义了照度矩阵、平均照度矩阵、均差照度矩阵和参照度矩阵，并阐述了照度矩阵来计算照度的方法。
The results show that our method is practical and can solve the computing problem in the design of soft X-ray multiplayer mirrors when using matrix method.
结果表明，这种方法可以解决使用矩阵法设计软X射线多层膜反射镜中的数值计算问题。
It made the building of reference matrix simplify, matching the real time and accuracy demand of air defense combat, computing speed is fast.
该方法使基准矩阵的建立简化，符合防空作战的实时性、准确性要求，计算速度快。
In the fundamental operations of large scale matrice, computing speed of GPU can be 50 times faster than CPU on the suitable matrix blocking.
在基本的矩阵运算中，运用适当的矩阵分块，GPU的计算速度比CPU快50倍左右。
Using the characteristic of the circulant matrix, the computing procedure is simplified.
利用循环矩阵的性质，简化了数值求解过程。
If we use the equation of least square estimator directly, computing amount is often very great because course of computing need calculate the inverse of matrix and multiplication of matrix.
若直接采用最小二乘估计的公式，因计算过程需要求矩阵的逆及乘积，计算量非常大。
To assist you in understanding the three classifications of cloud computing, I created a cross-concept matrix for your reference (see Table 1).
为帮助您理解云计算的这三个类别，我创建了一个跨概念矩阵供您参考(参见表1)。
In order to compute the optimal weighting matrices, the formula of computing the cross-covariance matrix between local estimation errors is presented.
为了计算最优加权阵，提出了局部估计误差互协方差阵的计算公式。
The optimum knots ordinate formula in the least square sense is derived by computing coefficient matrix and curve vertexes under the specified subsection knots abscissas conditions.
在给定分段节点横坐标的条件下，通过确定系数矩阵和反求曲线顶点，基于最小二乘法推导出最优节点的纵坐标公式。
For this special multisensor system, distributed optimal fusion algorithm is received by avoiding computing correlated estimation covariance based on the matrix operation.
在这类特殊的多传感器系统中，本文通过矩阵运算消除相关估计方差，得到了最优分布式融合估计算法。
In this paper, the defects of modular 2dpca about computing the total scatter matrix of training samples and selecting eigenvectors are analyzed. An improved modular 2dpca algorithm is presented.
本文分析了模块2dpca在计算训练样本总体散布矩阵和本征向量选取方面的缺陷，提出了一种改进的模块2dpca算法。
A computing method of coefficient matrix is given. For a few special points including singular points, the numerical values of solid Angle of a cylindrical bottom surface open to these special points.
对包含奇异点在内的几个特殊点给出了柱底面对这些点所张立体角的值，并给出了电测井积分方程系数矩阵的计算方法。
Three methods of computing accessibility matrix from adjacency matrix are introduced in this paper.
介绍了由邻接矩阵求可达性矩阵的三个方法。
Then the sparse solution in frequency domain can be obtained through computing the weighted matrix equation.
然后求解这个加权矩阵方程，得到频率域的稀疏解。
Then the sparse solution in frequency domain can be obtained through computing the weighted matrix equation.
然后求解这个加权矩阵方程，得到频率域的稀疏解。
应用推荐