Abstract
This paper presents some optimizations of a fast multipole symmetric Galerkin boundary element method code. Except general optimizations, the code is specially sped up for crack propagation problems. Existing useful computational results are saved and re-used during the propagation. Some time-consuming phases of the code are accelerated by a shared memory parallelization. A new sparse matrix method is designed based on coordinate format and compressed sparse row format to limit the memory required during the matrix construction phase. The remarkable performance of the new code is shown through many simulations including large-scale problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
