๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimization approach for torsion analysis of prismatic bars

โœ Scribed by Meric, R. Alsan


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
152 KB
Volume
15
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

โœฆ Synopsis


Torsion analysis of prismatic bars has been treated by an optimization approach using the twist angle and the boundary values of the stress function as decision parameters. The sensitivity analysis of the objective function is performed by the adjoint variable method. Solution of the primary and adjoint problems are achieved by the ยฎnite element method. The minimizations of the objective functions are done using the BFGS variable metric method. After checking the numerical algorithm with exact solutions, several example problems are investigated by the present method of analysis.


๐Ÿ“œ SIMILAR VOLUMES


Model reduction for chemical kinetics: A
โœ Linda Petzold; Wenjie Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› American Institute of Chemical Engineers ๐ŸŒ English โš– 278 KB ๐Ÿ‘ 1 views

## Abstract The kinetics of a detailed chemically reacting system can potentially be very complex. Although the chemist may be interested in only a few species, the reaction model almost always involves a much larger number of species. Some of those species are radicals, which are very reactive spe

An optimization approach for stream func
โœ Meric, R. Alsan ;Cete, A. Ruhsen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 281 KB

Potential ยฏow problems around immersed bodies have been treated by an optimization approach. When the stream function is used as the ยฎeld variable, the boundary values may not be known a priori and may be taken as the decision parameters to minimize integral objective functionals. The circulation in

Probabilistic analysis of an asymptotica
โœ C.T. Ng; X. Cai; T.C.E. Cheng ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 135 KB ๐Ÿ‘ 2 views

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima