Abstract

► The use of hybrid discretizations (HD) for three-dimensional IDA is proposed. ► This technique combines different modelling approaches within a single simulation. ► HD are integrated with parallelized computations and domain decomposition techniques. ► Kinematic constraints are used to enforce the transition between structural models. ► This technique is tested for accuracy and performance, revealing encouraging results. This paper presents a new approach to perform incremental dynamic analyses on reinforced concrete buildings using the so-called hybrid discretizations , taking advantage of parallelized computations and domain decomposition techniques to enhance the capability and performance for the analysis of large-scale problems. The concept of hybrid discretization consists in the combination of different modelling approaches for the three-dimensional structural elements. Where most of the non-linear phenomena are expected to occur, refined meshes and more complex constitutive relations are adopted. Elsewhere, simplified structural models are considered. Special attention is devoted to the definition of adequate techniques to treat the transition zones between different structural models. The efficiency and accuracy of alternative kinematic constraint techniques are studied and assessed. The paper ends with two validation examples that test the accuracy and the computational performance of the proposed methodology.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.