کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
7196265 1468308 2018 27 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A computationally efficient approach to modeling contact problems and fracture closure using superposition method
ترجمه فارسی عنوان
رویکرد محاسباتی کارآمد برای مدل سازی مشکلات تماس و بستن شکستگی با استفاده از روش غربالگری
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی مکانیک
چکیده انگلیسی
The shape of fractures in an elastic medium under different stress distributions have been well studied in the literature, however, the fracture closure process during unloading has not been investigated thoroughly. The fracture surface is normally assumed to be perfectly smooth so that only the width and stress intensity at the fracture tip are critical in the analysis. In reality, the creation of a fracture in a rock seldom produces smooth surfaces and the resulting asperities on the fracture surfaces can impact fracture closure. Correctly modeling this fracture closure behavior has numerous applications in structural engineering and earth sciences. In this article, we present an approach to model fracture closure behavior in a 2D and 3D elastic media. The fracture surface displacements under arbitrary normal load are derived using superposition method. The contact stress, deformation, and fracture volume evolution are estimated in a computationally efficient manner for various fracture surface properties. When compared with the traditional integral transform methods used to model fracture closure, the superposition method presented in this study produces comparable results with significant less computation time. In addition, with the aid of parallel computation, large scale fracture closure and contact problems can be successfully simulated using our proposed dynamic fracture closure model (DFCM) with very modest computation times.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical and Applied Fracture Mechanics - Volume 93, February 2018, Pages 276-287
نویسندگان
, , ,