Mathematics – Numerical Analysis
Scientific paper
2010-09-25
Mathematics
Numerical Analysis
adaptive mesh refinement, topology optimization, iterative solvers
Scientific paper
We present an improved method for topology optimization with both adaptive mesh refinement and derefinement. Since the total volume fraction in topology optimization is usually modest, after a few initial iterations the domain of computation is largely void. Hence, it is inefficient to have many small elements, in such regions, that contribute significantly to the overall computational cost but contribute little to the accuracy of computation and design. At the same time, we want high spatial resolution for accurate three-dimensional designs to avoid postprocessing or interpretation as much as possible. Dynamic adaptive mesh refinement (AMR) offers the possibility to balance these two requirements. We discuss requirements on AMR for topology optimization and the algorithmic features to implement them. The numerical design problems demonstrate (1) that our AMR strategy for topology optimization leads to designs that are equivalent to optimal designs on uniform meshes, (2) how AMR strategies that do not satisfy the postulated requirements may lead to suboptimal designs, and (3) that our AMR strategy significantly reduces the time to compute optimal designs.
Paulino Glaucio H.
Sturler Eric de
Wang Shun
No associations
LandOfFree
Dynamic Adaptive Mesh Refinement for Topology Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dynamic Adaptive Mesh Refinement for Topology Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Adaptive Mesh Refinement for Topology Optimization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-695729