• English
  • Deutsch
  • Log In
    Password Login
    or
  • Research Outputs
  • Projects
  • Researchers
  • Institutes
  • Statistics
Repository logo
Fraunhofer-Gesellschaft
  1. Home
  2. Fraunhofer-Gesellschaft
  3. Artikel
  4. Runtime optimization of a memory efficient CG solver for FFT-based homogenization: Implementation details and scaling results for linear elasticity
 
  • Details
  • Full
Options
2019
Journal Article
Titel

Runtime optimization of a memory efficient CG solver for FFT-based homogenization: Implementation details and scaling results for linear elasticity

Abstract
The memory efficient CG algorithm of Kabel et al. (Comput Mech 54(6):1497-1514, 2014) reduces the memory requirements of a strain based implementation of the CG algorithm following Zeman et al. (J Comput Phys 229(21):8065-8071, 2010) for solving the equations of linear elasticity by 40%. But since the Fourier wave vectors have to be recalculated at several steps of the memory efficient algorithm, the runtime increases for a straightforward implementation.. We explain how to reduce the runtime overhead to a negligible size, and show that the memory efficient algorithm scales better than the standard algorithm with up to 256 MPI processes.
Author(s)
Grimm-Strele, H.
Kabel, M.
Zeitschrift
Computational mechanics
Thumbnail Image
DOI
10.1007/s00466-019-01713-3
Externer Link
Externer Link
Language
English
google-scholar
Fraunhofer-Institut für Techno- und Wirtschaftsmathematik ITWM
  • Cookie settings
  • Imprint
  • Privacy policy
  • Api
  • Send Feedback
© 2022