Abstract
A finite-strip geometric nonlinear analysis is presented for elastic problems involving folded-plate structures. Compared with the standard finite-element method, its main advantages are in data preparation, program complexity, and execution time. The finite-strip method, which satisfies the von Karman plate equations in the nonlinear elastic range, leads to the coupling of all harmonics. However, coupling of series terms dramatically increases computation time in existing
finite-strip sequential programs when a large number of series terms is used. The research reported in this paper combines various parallelization techniques and architectures (computing clusters and graphic processing units) with suitable programming models (MPI and CUDA) to speed up lengthy computations. In addition, a metric expressing the computational weight of input sets is presented. This metric allows computational complexity comparison of different inputs.
finite-strip sequential programs when a large number of series terms is used. The research reported in this paper combines various parallelization techniques and architectures (computing clusters and graphic processing units) with suitable programming models (MPI and CUDA) to speed up lengthy computations. In addition, a metric expressing the computational weight of input sets is presented. This metric allows computational complexity comparison of different inputs.
Original language | English |
---|---|
Pages (from-to) | 273-285 |
Number of pages | 13 |
Journal | Advances in Engineering Software |
Volume | 42 |
Issue number | 5 |
Early online date | 24 Nov 2010 |
DOIs | |
Publication status | Published - May 2011 |