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
相关论文
共 50 条
  • [1] COMPARISON OF TWO PROXIMAL SPLITTING ALGORITHMS FOR SOLVING MULTILABEL DISPARITY ESTIMATION PROBLEMS
    Hiltunen, Sonja
    Pesquet, Jean-Christophe
    Pesquet-Popescu, Beatrice
    2012 PROCEEDINGS OF THE 20TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), 2012, : 1134 - 1138
  • [2] A Comparison of Algorithms for Solving Multicomponent Optimization Problems
    Vieira, D. K. S.
    Mendes, M. H. S.
    IEEE LATIN AMERICA TRANSACTIONS, 2017, 15 (08) : 1474 - 1479
  • [3] Two algorithms for solving systems of inclusion problems
    Diaz Millan, R.
    NUMERICAL ALGORITHMS, 2018, 78 (04) : 1111 - 1127
  • [4] Two algorithms for solving systems of inclusion problems
    R. Díaz Millán
    Numerical Algorithms, 2018, 78 : 1111 - 1127
  • [5] A fast iterative boundary element method for solving closed crack problems
    Dept. of Civ. and Environ. Eng., Massachusetts Inst. Technol., PO B., Cambridge, MA 02139, United States
    Eng. Fract. Mech., 5 (631-648):
  • [6] A fast iterative boundary element method for solving closed crack problems
    Elvin, N
    Leung, C
    ENGINEERING FRACTURE MECHANICS, 1999, 63 (05) : 631 - 648
  • [7] Discrete Algorithms for Solving Two Continuous Problems of Random
    Reznik A.L.
    Tuzikov A.V.
    Soloviev A.A.
    Torgov A.V.
    Optoelectronics, Instrumentation and Data Processing, 2018, 54 (5) : 427 - 433
  • [8] Two hybrid algorithms for solving split equilibrium problems
    Dang Van Hieu
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2018, 95 (03) : 561 - 583
  • [9] Comparison of Swarm and Graph Algorithms for Solving Travelling Salesman Problems
    Eggenschwiler, Stefan
    Spahic-Bogdanovic, Maja
    Hanne, Thomas
    Dornberger, Rolf
    2020 7TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING & MACHINE INTELLIGENCE (ISCMI 2020), 2020, : 1 - 7
  • [10] A comparison of two search algorithms for solving the channel assignment problem
    Kim, MJ
    Ryu, KH
    ICUPC '96 - 1996 5TH IEEE INTERNATIONAL CONFERENCE ON UNIVERSAL PERSONAL COMMUNICATIONS RECORD, VOLS 1 AND 2, 1996, : 681 - 685
12345