Abstract
We present a fast and memory-efficient algorithm for transient space–time-domain elastodynamic boundary-integral analysis. Associated data-sparse approximations and operations are named fast domain partitioning hierarchical matrices (FDP=H-matrices). The fast domain partitioning method (the FDPM) solves a known problem of hierarchical matrices (H-matrices) in compressing discretized elastodynamic kernel functions. A novel set of plane-wave approximations unites the FDPM and H-matrices in an accurate analytic manner. Memory usage is O(NlogN) and computation time O(NMlogN) in our algorithm for a single run with N boundary elements and M time steps. Consequent cost reduction is remarkable, considering the O(N2M) memory usage and O(N2M2) computational time to run the orthodox time-marching implementation. Numerical experiments verify FDP=H-matrices realize O(NM/logN) times smaller memory and computation time with ensuring the accuracy of integral analyses.
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.
