1996
DOI: 10.1007/bf00033829
|View full text |Cite
|
Sign up to set email alerts
|

A boundary element method for two dimensional linear elastic fracture analysis

Abstract: A boundary element method is developed for the analysis of fractures in two-dimensional solids. The solids are assumed to be linearly elastic and isotropic, and both bounded and unbounded domains are treated. The development of the boundary integral equations exploits (as usual) S omigliana's identity, but a special manipulation is carried out to 'regularize' certain integrals associated with the crack line. The resulting integral equations consist of the conventional ordinary boundary terms and two additional… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
43
0
2

Year Published

1996
1996
2019
2019

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 67 publications
(47 citation statements)
references
References 14 publications
0
43
0
2
Order By: Relevance
“…In [20], the geometric interpolation along the crack line is piecewise linear; the crack line geometry over the (j+1)th element is approximated by …”
Section: Theorymentioning
confidence: 99%
“…In [20], the geometric interpolation along the crack line is piecewise linear; the crack line geometry over the (j+1)th element is approximated by …”
Section: Theorymentioning
confidence: 99%
“…Bonnet and Bui [1993], Crouch and Selcuk [1992], Cruse [1988], Chang and Mear [1995], Gray, Martha, and Ingraffea [1990], Guimardes and Telles [1994], Hong and Chen [1988], and Paulino [1995]. Although successful, the common problem for these methods is that, when employed in conjunction with a collocation approximation, a C' continuous smoothness constraint is necessarily imposed on the boundary in the neighborhood of the integration point.…”
Section: Boundary Elements and Fracture Mechanicsmentioning
confidence: 99%
“…The typical algorithm presented falls into either of two categories: moderately accurate algorithms based on singular integral equations, and approximate algorithms based on singular integral equations. The moderately accurate algorithms often can not handle more than a few cracks or inclusions, see, for example, Chen (1997), Wang and Chau (1997), Pan (1997), Xueli and Tzuchiang (1996a), and Chang and Mear (1995). Approximate algorithms can handle more cracks, but at the cost of low accuracy, especially when cracks are close to each other, see, for example, Freij-Ayoub, Dyskin, and Galybin (1997), and Brencich and Carpinteri (1996).…”
Section: Introductionmentioning
confidence: 99%