A comparative study of algorithms for minimal cycle bases for efficient force method of frame analysis

作者：Kaveh A^*; Fazli H

来源：Communications in Numerical Methods in Engineering, 2007, 23(10): 921-943.

DOI：10.1002/snm.934

• force method
• flexibility matrix
• sparsity
• greedy algorithm
• minimal cycle basis
• graph theory

A comparative study of different algorithms is presented for the formation of minimal cycle bases of graphs corresponding to sparse cycle-member incidence matrices, leading to the formation of sparse flexibility matrices. These algorithms employ concepts from matroids and theory of graphs. The algorithms are compared using the computational time and storage requirements. Proof is constructed for the minimality of the algorithm developed by the first author, and an efficient approach is employed for its implementation. The algorithms are also compared through examples having different topological properties.

• 出版日期2007-10