A comparison of two algorithms for solving closed crack problems

被引：9
|
作者：
DeBremaecker, JC
Ferris, MC
机构：
[1] Rice Univ, Dept Geol & Geophys, Houston, TX 77251 USA
[2] Univ Wisconsin, Dept Comp Sci, Madison, WI 53706 USA
来源：
ENGINEERING FRACTURE MECHANICS | 2000年 / 66卷 / 06期
关键词：
compressional fractures; contact problems; closed cracks;
D O I：
10.1016/S0013-7944(00)00034-5
中图分类号：
O3 [力学];
学科分类号：
08 ; 0801 ;
摘要：
Interface (or joint) elements introduce errors in the computation of the Stress Intensity Factor, and uncertainties in the definition of the 'slipping' and 'stuck' regions in some fracture problems. The PATH algorithm is free of these disadvantages and displays the maximum error in the results; in a test case it required about 30% more machine time than the fast aigorithm of Elvin and Leung. (C) 2000 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：601 / 605
页数：5
相关论文
共 35 条
1234