Cycle based of graphs for sparse flexibility matrices

摘要

An efficient algorithm is presented for the formation of cycle bases of graphs corresponding to sparse cyclemember incidence matrices, leading to the formation of highly sparse flexibility matrices. The algorithm presented employs a new expansion process and uses an efficient graph-theoretical method for controlling the independence of the selected cycles.