Abstract

Design optimization of large structures can be attempted through a substructure strategy. In this strategy, the structure is divided into smaller substructures that are clustered to obtain a sequence of subproblems. Solution to the large problem is obtained iteratively through repeated solutions to the modest subproblems. Substructure strategies, in sequential and parallel computational environments on a Cray-YMP computer, have been implemented in a design test bed CometBoards. The issues encountered during substructure solution and their resolution are discussed under (1) coupling and constraint formulation, (2) differences in optimal solutions, and (3) amount of computation. Coupling between subproblems and separating constraints into local and global sets promote convergence of the iterative process. The substructure strategy can converge to different local optimal designs with equal minimum weight. Substructure optimization can be computation-intensive. However, in a parallel computational mode, it can effectively use assigned processors.

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.