Please use this identifier to cite or link to this item:
https://repository.cihe.edu.hk/jspui/handle/cihe/3290
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Leung, Andrew Yee Tak | en_US |
dc.date.accessioned | 2022-05-23T03:33:55Z | - |
dc.date.available | 2022-05-23T03:33:55Z | - |
dc.date.issued | 1986 | - |
dc.identifier.uri | https://repository.cihe.edu.hk/jspui/handle/cihe/3290 | - |
dc.description.abstract | An exact sparse solution algorithm specially designed for triangular block decomposition by microcomputer is presented. The algorithm is useful in multistory building frame analysis. It requires to store only the nonzero elements of the coupling stiffness between adjacent floors and minimizes unnecessary operations on zero elements. less data are needed to transfer between core and disk and less core memory is required when compared to conventional methods. Computer listing of the subroutines and numerical examples are given. A driver program is also illustrated. | en_US |
dc.language.iso | en | en_US |
dc.publisher | John Wiley & Sons | en_US |
dc.relation.ispartof | Microcomputers in Civil Engineering | en_US |
dc.title | A sparse solution algorithm with applications to building frames | en_US |
dc.type | journal article | en_US |
dc.identifier.doi | 10.1111/j.1467-8667.1986.tb00128.x | - |
dc.contributor.affiliation | School of Computing and Information Sciences | en_US |
dc.relation.issn | 2162-6316 | en_US |
dc.description.volume | 1 | en_US |
dc.description.issue | 3 | en_US |
dc.description.startpage | 187 | en_US |
dc.description.endpage | 195 | en_US |
dc.cihe.affiliated | No | - |
item.languageiso639-1 | en | - |
item.fulltext | No Fulltext | - |
item.openairetype | journal article | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Yam Pak Charitable Foundation School of Computing and Information Sciences | - |
Appears in Collections: | CIS Publication |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.