Trefftz Displacement Potential Function Method for Solving Elastic Half-Space Problems
نویسندگان
چکیده
منابع مشابه
Indirect Trefftz Method for Solving Cauchy Problem of Linear Piezoelectricity
In this chapter, the indirect Trefftz collocation method is applied to solve the inverse Cauchy problem of linear piezoelectricity. The static analysis of coupled fields in 2D piezoelectric solids is considered. The piezoelectric material is modelled as a homogenous, linear elastic, linear dielectric and transversal isotropic. The T-functions are obtained by the Stroh formalism. The inverse Cau...
متن کاملThe Modified Collocation Trefftz Method and Laplacian Decomposition for Solving Two-dimensional Stokes Problems
In this paper, the two-dimensional Stokes problem is analyzed by the modified collocation Trefftz method (MCTM) and the Laplacian decomposition. The coupled Stokes equations are converted to three Laplace equations by utilizing the Laplacian decomposition and then the boundary-type meshless MCTM is adopted to solve the resultant Laplace equations. The MCTM, free from mesh and numerical quadratu...
متن کاملReproducing Kernel Space Hilbert Method for Solving Generalized Burgers Equation
In this paper, we present a new method for solving Reproducing Kernel Space (RKS) theory, and iterative algorithm for solving Generalized Burgers Equation (GBE) is presented. The analytical solution is shown in a series in a RKS, and the approximate solution u(x,t) is constructed by truncating the series. The convergence of u(x,t) to the analytical solution is also proved.
متن کاملMODIFIED K-STEP METHOD FOR SOLVING FUZZY INITIAL VALUE PROBLEMS
We are concerned with the development of a K−step method for the numerical solution of fuzzy initial value problems. Convergence and stability of the method are also proved in detail. Moreover, a specific method of order 4 is found. The numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Civil Engineering and Architecture
سال: 2021
ISSN: 2332-1091,2332-1121
DOI: 10.13189/cea.2021.090301