Search arXivSearch

arXiv · 1909.10607

Adaptive level set topology optimization using hierarchical B-splines

Abstract

This paper presents an adaptive discretization strategy for level set topology optimization of structures based on hierarchical B-splines. This work focuses on the influence of the discretization approach and the adaptation strategy on the optimization results and computational cost. The geometry of the design is represented implicitly by the iso-contour of a level set function. An immersed boundary technique, here the extended finite element method, is used to predict the structural response. Both the level set function and the state variable fields are discretized by hierarchical B-splines. While only first-order B-splines are used for the state variable fields, up to third order B-splines are considered for discretizing the level set function. The discretizations of the level set function and the state variable fields are locally refined along the material interfaces and selectively coarsened within the bulk phases. For locally refined/coarsened meshes, truncated B-splines are considered. The properties of the proposed mesh adaptation strategy are studied for level set topology optimization where either the initial design is comprised of a uniform array of inclusions or inclusions are generated during the optimization process. Numerical studies employing static linear elastic material/void problems in 2D and 3D demonstrate the ability of the proposed method to start from a coarse mesh and converge to designs with complex geometries and fine features, reducing the overall computational cost. Comparing optimization results for different B-spline orders suggests that higher order basis functions promote the development of smooth designs and suppress the emergence of small features, without providing an explicit feature size control. A distinct advantage of cubic over quadratic B-splines is not observed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L. Noel, M. Schmidt, C. Messe, J. A. Evans, K. Maute. 2019-09-23. Adaptive level set topology optimization using hierarchical B-splines. https://arxiv.org/abs/1909.10607

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA