On reducing computational effort in topology optimization: how far can we go?
From MaRDI portal
Publication:381614
DOI10.1007/s00158-010-0586-7zbMath1274.74306OpenAlexW2032232628MaRDI QIDQ381614
Publication date: 15 November 2013
Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00158-010-0586-7
Related Items
Nonlinear reanalysis for structural modifications based on residual increment approximations ⋮ Topology optimization using polytopes ⋮ A new interpolation technique to deal with fluid-porous media interfaces for topology optimization of heat transfer ⋮ Efficient generation of large-scale Pareto-optimal topologies ⋮ Multi-objective concurrent topology optimization of thermoelastic structures composed of homogeneous porous material ⋮ Robust topology optimization accounting for spatially varying manufacturing errors ⋮ Optimal design of shell-graded-infill structures by a hybrid MMC-MMV approach ⋮ Revisiting element removal for density-based structural topology optimization with reintroduction by Heaviside projection ⋮ Efficient reanalysis techniques for robust topology optimization ⋮ A method using successive iteration of analysis and design for large-scale topology optimization considering eigenfrequencies ⋮ Reanalysis Method for Second Derivatives of Static Displacement
Cites Work
- Unnamed Item
- Efficient use of iterative solvers in nested topology optimization
- The block conjugate gradient algorithm and related methods
- Filters in topology optimization
- Reduced basis approximations of structural displacements for optimaldesign
- Approximate reanalysis in topology optimization
- Large-scale topology optimization using preconditioned Krylov subspace methods with recycling
- The method of moving asymptotes—a new method for structural optimization
- Accurate reanalysis of structures by a preconditioned conjugate gradient method
- Topology optimization of nonlinear elastic structures and compliant mechanisms
