Algorithmic aspects of isogeometric shape optimization

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Shape optimization is concerned about finding optimal designs under the aspect of some cost criteria often involving the solution of a partial differential equation (PDE) over the afore said unknown shape. In general, industrial cases involve a geometric model from Computer Aided Design (CAD). However, solving PDEs requires an analysis suitable working model, typically a Finite Element (FEM) triangulation. Hence, some of the geometric properties known from the CAD model may be lost during this format change. Therefore, we employ isogeometric analysis (IGA) instead, which has a tighter connection between geometry, simulation and shape optimization. In this paper, we present a self-contained treatment of gradient based shape optimization method with isogeometric analysis, focusing on algorithmic and practical aspects like computation of shape gradients in an IGA formulation and updating B-spline and NURBS geometries.

Cite

CITATION STYLE

APA

Fußeder, D., & Simeon, B. (2015). Algorithmic aspects of isogeometric shape optimization. In Lecture Notes in Computational Science and Engineering (Vol. 107, pp. 183–207). Springer Verlag. https://doi.org/10.1007/978-3-319-23315-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free