We consider adaptive meshless discretisation of the Dirichlet problem for Poisson equation based on numerical differentiation stencils obtained with the help of radial basis functions. New meshless stencil selection and adaptive refinement algorithms are proposed in 2D. Numerical experiments show that the accuracy of the solution is comparable with, and often better than that achieved by the me...

A nonlinear formulation of the Meshless Local Petrov-Galerkin (MLPG) finite-volume mixed method is developed for the large deformation analysis of static and dynamic problems. In the present MLPG large deformation formulation, the velocity gradients are interpolated independently, to avoid the time consuming differentiations of the shape functions at all integration points. The nodal values of ...

In this study, a cellular automaton (CA) is developed o combine the advantages of finite element method (FEM) and meshless method to analyze two-dimensional elastic problems. By the CA, a two-dimensional domain is discretized into a grid of nodes which are distributed randomly in the domain. For convenience, the nodes are classified into the FEM group and the meshless group. In the FEM zone tha...

In this article, we analyze the fractional-step θ method for the time-dependent convectiondiffusion equation. In our implementation, we completely separate the convection operator from the diffusion operator, and stabilize the convective solve using a streamline upwinded PetrovGalerkin (SUPG) method. We establish a priori error estimates and show that optimal values of θ yield a scheme that is ...

In this paper, meshless methods and partition of unity based finite element methods are reviewed. In meshless methods, the approximation is built without the explicit connectivity information between the nodes; moving-least squares approximants and natural neighbor-based interpolants are discussed. The enrichment of the finite element approximation through the partition of unity framework is de...

The meshless method plays an important role in solving problems in computational mechanics where conventional computational methods are not well suited. In this paper, we examine the property of the kernel matrix and investigate the convergence and timing performance of some well-known Krylov subspace methods on solving linear systems from meshless discretizations.

The need for the processing of surface geometry represents an ubiquitous problem in computer graphics and related disciplines. It arises in numerous important applications such as computer-aided design, reverse engineering, rapid prototyping, medical imaging , cultural heritage acquisition and preservation, video gaming and the movie industry. Existing surface processing techniques predominantl...

In this paper we present a general framework for solving partial differential equations on manifolds represented by meshless points, i.e., point clouds, without parametrization or connection information. Our method is based on a local approximation of the manifold as well as functions defined on the manifold, such as using least squares, simultaneously in a local intrinsic coordinate system con...