Level-set topology optimization with many linear buckling constraints using an efficient and robust eigensolver

Peter D. Dunning, Evgueni Ovtchinnikov, Jennifer Scott, H. Alicia Kim

Research output: Contribution to journalArticle

17 Citations (Scopus)
11 Downloads (Pure)

Abstract

Linear buckling constraints are important in structural topology optimization for obtaining designs that can support the required loads without failure. During the optimization process, the critical buckling eigenmode can change; this poses a challenge to gradient-based optimization and can require the computation of a large number of linear buckling eigenmodes. This is potentially both computationally difficult to achieve and prohibitively expensive. In this paper, we motivate the need for a large number of linear buckling modes and show how several features of the block Jacobi conjugate gradient (BJCG) eigenvalue method, including optimal shift estimates, the reuse of eigenvectors, adaptive eigenvector tolerances and multiple shifts, can be used to efficiently and robustly compute a large number of buckling eigenmodes. This paper also introduces linear buckling constraints for level-set topology optimization. In our approach, the velocity function is defined as a weighted sum of the shape sensitivities for the objective and constraint functions. The weights are found by solving an optimization sub-problem to reduce the mass while maintaining feasibility of the buckling constraints. The effectiveness of this approach in combination with the BJCG method is demonstrated using a 3D optimization problem. Copyright © 2016 John Wiley & Sons, Ltd.
Original languageEnglish
Pages (from-to)1029-1053
Number of pages25
JournalInternational Journal for Numerical Methods in Engineering
Volume107
Issue number12
Early online date5 Feb 2016
DOIs
Publication statusPublished - 21 Sep 2016

Fingerprint

Topology Optimization
Shape optimization
Buckling
Level Set
Eigenvalues and eigenfunctions
Jacobi
Eigenvector
Shape Sensitivity
Conjugate gradient method
Optimization
Structural optimization
Structural Optimization
Conjugate Gradient
Conjugate Gradient Method
Process Optimization
Weighted Sums
Reuse
Tolerance
Gradient
Optimization Problem

Keywords

  • topology optimization
  • buckling constraints
  • level-set method
  • block conjugate gradient eigensolver
  • sparse direct linear solver

Cite this

Level-set topology optimization with many linear buckling constraints using an efficient and robust eigensolver. / Dunning, Peter D.; Ovtchinnikov, Evgueni; Scott, Jennifer; Kim, H. Alicia.

In: International Journal for Numerical Methods in Engineering, Vol. 107, No. 12, 21.09.2016, p. 1029-1053.

Research output: Contribution to journalArticle

@article{fd112390e1fd4c56acab64c7a4e5e392,
title = "Level-set topology optimization with many linear buckling constraints using an efficient and robust eigensolver",
abstract = "Linear buckling constraints are important in structural topology optimization for obtaining designs that can support the required loads without failure. During the optimization process, the critical buckling eigenmode can change; this poses a challenge to gradient-based optimization and can require the computation of a large number of linear buckling eigenmodes. This is potentially both computationally difficult to achieve and prohibitively expensive. In this paper, we motivate the need for a large number of linear buckling modes and show how several features of the block Jacobi conjugate gradient (BJCG) eigenvalue method, including optimal shift estimates, the reuse of eigenvectors, adaptive eigenvector tolerances and multiple shifts, can be used to efficiently and robustly compute a large number of buckling eigenmodes. This paper also introduces linear buckling constraints for level-set topology optimization. In our approach, the velocity function is defined as a weighted sum of the shape sensitivities for the objective and constraint functions. The weights are found by solving an optimization sub-problem to reduce the mass while maintaining feasibility of the buckling constraints. The effectiveness of this approach in combination with the BJCG method is demonstrated using a 3D optimization problem. Copyright {\circledC} 2016 John Wiley & Sons, Ltd.",
keywords = "topology optimization, buckling constraints, level-set method, block conjugate gradient eigensolver, sparse direct linear solver",
author = "Dunning, {Peter D.} and Evgueni Ovtchinnikov and Jennifer Scott and Kim, {H. Alicia}",
note = "Funded by: the Engineering and Physical Sciences Research Council. Grant Number: EP/M002322/1 and EP/J010553/1",
year = "2016",
month = "9",
day = "21",
doi = "10.1002/nme.5203",
language = "English",
volume = "107",
pages = "1029--1053",
journal = "International Journal for Numerical Methods in Engineering",
issn = "0029-5981",
publisher = "John Wiley and Sons Ltd",
number = "12",

}

TY - JOUR

T1 - Level-set topology optimization with many linear buckling constraints using an efficient and robust eigensolver

AU - Dunning, Peter D.

AU - Ovtchinnikov, Evgueni

AU - Scott, Jennifer

AU - Kim, H. Alicia

N1 - Funded by: the Engineering and Physical Sciences Research Council. Grant Number: EP/M002322/1 and EP/J010553/1

PY - 2016/9/21

Y1 - 2016/9/21

N2 - Linear buckling constraints are important in structural topology optimization for obtaining designs that can support the required loads without failure. During the optimization process, the critical buckling eigenmode can change; this poses a challenge to gradient-based optimization and can require the computation of a large number of linear buckling eigenmodes. This is potentially both computationally difficult to achieve and prohibitively expensive. In this paper, we motivate the need for a large number of linear buckling modes and show how several features of the block Jacobi conjugate gradient (BJCG) eigenvalue method, including optimal shift estimates, the reuse of eigenvectors, adaptive eigenvector tolerances and multiple shifts, can be used to efficiently and robustly compute a large number of buckling eigenmodes. This paper also introduces linear buckling constraints for level-set topology optimization. In our approach, the velocity function is defined as a weighted sum of the shape sensitivities for the objective and constraint functions. The weights are found by solving an optimization sub-problem to reduce the mass while maintaining feasibility of the buckling constraints. The effectiveness of this approach in combination with the BJCG method is demonstrated using a 3D optimization problem. Copyright © 2016 John Wiley & Sons, Ltd.

AB - Linear buckling constraints are important in structural topology optimization for obtaining designs that can support the required loads without failure. During the optimization process, the critical buckling eigenmode can change; this poses a challenge to gradient-based optimization and can require the computation of a large number of linear buckling eigenmodes. This is potentially both computationally difficult to achieve and prohibitively expensive. In this paper, we motivate the need for a large number of linear buckling modes and show how several features of the block Jacobi conjugate gradient (BJCG) eigenvalue method, including optimal shift estimates, the reuse of eigenvectors, adaptive eigenvector tolerances and multiple shifts, can be used to efficiently and robustly compute a large number of buckling eigenmodes. This paper also introduces linear buckling constraints for level-set topology optimization. In our approach, the velocity function is defined as a weighted sum of the shape sensitivities for the objective and constraint functions. The weights are found by solving an optimization sub-problem to reduce the mass while maintaining feasibility of the buckling constraints. The effectiveness of this approach in combination with the BJCG method is demonstrated using a 3D optimization problem. Copyright © 2016 John Wiley & Sons, Ltd.

KW - topology optimization

KW - buckling constraints

KW - level-set method

KW - block conjugate gradient eigensolver

KW - sparse direct linear solver

U2 - 10.1002/nme.5203

DO - 10.1002/nme.5203

M3 - Article

VL - 107

SP - 1029

EP - 1053

JO - International Journal for Numerical Methods in Engineering

JF - International Journal for Numerical Methods in Engineering

SN - 0029-5981

IS - 12

ER -