FEA is one of the most widely used mesh-based methods for solving PDEs in engineering. FEA uses a mesh or grid to divide the domain into small elements, such as triangles or tetrahedra, and approximates the solution within each element by a polynomial function. The solution at each node is obtained by solving a system of linear or nonlinear equations that result from applying the variational or weak form of the PDE. FEA has many advantages, such as its versatility, robustness, and accuracy, but it also has some limitations, such as its dependence on the quality of the mesh, its difficulty in handling discontinuities, and its high computational cost for large problems.
Meshfree methods can overcome some of these limitations by using a more flexible and adaptive node distribution and basis function selection. However, meshfree methods also have some challenges, such as their lack of convergence and stability guarantees, their difficulty in enforcing boundary conditions, and their high computational cost for large numbers of nodes. Therefore, meshfree methods are not a replacement for FEA, but rather a complement or an alternative for some specific problems or applications.