A fast and accurate algorithm for a Galerkin boundary integral method

J. Wang, S. L. Crouch, S. G. Mogilevskaya

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)96-109
Number of pages14
JournalComputational Mechanics
Volume37
Issue number1
DOIs
StatePublished - Dec 2005

Keywords

  • Asymptotic expansion
  • Circular inhomogeneity
  • Fast multipole algorithm
  • Galerkin boundary integral method
  • Orthogonal function
  • Straight crack
  • Taylor series expansion
  • Tree data structure

Fingerprint Dive into the research topics of 'A fast and accurate algorithm for a Galerkin boundary integral method'. Together they form a unique fingerprint.

  • Cite this