Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

A discrete adjoint based level set topology optimization method for stress constraints

Kambampati, Sandilya, Chung, Hayoung and Kim, H. Alicia 2021. A discrete adjoint based level set topology optimization method for stress constraints. Computer Methods in Applied Mechanics and Engineering 377 , 113563. 10.1016/j.cma.2020.113563

Full text not available from this repository.

Abstract

This paper proposes a new methodology for computing boundary sensitivities in level set topology optimization using the discrete adjoint method. The adjoint equations are constructed using the discretized governing field equations. The objective function is differentiated with respect to the boundary point movement for computing boundary sensitivities using the discrete adjoint equations. For this purpose, we present a novel approach where we perturb the boundary implicitly by locally modifying the level set function around a given boundary point. These local perturbations are combined with the derivatives of the objective function with respect to the volume fractions of individual elements to compute boundary sensitivities. This enables the circumvention of smoothing or interpolation methods typically used in level set topology optimization to compute sensitivities; and improves the accuracy of the sensitivities and the convergence characteristics. We demonstrate the effectiveness of our method in the context of stress minimization and stress constrained topology optimization problems for orthogonal bracket design under multiple load cases.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Engineering
Publisher: Elsevier
ISSN: 0045-7825
Date of Acceptance: 8 November 2020
Last Modified: 19 Apr 2021 12:38
URI: https://orca.cardiff.ac.uk/id/eprint/139340

Citation Data

Cited 5 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item