Premium
The key‐group method
Author(s) -
Yarahmadi Bafghi A. R.,
Verdel T.
Publication year - 2003
Publication title -
international journal for numerical and analytical methods in geomechanics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.419
H-Index - 91
eISSN - 1096-9853
pISSN - 0363-9061
DOI - 10.1002/nag.283
Subject(s) - key (lock) , block (permutation group theory) , group (periodic table) , computer science , extension (predicate logic) , element (criminal law) , stability (learning theory) , algorithm , mathematics , computer security , chemistry , machine learning , programming language , geometry , organic chemistry , political science , law
This paper proposes an extension to the key‐block method, called ‘key‐group method’, that considers not only individual key blocks but also groups of collapsable blocks into an iterative and progressive analysis of the stability of discontinuous rock slopes. The basics of the key‐block method are recalled herein and then used to prove how key groups can be identified. We reveal that a key group must contain at least one basic key block, yet this condition is not entirely sufficient. The second block candidate for grouping must be another key block or a block whose movement‐preventing faces are common to one or more single key blocks. We also show that the proposed method yields more realistic results than the basic key‐block method and a comparison with results obtained using a distinct element analysis demonstrates the ability of this new method. Copyright © 2003 John Wiley & Sons, Ltd.