Fatigue, or failure of material due to repeated cyclic loading, is one of the most common causes of mechanical failures. The risk of fatigue in a load carrying component is often lowered by adding material, thereby reducing stresses. This increases the component weight, reducing the performance of the component and increasing its manufacturing cost. There is thus a need to design components to be as light as possible, while keeping the risk of fatigue at a low enough level, i.e. there is a need for optimization of the component subject to fatigue constraints. This thesis deals with design against fatigue using topology optimization, which is a form of structural optimization where an optimal design is sought by using mathematical programming to decide which parts of a design domain should be filled with material, and which should not. To predict fatigue, accurate representation of the geometry and accurate stress computation are of utmost importance. In this thesis, methods for imposing constraints such as minimum inner radii and minimum member sizes in the form of four new density filters are proposed. The filters are able to generate a very sharp representation of the structural boundary. A method for improving the accuracy of stress results at the structural boundary is also proposed, based on extrapolation of results from the interior of the structure. The method gives more accurate stresses, which affects the resulting structures when solving optimization problems. A formulation for fatigue constraints in topology optimization is proposed, based on the weakest link integral. The formulation avoids the problem of choosing between accurate but costly local constraints, and efficient but approximate aggregated constraints, and gives a theoretical motivation for using expressions similar to the p-norm of stresses. For verifying calculations of the fatigue probability of an optimized structure, critical plane criteria are commonly used. A new method for evaluating such criteria using optimization methods is proposed, and is proved to give results within a user given error tolerance. It is shown that compared to existing brute force methods, the proposed method evaluates significantly fewer planes in the search of the critical one. / <p>QC 20150504</p>
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-163575 |
| Date | January 2015 |
| Creators | Svärd, Henrik |
| Publisher | KTH, Optimeringslära och systemteori, Stockholm |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Doctoral thesis, comprehensive summary, info:eu-repo/semantics/doctoralThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | TRITA-MAT-A ; 2015:04 |
Page generated in 0.0021 seconds