A stochastic element-free Galerkin method was developed for reliability analysis of linear-elastic structures with spatially varying random material properties. A random ®eld representing material properties was discretized into a set of random variables with statistical properties obtained from the statistical properties of random ®eld. In conjunction with meshless formulations, the ®rst-order...

A particular meshless method, named meshless local Petrov–Galerkin is investigated. To treat the essential boundary condition problem, an alternative approach is proposed. The basic idea is to merge the best features of two different methods of shape function generation: the moving least squares (MLS) and the radial basis functions with polynomial terms (RBFp). Whereas the MLS has lower computa...

boundary integral equations (bie) are reformulations of boundary value problems for partial differential equations. there is a plethora of research on numerical methods for all types of these equations such as solving by discretization which includes numerical integration. in this paper, the neumann problem is reformulated to a bie, and then moving least squares as a meshless method is describe...

Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with point cloud data directly, any processing is based on the given raw data and its underlying geometry rather than any arbitrary intermediate representations and generally artificial connectivity relations. In this paper, ...

This is the first in a series of two papers generated from a study on probabilistic meshless analysis of cracks. In this paper (Part I), a Galerkin-based meshless method is presented for predicting first-order derivatives of stress-intensity factors with respect to the crack size in a linear-elastic structure containing a single crack. The method involves meshless discretization of cracked stru...

Keywords: ADI leapfrog method Meshless methods Smoothed particle electromagnetics a b s t r a c t Grid based methods coupled with an explicit approach for the evolution in time are traditionally adopted in solving PDEs in computational electromagnetics. The discretiza-tion in space with a grid covering the problem domain and a stability step size restriction, must be accepted. Evidence is given...

We consider numerical solutions of second-order elliptic partial di erential equations, such as Laplace's equation, or linear elasticity, in two-dimensional, non-convex domains by the element-free Galerkin method (EFG). This is a meshless method, in which the shape functions are constructed by using weight functions of compact support. For non-convex domains, two approaches to the determination...

While the generation of meshes has always posed challenges for computational scientists, the problem has become more acute in recent years. Increased computational power has enabled scientists to tackle problems of increasing size and complexity. While algorithms have seen great advances, mesh generation has lagged behind, creating a computational bottleneck. For industry and government looking...

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...