Efficient stress‐constrained topology optimization using inexact design sensitivities
Oded Amir
Abstract
Abstract An efficient computational approach to stress‐constrained topology optimization is presented. Using a multigrid‐preconditioned Krylov solver for the state and adjoint problems, the number of Krylov iterations is reduced significantly by enforcing early termination of the iterative solves. The criterion for early termination is based on the convergence of the design sensitivities with respect to Krylov iterations. Consequently, the progress of optimization is not affected by the inexact resolution of the state and adjoint problems. The proposed approach is demonstrated on several design problems that possess different characteristics of the maximum stress. Optimization results obtained with early termination show very good agreement with those obtained with an accurate direct solver—in terms of objective value, constrained maximum stress and overall number of design cycles. Savings of 80% in the number of Krylov iterations are achieved, compared to the number of iterations required to satisfy the force residual convergence criterion to a common tolerance. The approach is directly applicable to high‐resolution problems that are solved on parallel computational environments. A MATLAB code for reproducing the results is freely available at https://github.com/odedamir/topopt‐stress‐inexact‐sensitivities