Shape optimization using adaptive shape refinement
β Scribed by H. S. Kohli; G. F. Carey
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 901 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
A large part of the computational effort in shape optimization problems is expended in the numerical computation of the gradients for sensitivity information. This effort increases dramatically with an increase in the number of variables used to represent the shape. An adaptation of the gradient projection algorithm for shape optimization problems is described here along with a method to reduce the intermediate size of the optimization problem by allowing adaptive refinement of the shape. The method is demonstrated with a simple representative test case.
π SIMILAR VOLUMES
This article is a sequel of [J.-A. De Β΄side Β΄ri, Hierarchical optimum-shape algorithms using embedded Be Β΄zier parameterizations, in: Y. Kuznetsov et al., (Ed.), Numerical Methods for Scientific Computing, Variational Problems and Applications, CIMNE, Barcelona, 2003], in which we defined formally a
The adaptive-passive vibration absorber shows promise for combining the stability and low complexity of passive tuned absorbers with the robust performance of active vibration control schemes. Previous adaptive tuned vibration absorbers (ATVA) had been complex and bulky. Shape memory alloys (SMA), w