Quasi-trivial stacking sequences for the design of thick laminates

Résumé : Quasi-trivial (QT) sequences have largely proven to be an extremely powerful tool in the design and optimisation of composites laminates. In this paper new interesting properties of this class of stacks are derived. These properties allow to obtain QT sequences by superposing (according to some prescribed rules) any number of QT elementary stacks. In this way, QT solutions with arbitrary large number of plies can be readily obtained, overcoming the computational issues arising in the search of QT solutions with huge number of layers. Moreover, a general version of the combinatorial algorithm to find QT stacks is proposed in this work. It is also proven that the previous estimation of the number of QT solutions, for a given number of plies and saturated groups, is not correct because a larger number of solutions has been found in this study.
Document type :
Journal articles
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02354468
Contributor : Compte de Service Administrateur Ensam <>
Submitted on : Thursday, November 7, 2019 - 5:19:04 PM
Last modification on : Sunday, November 10, 2019 - 1:22:25 AM

File

I2M_CS_2018_MONTEMURRO.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02354468, version 1

Collections

Citation

Torquato Garulli, Anita Catapano, Marco Montemurro, Julien Jumel, Daniele Fanteria. Quasi-trivial stacking sequences for the design of thick laminates. Composite Structures, Elsevier, 2018, 200, pp.614-623. ⟨hal-02354468⟩

Share

Metrics

Record views

5

Files downloads

5