2001
DOI: 10.1002/1097-0207(20010130)50:3<525::aid-nme34>3.0.co;2-4
|View full text |Cite
|
Sign up to set email alerts
|

Application of fast multipole Galerkin boundary integral equation method to elastostatic crack problems in 3D

Abstract: Fast multipole method (FMM) has been developed as a technique to reduce the computational cost and memory requirements in solving large-scale problems. This paper discusses an application of FMM to threedimensional boundary integral equation method for elastostatic crack problems. The boundary integral equation for many crack problems is discretized with FMM and Galerkin's method. The resulting algebraic equation is solved with generalized minimum residual method (GMRES). The numerical results show that FMM is… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
61
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 92 publications
(61 citation statements)
references
References 18 publications
0
61
0
Order By: Relevance
“…For these reasons many researchers tried to devise algorithms which were hybrids of tree codes and FMM, in order to combine the high accuracy of FMM methods with the simplicity of tree codes. In addition, the extension of the FMM to more general kernels like the modified Laplacian [13], the Stokes [10] , and the Navier [9,26] operators can be quite cumbersome, due to the need to implement efficient translation operators. In this paper, we only review algorithms that could be used to develop kernel independent methods.…”
Section: Synopsis Of the New Methodmentioning
confidence: 99%
“…For these reasons many researchers tried to devise algorithms which were hybrids of tree codes and FMM, in order to combine the high accuracy of FMM methods with the simplicity of tree codes. In addition, the extension of the FMM to more general kernels like the modified Laplacian [13], the Stokes [10] , and the Navier [9,26] operators can be quite cumbersome, due to the need to implement efficient translation operators. In this paper, we only review algorithms that could be used to develop kernel independent methods.…”
Section: Synopsis Of the New Methodmentioning
confidence: 99%
“…The boundaries of the model are discretized using boundary elements and the internal domain where local yielding is expected to occur are discretized using internal cells. Then an adaptive quad-tree structure is constructed [18,19,22,24]. The root of the tree, which is at level 0, is a square box containing all the boundaries elements and internal cells.…”
Section: Numerical Implementation Of the Fast Multipole Methodsmentioning
confidence: 99%
“…By the recursive operations on the tree structure which are described in detail in References [18][19][20][21][22][23][24][25], the multipole and local moments of all the boxes are calculated and the matrix-vector product is obtained. For a leaf, the multipole moments are obtained from all the elements in it using multipole expansions.…”
Section: Numerical Implementation Of the Fast Multipole Methodsmentioning
confidence: 99%
See 2 more Smart Citations