Advertisement

On reducing computational effort in topology optimization: how far can we go?

  • Oded Amir
  • Ole Sigmund
Brief Note

Abstract

An approximate approach to solving the nested analysis equations in topology optimization is proposed. The procedure consists of only one matrix factorization for the whole design process and a small number of iterative corrections for each design cycle. The approach is tested on 3D topology optimization problems. It is shown that the computational cost can be reduced by one order of magnitude without affecting the outcome of the optimization process.

Keywords

Topology optimization Nested approach Approximations 

Notes

Acknowledgements

This work received support from the Eurohorcs/ ESF European Young Investigator Award (EURYI, www.esf.org/euryi) through the grant “Synthesis and topology optimization of optomechanical systems”. We wish to thank the reviewers for their valuable comments and contributions to the discussion section. We are also grateful to Krister Svanberg for allowing us to use the MMA code.

References

  1. Amir O, Bendsøe MP, Sigmund O (2009) Approximate reanalysis in topology optimization. Int J Numer Methods Eng 78:1474-1491zbMATHCrossRefGoogle Scholar
  2. Amir O, Stolpe M, Sigmund O (2010) Efficient use of iterative solvers in nested topology optimization. Struct Multidiscipl Optim 42:55-72CrossRefGoogle Scholar
  3. Bendsøe MP, Sigmund O (2003) Topology optimization-theory, methods and applications. Springer, BerlinGoogle Scholar
  4. Bourdin B (2001) Filters in topology optimization. Int J Numer Methods Eng 50:2143-2158MathSciNetzbMATHCrossRefGoogle Scholar
  5. Bruns TE, Tortorelli DA (2001) Topology optimization of non-linear elastic structures and compliant mechanisms. Comput Methods Appl Mech Eng 190:3443-3459zbMATHCrossRefGoogle Scholar
  6. Golub GH, Van Loan CF (1983) Matrix computations. The Johns Hopkins University Press, Baltimore, MarylandzbMATHGoogle Scholar
  7. Kirsch U (1991) Reduced basis approximations of structural displacements for optimal design. AIAA J 29:1751-1758zbMATHCrossRefGoogle Scholar
  8. Kirsch U, Kocvara M, Zowe J (2002) Accurate reanalysis of structures by a preconditioned conjugate gradient method. Int J Numer Methods Eng 55:233-251zbMATHCrossRefGoogle Scholar
  9. O’Leary DP (1980) The block conjugate gradient algorithm and related methods. Linear Algebra Appl 29:293-322MathSciNetzbMATHCrossRefGoogle Scholar
  10. Svanberg K (1987) The method of moving asymptotes-a new method for structural optimization. Int J Numer Methods Eng 24:359-373MathSciNetzbMATHCrossRefGoogle Scholar
  11. Wang S, de Sturler E, Paulino GH (2007) Large-scale topology optimization using preconditioned Krylov subspace methods with recycling. Int J Numer Methods Eng 69:2441-2468zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.Department of MathematicsTechnical University of DenmarkLyngbyDenmark
  2. 2.Department of Mechanical EngineeringTechnical University of DenmarkLyngbyDenmark

Personalised recommendations