| Abstract: | This paper describes a new scheme to improve the efficiency of time‐domain BEM algorithms. The discussion is focused on the two‐dimensional elastodynamic formulation, however, the ideas presented apply equally to any step‐by‐step convolution based algorithm whose kernels decay with time increase. The algorithm presented interpolates the time‐domain matrices generated along the time‐stepping process, for time‐steps sufficiently far from the current time. Two interpolation procedures are considered here (a large number of alternative approaches is possible): Chebyshev–Lagrange polynomials and linear. A criterion to indicate the discrete time at which interpolation should start is proposed. Two numerical examples and conclusions are presented at the end of the paper. Copyright © 2004 John Wiley & Sons, Ltd. |
