通过对GPS直接观测量的关联矩阵进行分析,提出了一种生成GPS最小双差集的有效算法,并编制了相应的程序通过算例进行验证。
On the analysis of observed connection matrix, this paper proposes an efficient algorithm of generating the minimum sets of GPS double differences together with a demonstrating example.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
本文基于矩阵变换算法提出了一种在计算机上生成多种复杂纹理的新方法。
In this paper, the authors present a new method of generating textures based on matrix transformation.
应用推荐