On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
2
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.
这种方法以矩阵分解为工具，结合平衡点的渐近稳定判据，用分解矩阵的稳定性决定平衡点的全局渐近稳定性。
3
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.