We present results from an efficient algorithm for simulating systems of locally connected elements that are subject to uniformly increasing stresses and that discharge when these stresses reach some threshold. Previously, large-scale simulations of such systems have been hindered by the very-time-consuming search for those elements that are going to discharge next. We avoid this by using a suitable data structure, reducing computer CPU times by several orders of magnitude in typical cases. In particular, we present simulations for a simple version of the Burridge-Knopoff model introduced by Olami, Feder, and Christensen [Phys. Rev. Lett. 68, 1244 (1992)]. Due to the substantially larger lattices and longer simulation times presently used, we find that the conclusions of these authors have to be modified considerably.

• Received 6 April 1993

DOI:https://doi.org/10.1103/PhysRevE.49.2436