Surkay D. Akbarov^1,2, Arzu Turan³

CMC-Computers, Materials & Continua, Vol.24, No.3, pp. 257-270, 2011, DOI:10.3970/cmc.2011.024.257

Abstract The influence of the initial finite stretching or compressing of the strip containing a single crack on the Energy Release Rate (ERR) and on the SIF of mode I at the crack tips is studied by the use of the Three-Dimensional Linearized Theory of Elasticity. It is assumed that the edges of the crack are parallel to the face planes of the strip and the ends of the strip are simply supported. The initial finite strain state arises by the uniformly distributed normal forces acting at the ends of the strip. The additional normal forces act on the edges of… More >

Chia-Cheng Tsai ¹

CMC-Computers, Materials & Continua, Vol.22, No.3, pp. 197-218, 2011, DOI:10.3970/cmc.2011.022.197

Abstract This paper describes the combination of the method of fundamental solutions (MFS) and the dual reciprocity method (DRM) as a meshless numerical method to solve problems of Kirchhoff plates under arbitrary loadings. In the solution procedure, a arbitrary distributed loading is first approximated by either the multiquadrics (MQ) or the augmented polyharmonic splines (APS), which are constructed by splines and monomials. The particular solutions of multiquadrics, splines and monomials are all derived analytically and explicitly. Then, the complementary solutions are solved formally by the MFS. Furthermore, the boundary conditions of lateral displacement, slope, normal moment, and effective shear force are… More >

T. Tsangaris¹, Y.–S. Smyrlis^{1, 2}, A. Karageorghis^{1, 2}

CMC-Computers, Materials & Continua, Vol.1, No.3, pp. 245-258, 2004, DOI:10.3970/cmc.2004.001.245

Abstract The Method of Fundamental Solutions (MFS) is a boundary-type method for the solution of certain elliptic boundary value problems. In this work, we develop an efficient matrix decomposition MFS algorithm for the solution of biharmonic problems in annular domains. The circulant structure of the matrices involved in the MFS discretization is exploited by using Fast Fourier Transforms. The algorithm is tested numerically on several examples. More >