Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A branch and bound algorithm for evaluation of the Findley fatigue criterion
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.ORCID iD: 0000-0002-0748-2853
2015 (English)In: International Journal of Fatigue, ISSN 0142-1123, E-ISSN 1879-3452, Vol. 73, 27-38 p.Article in journal (Refereed) Published
Abstract [en]

In this manuscript, a new algorithm for evaluation of the Findley fatigue criterion is proposed. The algorithm uses a branch and bound technique to limit the number of investigated planes in the search for the critical one. The algorithm has two major advantages over currently existing methods. Firstly, for a given tolerance on the error of the evaluation, it needs to investigate fewer planes on average, thereby reducing the execution time compared to state of the art methods. Secondly, the algorithm is guaranteed to give results within a tolerance of the global maximum, and this tolerance may be freely chosen by the analyst.

Place, publisher, year, edition, pages
2015. Vol. 73, 27-38 p.
Keyword [en]
Critical plane, Multiaxial fatigue, Mathematical analysis, Global optimization
National Category
Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-161086DOI: 10.1016/j.ijfatigue.2014.11.008ISI: 000349272300003Scopus ID: 2-s2.0-84916896494OAI: oai:DiVA.org:kth-161086DiVA: diva2:797969
Funder
Swedish Research Council, 2010-4172
Note

QC 20150325

Available from: 2015-03-25 Created: 2015-03-09 Last updated: 2017-12-04Bibliographically approved
In thesis
1. Topology Optimization of Fatigue-Constrained Structures
Open this publication in new window or tab >>Topology Optimization of Fatigue-Constrained Structures
2015 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

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.

 

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2015. xii, 39 p.
Series
TRITA-MAT-A, 2015:04
Keyword
topology optimization, fatigue constraints, stress constraints, density filters, restriction methods, weakest link theory, critical plane criteria
National Category
Mathematics
Research subject
Mathematics
Identifiers
urn:nbn:se:kth:diva-163575 (URN)978-91-7595-509-4 (ISBN)
Public defence
2015-05-22, F3, Lindstedtsvägen 26, Kungl Tekniska Högskolan, Stockholm, 14:00
Opponent
Supervisors
Funder
Swedish Research Council, 2010-4172
Note

QC 20150504

Available from: 2015-05-04 Created: 2015-04-08 Last updated: 2015-05-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Svärd, Henrik

Search in DiVA

By author/editor
Svärd, Henrik
By organisation
Optimization and Systems Theory
In the same journal
International Journal of Fatigue
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 72 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf