TY - JOUR
T1 - A fast and accurate algorithm for a Galerkin boundary integral method
AU - Wang, J.
AU - Crouch, S. L.
AU - Mogilevskaya, S. G.
PY - 2005/12
Y1 - 2005/12
N2 - A fast and accurate algorithm is presented to increase the computational efficiency of a Galerkin boundary integral method for solving two-dimensional elastostatics problems involving numerous straight cracks and circular inhomogeneities. The efficiency is improved by computing the combined influences of groups, or blocks, of elements-with each element being an inclusion, a hole, or a crack-using asymptotic expansions, multiple shifts, and Taylor series expansions. The coefficients in the asymptotic and Taylor series expansions are computed analytically. Implementation of this algorithm involves a single- or multi-level grid, a clustering technique, and a tree data structure. An iterative procedure is adopted to solve the coefficients in the series expansions of boundary unknowns block by block. The elastic fields in each block are calculated by superposition of the direct influences from the nearby elements and the grouped far-field influences from all the other elements. This fast multipole algorithm is considerably more efficient for large-scale practical problems than the conventional approach.
AB - A fast and accurate algorithm is presented to increase the computational efficiency of a Galerkin boundary integral method for solving two-dimensional elastostatics problems involving numerous straight cracks and circular inhomogeneities. The efficiency is improved by computing the combined influences of groups, or blocks, of elements-with each element being an inclusion, a hole, or a crack-using asymptotic expansions, multiple shifts, and Taylor series expansions. The coefficients in the asymptotic and Taylor series expansions are computed analytically. Implementation of this algorithm involves a single- or multi-level grid, a clustering technique, and a tree data structure. An iterative procedure is adopted to solve the coefficients in the series expansions of boundary unknowns block by block. The elastic fields in each block are calculated by superposition of the direct influences from the nearby elements and the grouped far-field influences from all the other elements. This fast multipole algorithm is considerably more efficient for large-scale practical problems than the conventional approach.
KW - Asymptotic expansion
KW - Circular inhomogeneity
KW - Fast multipole algorithm
KW - Galerkin boundary integral method
KW - Orthogonal function
KW - Straight crack
KW - Taylor series expansion
KW - Tree data structure
UR - http://www.scopus.com/inward/record.url?scp=27244452869&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27244452869&partnerID=8YFLogxK
U2 - 10.1007/s00466-005-0702-5
DO - 10.1007/s00466-005-0702-5
M3 - Article
AN - SCOPUS:27244452869
SN - 0178-7675
VL - 37
SP - 96
EP - 109
JO - Computational Mechanics
JF - Computational Mechanics
IS - 1
ER -