Premium
Combinatorial Methods for the Formation of Sparse Flexibility Matrices
Author(s) -
Kaveh A.,
Roosta G. R.
Publication year - 1997
Publication title -
computer‐aided civil and infrastructure engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.773
H-Index - 82
eISSN - 1467-8667
pISSN - 1093-9687
DOI - 10.1111/0885-9507.00059
Subject(s) - flexibility (engineering) , computer science , sparse matrix , greedy algorithm , algorithm , graph , theoretical computer science , mathematical optimization , mathematics , chemistry , computational chemistry , statistics , gaussian
Two algorithms are designed for the formation of cycle bases of the graph models of rigid–jointed skeletal structures leading to sparse flexibility matrices. These combinatorial methods employ the Greedy Algorithm for the formation of suboptimal cycle bases with the least possible lengths.