点击次数：

论文类型：会议论文

发表时间：2008-09-07

收录刊物：EI

页面范围：1077-1082

摘要：Aiming to modify the initial blank or unfold the final shape, a Constrained Static Implicit Algorithm (CSIA) based on one-step inverse finite element method is proposed. CSIA considers the process of modifying or unfolding to be a constrained optimization problem and uses the limited memory algorithm for constrained optimization (L-BFGS-B[1,2]) to solve it. The advantages of CSIA represent its little EMS memory occupied and relatively higher computational efficiency and precision. What is more important, due to the use of the algorithm L-BFGS-B, which can solve larger constrained problems, we can make sure that the shape and quality of the initial blank can be greatly improved under the precondition of keeping any specified part on the blank unchanged. This is just implemented by setting simple constraints on the variables of the objective function for the constrained optimization problem. It means that CSIA can provide much more convenience for designers during their design process. Some applications to modifying the initial blank with overlap elements and unfolding the final shape with constraints are also presented in order to validate the efficiency and reliability of CSIA.