期刊
COMPUTATIONAL MATERIALS SCIENCE
卷 24, 期 3, 页码 343-360出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0927-0256(01)00256-7
关键词
-
An efficient algorithm for finding primitive rings in a topological network has been developed. The calculation of complete ring statistics, with virtually no upper limit on ring size, becomes feasible for very large network systems. The computing time and memory usage are vastly reduced by utilizing the primitive ring properties and a four-point directing method. Various ring definitions are also discussed and analyzed in detail. Finally, examples are provided for analyzing alkali-rich regions in silicate glasses using ring statistics up to 33-membered primitive rings, obtained by this algorithm. (C) 2001 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据