Abstract

The finite point method (FPM) is a meshless technique, which is based on both, a weighted least‐squares numerical approximation on local clouds of points and a collocation technique which allows obtaining the discrete system of equations. The research work we present is part of a broader investigation into the capabilities of the FPM to deal with 3D applications concerning real compressible fluid flow problems. In the first part of this work, the upwind‐biased scheme employed for solving the flow equations is described. Secondly, with the aim of exploiting the meshless capabilities, an h‐adaptive methodology for 2D and 3D compressible flow calculations is developed. This adaptive technique applies a solution‐based indicator in order to identify local clouds where new points should be inserted in or existing points could be safely removed from the computational domain. The flow solver and the adaptive procedure have been evaluated and the results are encouraging. Several numerical examples are provided in order to illustrate the good performance of the numerical methods presented. 

Abstract

In this work, the finite point method is applied to the solution of high‐Reynolds compressible viscous flows. The aim is to explore this important field of applications focusing on two main aspects: the easiness and automation of the meshless discretization of viscous layers and the construction of a robust numerical approximation in the highly stretched clouds of points resulting in such domain areas. The flow solution scheme adopts an upwind‐biased scheme to solve the averaged Navier–Stokes equations in conjunction with an algebraic turbulence model. The numerical applications presented involve different attached boundary layer flows and are intended to show the performance of the numerical technique. The results obtained are satisfactory and indicative of the possibilities to extend the present meshless technique to more complex flow problems.

Abstract

Abstract

In this work, a hierarchical variant of a boundary element method and its use in Stokes flow around three-dimensional rigid bodies in steady regime is presented. The proposal is based on the descending hierarchical low-order and self-adaptive algorithm of Barnes-Hut, and it is used in conjunction with an indirect boundary integral formulation of second class, whose source term is a function of the undisturbed velocity. The solution field is the double layer surface density, which is modified in order to complete the eigenvalue spectrum of the integral operator. In this way, the rigid modes are eliminated and both a non-zero force and a non-null torque on the body could be calculated. The elements are low order flat triangles, and an iterative solution by generalized minimal residual (GMRES) is used. Numerical examples include cases with analytical solutions, bodies with edges and vertices, or with intricate shapes. The main advantage of the presented technique is the possibility of considering a greater number of degrees of freedom regarding traditional collocation methods, due to the decreased demand of main memory and the reduction in the computation times.

Abstract

In this article the behavior of a shape function based on the maximum entropy principle (maxent) is analyzed in a meshless collocation method, compared with a traditional fixed weighted least square shape function (FWLS). The maxent shape function used in this work has certain properties that are desired in a meshless collocation method, for example the positivity, the smooth and uniform aspect for different discretizations. Further, in the boundary, the approximation not depends of the shape function of the interior nodes, this property is know as a reduction of the shape function on the boundary. To compare this type of function, it was developed examples that include the solution of eliptical second order equations in 1D and 2D. The numerical results shown a better behavior of the maxent shape function compared with the FWLS, particularly in terms of the convergence and stability of the meshless collocations method that result.

Abstract

In this paper we propose a new mesh-less method based on a sub-domain collocation approach. By reducing the size of the sub-domains the method becomes similar to the well-known finite point method (FPM) and thus it can be regarded as the generalized form of finite point method (GFPM). However, unlike the FPM, the equilibrium equations are weakly satisfied on the sub-domains. It is shown that the accuracy of the results is dependent on the sizes of the sub-domains. To find an optimal size for a sub-domain we propose a patch test procedure in which a set of polynomials of higher order than those chosen for the approximations/interpolations are used as the exact solution and a suitable error norm is minimized through a size tuning procedure. In this paper we have employed the GFPM in elasto-static problems. We give the results of the size optimization in a series of tables for further use. Also the results of the integrations on a generic sub-domain are given as a series of library functions for those who want to use GFPM as a cheap and fast integral-based mesh-less method. The performance of GFPM has been demonstrated by solving several sample problems.