【摘要】 本文提出用有向树求解线性网络系统的新的拓扑方法。在所构造的图上找到所有的有向树便给出线性方程组的解,而不需要求有向2树。本文提供的方法用于求符号网络函数,也可用于数值计算,具有精度高和节省存贮的优点。它特别适宜于大型稀疏方程组的求解。更多还原

【Abstract】 A new topological technique of solving a set of linear network equ-ations is presented.Finding all of the directed trees in a constructedgraph yields solutions of the linear equations without the need of2-directed trees.The method proposed here can be used in symbolicnetwork functions and numerical analysis.It exhibits high-accuracyand memory-saving,and it is particularly applicable to arbitrary largesparse equations.The key ideas involved in this paper are more general becauseLemmas 1 and 2 are independent of associations of a matrix.Nomatter what graph associated with the matrix,similar technique couldbe applied.To this end.see reference[3]for details更多还原