Please use this identifier to cite or link to this item:
http://repositorio.lnec.pt:8080/jspui/handle/123456789/1012173
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lemos, J. V. | pt_BR |
dc.date.accessioned | 2019-11-29T15:19:30Z | pt_BR |
dc.date.accessioned | 2019-12-05T10:30:23Z | - |
dc.date.available | 2019-11-29T15:19:30Z | pt_BR |
dc.date.available | 2019-12-05T10:30:23Z | - |
dc.date.issued | 2017 | pt_BR |
dc.identifier.uri | https://repositorio.lnec.pt/jspui/handle/123456789/1012173 | - |
dc.description.abstract | Abstract: Rigid block models are widely used in the analysis of masonry structures, as they provide a sound and efficient approximation of the observed behaviour, namely for modelling collapse modes that do not involve the internal failure of the units. The options available for the numerical representation of contact in rigid block models are discussed, in particular the well-known point contact approaches. The accuracy of the various options is compared for static and dynamical test problems involving bending of columns and walls. Proposals are made concerning the level of contact discretisation, namely the number of contacts and weight rules, required for a good model performance. | pt_BR |
dc.language.iso | eng | pt_BR |
dc.publisher | Inderscience Enterprises Ltd. | pt_BR |
dc.rights | restrictedAccess | pt_BR |
dc.subject | DEM | pt_BR |
dc.subject | Masonry | pt_BR |
dc.title | Contact representation in rigid block models of masonry | pt_BR |
dc.type | workingPaper | pt_BR |
dc.description.volume | Vol. 2, No. 4, 2017 | pt_BR |
dc.description.sector | DBB/NMMR | pt_BR |
dc.description.magazine | Int. J. Masonry Research and Innovation | pt_BR |
dc.contributor.peer-reviewed | SIM | pt_BR |
dc.contributor.academicresearchers | NAO | pt_BR |
dc.contributor.arquivo | NAO | pt_BR |
Appears in Collections: | DBB/NMMR - Comunicações a congressos e artigos de revista |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.