scispace - formally typeset
Search or ask a question
Topic

Meshfree methods

About: Meshfree methods is a research topic. Over the lifetime, 2216 publications have been published within this topic receiving 69596 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: An efficient meshfree method based on Pascal polynomials and mutiple-scale approach for numerical solutions of two-dimensional and three-dimensional elliptic interface problems which may have discontinuous coefficients and curved interfaces with or without sharp corners is proposed.

14 citations

Journal ArticleDOI
TL;DR: The aim of this paper is to boost the effectiveness of the conventional reproducing kernel particle method (RKPM) in handling those types of constraints which specify the field variable and its gradient conveniently.

14 citations

Journal ArticleDOI
TL;DR: In this paper, a coupled finite element/mesh-free method is proposed to study the crashworthiness of railway vehicles, in which the leading vehicle of a high-speed train impacts to a rigid wall.
Abstract: The crashworthiness of a railway vehicle relates to its passive safety performance. Due to mesh distortion and difficulty in controlling the hourglass energy, conventional finite element methods face great challenges in crashworthiness simulation of large-scale complex railway vehicle models. Meshfree methods such as element-free Galerkin method offer an alternative approach to overcome those limitations but have proved time-consuming. In this article, a coupled finite element/meshfree method is proposed to study the crashworthiness of railway vehicles. A representative scenario, in which the leading vehicle of a high-speed train impacts to a rigid wall, is simulated with the coupled finite element/element-free Galerkin method in LS-DYNA. We have compared the conventional finite element method and the coupled finite element/element-free Galerkin method with the simulation results of different levels of discretization. Our work showed that coupled finite element/element-free Galerkin method is a suitable a...

14 citations

Journal ArticleDOI
TL;DR: A comprehensive survey on the recent developments, achievements, and future expectations of SPH and particle systems is provided, with a detailed description of the classification and methods used in the field.
Abstract: Particle techniques mainly deal with physically-based particle variations for phenomena and shapes in computer animation and geometric modeling. Typical particle techniques include smoothed particle hydrodynamics (SPH) simulation for animation and particle systems for shape modeling. SPH simulation and particle systems are meshfree methods and have been widely applied in engineering and applied sciences. Here, we provide a comprehensive survey on the recent developments, achievements, and future expectations of SPH and particle systems, with a detailed description of the classification and methods used in the field. Particularly, it has not only summarized the cutting-edge research of SPH methods and the particle systems, with a description of basic theories behind the particle system and method of the structuring mode for stimulating the irregular mode, but also proposed measures to improve the particle system. These applied methods mainly include the Lagrangian method, for simulating fluid phenomena, such as smoke, fire, explosion, wave, bubble, and free surface, which have been the focus of little attention in the past. Finally, future research directions and expectations are thoroughly discussed with the detail, acceleration, and control techniques used to meet the pressing real demand for real-time performance and flexibility.

14 citations

Journal ArticleDOI
TL;DR: A short overview of radial basis functions algorithms including thinning algorithm, greedy algorithm, arclength equipartition like algorithm and k-means clustering algorithm and a new adaptive data-dependent method are provided.
Abstract: Radial basis functions (RBF) provide powerful meshfree methods for multivariate interpolation for scattered data. RBF methods have been praised for their simplicity and ease of implementation in multivariate scattered data approximation. But both the approximation quality and stability depend on the distribution of the center set. It leads immediately to the problem of finding good or even optimal point sets for the reconstruction process. Many methods are constructed for center choosing. In this paper, we give a short overview of these algorithms including thinning algorithm, greedy algorithm, arclength equipartition like algorithm and k-means clustering algorithm. A new adaptive data-dependent method is provided at the end with some numerical examples to show its effectiveness.

14 citations


Network Information
Related Topics (5)
Finite element method
178.6K papers, 3M citations
89% related
Numerical analysis
52.2K papers, 1.2M citations
86% related
Discretization
53K papers, 1M citations
86% related
Boundary value problem
145.3K papers, 2.7M citations
82% related
Partial differential equation
70.8K papers, 1.6M citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202355
2022112
2021102
202092
201996
201897