On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
This method takes the matrix resolving as a tool, combined with criterion of progressive stability and determines the equilibrium point by stability of matrix resolving.
这种方法以矩阵分解为工具，结合平衡点的渐近稳定判据，用分解矩阵的稳定性决定平衡点的全局渐近稳定性。
The subdivision interpretation results by deconvolution are compared with those obtained by progressive substitution method, inverse matrix method and the commonly used average concentration method.
并将反褶积法的分层解释结果与逐次迭代法、逆矩阵法和平均含量法的解释结果作了对比。
Using combine field integral equation and progressive iterative numerical method, the size of method of moment system matrix that need to be inverted and the computational time can be greatly reduced.
目标被分成一些小区域，因此缩小了所需要求逆的矩阵的大小并且减少了计算时间。
Using combine field integral equation and progressive iterative numerical method, the size of method of moment system matrix that need to be inverted and the computational time can be greatly reduced.
目标被分成一些小区域，因此缩小了所需要求逆的矩阵的大小并且减少了计算时间。
应用推荐