Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/58584
DC FieldValue
dc.titleOptimal pretensioned forces for cable networks
dc.contributor.authorSwaddiwudhipong, S.
dc.contributor.authorWang, C.M.
dc.contributor.authorLiew, K.M.
dc.contributor.authorLee, S.L.
dc.date.accessioned2014-06-17T05:16:07Z
dc.date.available2014-06-17T05:16:07Z
dc.date.issued1989
dc.identifier.citationSwaddiwudhipong, S.,Wang, C.M.,Liew, K.M.,Lee, S.L. (1989). Optimal pretensioned forces for cable networks. Computers and Structures 33 (6) : 1349-1354. ScholarBank@NUS Repository.
dc.identifier.issn00457949
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/58584
dc.description.abstractA computer software package for the static and dynamic analyses of cable networks has been developed. The algorithm involves the Newton-Raphson method and Newmark's α-method. The former iterative method takes care of the problem's nonlinearity, and the latter handles the time-marching scheme. In addition, an optimization subroutine based on the Neider and Mead Simplex method has been incorporated into the software to enable designers to determine the optimal design values of pretensioned forces leading to a stiffer cable network. The accuracy and convergence of the software were tested on some well-documented cable networks. Their optimal values of pretensioned forces for certain specified sets of loadings were also established. © 1989.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentCIVIL ENGINEERING
dc.contributor.departmentMECHANICAL & PRODUCTION ENGINEERING
dc.description.sourcetitleComputers and Structures
dc.description.volume33
dc.description.issue6
dc.description.page1349-1354
dc.description.codenCMSTC
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.