SearcharxivSearch

arXiv · 1312.7016

Topology Optimization Using Polytopes

Abstract

Meshing complex engineering domains is a challenging task. Arbitrary polyhedral meshes can provide the much needed flexibility in automated discretization of such domains. The geometric property of the polyhedral meshes such as the unstructured nature and the facial connectivity between elements makes them specially attractive for topology optimization applications. Numerical anomalies in designs such as the single node connections and checkerboard pattern, which are difficult to manufacture physically, are naturally alleviated with polyhedrons. Special interpolants such as Wachspress, mean value coordinates, maximum entropy shape functions are available to handle arbitrary shaped elements. But the finite elements approaches based on these shape functions face some challenges such as accurate and efficient computation of the shape functions and their derivatives for the numerical evaluation of the weak form integrals. In the current work, we solve the governing three-dimensional elasticity state equation using a Virtual Element Method (VEM) approach. The main characteristic difference between VEM and standard finite element methods (FEM) is that in VEM the canonical basis functions are not constructed explicitly. Rather the stiffness matrix is computed directly utilizing a projection map which extracts the linear component of the deformation. Such a construction guarantees the satisfaction of the patch test (used by engineers as an indicator of optimal convergence of numerical solutions under mesh refinement). Finally, the computations reduce to the evaluation of matrices which contain purely geometric surface facet quantities. The present work focuses on the first-order VEM in which the degrees of freedom associated with the vertices. Utilizing polyhedral elements for topology optimization, we show that the mesh bias in the member orientation is alleviated.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arun L. Gain, Glaucio H. Paulino, Leonardo Duarte, Ivan F. M. Menezes. 2013-12-25. Topology Optimization Using Polytopes. https://doi.org/10.1016/j.cma.2015.05.007

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC