Finding minimum energy configurations for constrained beam buckling problems using the Viterbi algorithm

INTERNATIONAL JOURNAL OF SOLIDS AND STRUCTURES

卷:49

Article

Doraiswamy, Srikrishna¹  Narayanan, Krishna R.¹  Srinivasa, Arun R.¹ 

[1] Texas A&M Univ, College Stn, TX 77843 USA

关键词: Dynamic programming;    Viterbi algorithm;    Constrained beam buckling;    Range discretization;    Direct search;    Unilateral constraint;   

DOI  :  10.1016/j.ijsolstr.2011.10.003

来源: Elsevier

【 摘 要 】

In this work, we present a novel technique to find approximate minimum energy configurations for thin elastic bodies using an instance of dynamic programming called the Viterbi algorithm. This method can be used to find approximate solutions for large deformation constrained buckling problems as well as problems where the strain energy function is non-convex. The approach does not require any gradient computations and could be considered a direct search method. The key idea is to consider a discretized version of the set of all possible configurations and use a computationally efficient search technique to find the minimum energy configuration. We illustrate the application of this method to a laterally constrained beam buckling problem where the presence of unilateral constraints together with the non-convexity of the energy function poses challenges for conventional schemes. The method can also be used as a means for generating very good starting points for other conventional gradient search algorithms. These uses, along with comparisons with a direct application of a gradient search and simulated annealing, are demonstrated in this work. (C) 2011 Elsevier Ltd. All rights reserved.

【 授权许可】

Free