Parallelization Of Shape Sensitivity Analysis Codes On Clusters Of Workstations
Price
Free (open access)
Transaction
Volume
14
Pages
8
Published
1995
Size
817 kb
Paper DOI
10.2495/OP950311
Copyright
WIT Press
Author(s)
E. Schaeidt, M. Ojanguren, A. Longo & J.J. Anza
Abstract
Parallelization of shape sensitivity analysis codes on clusters of workstations E. Schaeidt,* M. Ojanguren,* A. Longo,* JJ. Anza^ "Mechanics and CAD/CAM Department, LABEIN, Technological Research Centre, Cuesta de Olabeaga 16, 48013 Bilbao, Spain ^Applied Mathematics Department, ETSIIIT, Alameda de Urquijo s/n, 48013 Bilbao, Spain \ Introduction The parallelization of shape sensitivity analysis codes is motivated by the need of solving an associated analysis problem for each of the design variables, when using a direct method, in order to compute the derivatives of the state variable with respect to the design variables. Two different situations may appear: the most favourable one in terms of time consuming is when the factorized matrix from the original analysis is kept on disk and reused for the sensitivity analysis. In this case, the time required for the sensitivity analysis is short compared to the one required for the original analysis. The most unfavourable situati
Keywords