scholarly journals The stress state in an elastic body with a rigid inclusion of the shape of three segments broken line under the action of the harmonic oscillation of the longitudinal shift

Author(s):  
V. G. Popov ◽  
O. V. Lytvyn

There is a thin absolutely rigid inclusion that in a cross-section represents three segments broken line in an infinite elastic medium (matrix) that is in the conditions of antiplane strain. The inclusion is under the action of harmonic shear force Pe^{iwt} along the axis Oz. Under the conditions of the antiplane strain the only one different from 0 z-component of displacement vector W (x; y) satisfies the Helmholtz equation. The inclusion is fully couple with the matrix. The tangential stresses are discontinuous on the inclusion with unknown jumps. The method of the solution is based on the representation of displacement W (x; y) by discontinuous solutions of the Helmholtz equation. After the satisfaction of the conditions on the inclusion the system of integral equations relatively unknown jumps is obtained. One of the main results is a numerical method for solving the obtained system, which takes into account the singularity of the solution and is based on the use of the special quadrature formulas for singular integrals.

2019 ◽  
Vol 84 (3) ◽  
pp. 555-566
Author(s):  
Xu Wang ◽  
Liang Chen ◽  
Peter Schiavone

AbstractWe use conformal mapping techniques to solve the inverse problem concerned with an elastic non-elliptical harmonic inclusion in the vicinity of a rigid non-elliptical harmonic inclusion loaded by a couple when the surrounding matrix is subjected to remote uniform stresses. Both a size-independent complex loading parameter and a size-dependent real loading parameter are introduced as part of the solution procedure. The stress field inside the elastic inclusion is uniform and hydrostatic; the interfacial normal and tangential stresses as well as the hoop stress on the matrix side are uniform along each one of the two inclusion–matrix interfaces. The tangential stress along the interface of the elastic inclusion (free of external loading) vanishes, whereas that along the interface of the rigid inclusion (loaded by the couple) does not. A novel method is proposed to determine the area of the rigid inclusion.


2020 ◽  
Vol 46 (5) ◽  
Author(s):  
Fredrik Fryklund ◽  
Mary Catherine A. Kropinski ◽  
Anna-Karin Tornberg

Abstract Integral equation–based numerical methods are directly applicable to homogeneous elliptic PDEs and offer the ability to solve these with high accuracy and speed on complex domains. In this paper, such a method is extended to the heat equation with inhomogeneous source terms. First, the heat equation is discretised in time, then in each time step we solve a sequence of so-called modified Helmholtz equations with a parameter depending on the time step size. The modified Helmholtz equation is then split into two: a homogeneous part solved with a boundary integral method and a particular part, where the solution is obtained by evaluating a volume potential over the inhomogeneous source term over a simple domain. In this work, we introduce two components which are critical for the success of this approach: a method to efficiently compute a high-regularity extension of a function outside the domain where it is defined, and a special quadrature method to accurately evaluate singular and nearly singular integrals in the integral formulation of the modified Helmholtz equation for all time step sizes.


1995 ◽  
Vol 05 (02) ◽  
pp. 263-274 ◽  
Author(s):  
MARK A. STALZER

Presented is a parallel algorithm based on the fast multipole method (FMM) for the Helmholtz equation. This variant of the FMM is useful for computing radar cross sections and antenna radiation patterns. The FMM decomposes the impedance matrix into sparse components, reducing the operation count of the matrix-vector multiplication in iterative solvers to O(N3/2) (where N is the number of unknowns). The parallel algorithm divides the problem into groups and assigns the computation involved with each group to a processor node. Careful consideration is given to the communications costs. A time complexity analysis of the algorithm is presented and compared with empirical results from a Paragon XP/S running the lightweight Sandia/University of New Mexico operating system (SUNMOS). For a 90,000 unknown problem running on 60 nodes, the sparse representation fits in memory and the algorithm computes the matrix-vector product in 1.26 seconds. It sustains an aggregate rate of 1.4 Gflop/s. The corresponding dense matrix would occupy over 100 Gbytes and, assuming that I/O is free, would require on the order of 50 seconds to form the matrix-vector product.


Sign in / Sign up

Export Citation Format

Share Document