×

The vectorization expressions of Taylor series multipole-BEM for 3D elasticity problems. (English) Zbl 1162.74484

Summary: The Taylor Series Multipole Boundary Element Method (TSMBEM) can improve the computational efficiency of Boundary Element Methods (BEM) efficiently, which only requires \(O(N)\) computational costs (operations and memory) for a problem with \(N\) unknowns. But the Taylor expansions of fundamental solutions are generally expressed using tensor form in the literatures about TSMBEM. Although these kinds of formulations are easy to program, many repetitious operations are executed and many equivalent terms are saved, it will result in the waste of memory. It is presented that the vectorization expressions of Taylor series multipole boundary element formula for elasticity problems, which take account of the symmetric properties of fundamental solutions and the characteristic of 3D components. The vectorization formulations reduce the computational operations and storage required, and improve the computational efficiency. The validity and efficiency of proposed scheme are demonstrated by the numerical experiments.

MSC:

74S15 Boundary element methods applied to problems in solid mechanics
74B05 Classical linear elasticity

Software:

Riegeom
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Popov V, Power H (2001) An O(N) Taylor series multipole boundary element method for three-dimensional elasticity problems. Eng Anal Bound Elem 25: 7–18 · Zbl 0994.74080
[2] Popov V, Power H (2002) Two multipole alternatives based on Taylor series expansions for 3D BEM elasticity formulation. In: Boundary Elements XXIV. WIT Press, Southampton, pp 313–326 · Zbl 1086.74524
[3] Linbin Z, Zhenhan Y (2005) Fast multipole BEM for 3-D elastostatic problems with applications for thin structures. Tsinghua Sci Technol 10: 67–75 · Zbl 1105.74047
[4] Yang C, Duraiswami R, Gumerov N, Davis L (2003) Improved fast Gauss transform and efficient kernel density estimation. In: Proceedings of the Ninth IEEE International Conference on Computer Vision, pp 464–471
[5] Yang C, Duraiswami R, Davis L (2004) Efficient kernel machines using the improved Fast Gauss Transform. Vol.17, pp.1561–1568, http://books.nips.cc/papers/files/nips17/NIPS2004_0439.pdf
[6] Makino K, Berz M (1996) Remainder differential algebras and their applications. In: Computational Differentiation: Techniques, Applications, and Tools, pp 63–75 · Zbl 0867.68062
[7] Raykar, V. C., Yang, C., Duraiswami R, Gumerov N (2005) Fast computation of sums of Gaussians in high dimensions. Tech. Rep. CS-TR-4767, Department of Computer Science, University of Maryland, CollegePark. https://drum.umd.edu/dspace/bitstream/1903/3020/1/CS-TR-4767.pdf
[8] Jiao S, Zheng-zhong W, Kun C (2006) Application of laconic notations in formula derivation and calculation of components in tensor analysis. Eng Mech 10: 45–48
[9] Portugal R (1998) An algorithm to simplify tensor expressions. Comput Phys Commun 115: 215–230 · Zbl 1009.53013
[10] Portugal R (1999) Algorithmic simplification of tensor expressions. J Phys A Math Gen 32: 7779–7789 · Zbl 0963.53005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.