نتایج جستجو برای: radial point interpolation method

تعداد نتایج: 2121416  

2016
ZUOQIANG SHI WEI ZHU

Abstract. Inspired by the graph Laplacian and the point integral method, we introduce a novel weighted graph Laplacian method to compute a smooth interpolation function on a point cloud in high dimensional space. The numerical results in semi-supervised learning and image inpainting show that the weighted graph Laplacian is a reliable and efficient interpolation method. In addition, it is easy ...

2013
E. J. Sellountos D. Polyzos S. N. Atluri

A new meshless Local Boundary Integral Equation (LBIE) method for solving two-dimensional elastostatic problems is proposed. Randomly distributed points without any connectivity requirement cover the analyzed domain and Local Radial Basis Functions (LRBFs) are employed for the meshless interpolation of displacements. For each point a circular support domain is centered and a local integral repr...

2013
R. ANSARI H. ROUHI B. ARASH

Abstract– This article describes an investigation into the free vibration of double-walled carbon nanotubes (DWCNTs) using a nonlocal elastic shell model. Eringen’s nonlocal elasticity is implemented to incorporate the scale effect into the Donnell shell model. Also, the van der Waals interaction between the inner and outer nanotubes is taken into account. A new numerical solution method from i...

Journal: :Adv. Comput. Math. 2010
Stefano De Marchi Robert Schaback

It is often observed that interpolation based on translates of radial basis functions or non-radial kernels is numerically unstable due to exceedingly large condition of the kernel matrix. But if stability is assessed in function space without considering special bases, this paper proves that kernel–based interpolation is stable. Provided that the data are not too wildly scattered, the L2 or L∞...

2008
LIN-TIAN LUH

It’s well-known that there is a so-called high-level error bound for multiquadric and inverse multiquadric interpolations, which was put forward by Madych and Nelson in 1992. It’s of the form |f(x)− s(x)| ≤ λ 1 d ‖f‖h where 0 < λ < 1 is a constant, d is the fill distance which roughly speaking measures the spacing of the data points, s(x) is the interpolating function of f(x), and h denotes the...

2008
G. R. LIU

A Point Interpolation Method (PIM) is presented for stress analysis for two-dimensional solids. In the PIM, the problem domain is represented by properly scattered points. A technique is proposed to construct polynomial interpolants with delta function property based only on a group of arbitrarily distributed points. The PIM equations are then derived using variational principles. In the PIM, t...

Journal: :SIAM J. Numerical Analysis 2005
Rodrigo B. Platte Tobin A. Driscoll

Abstract. We explore a connection between Gaussian radial basis functions and polynomials. Using standard tools of potential theory, we find that these radial functions are susceptible to the Runge phenomenon, not only in the limit of increasingly flat functions, but also in the finite shape parameter case. We show that there exist interpolation node distributions that prevent such phenomena an...

2014
John A. Nairn James E. Guilkey

This paper reformulates the axisymmetric form of the material point method (MPM) using generalized interpolation material point (GIMP) methods. The reformulation led to a need for new shape functions and gradients specific for axisymmetry that were not available before. The new shape functions differ most from planar shape functions near the origin where r = 0. A second purpose for this paper w...

2007
Dominik Schmid

A frequently used method to handle scattered data approximation problems on different structures is the interpolation by linear combinations of a single positive definite kernel. Here the underlying positive definite kernel is responsible for the quality of the common estimates of the two main issues in this approximation process. Firstly the approximation error and secondly the stability of th...

2009
Wei-Fan Chiang Michael DeLisi Todd Hummel Tyler Prete Kevin Tew Mary Hall

This paper describes our experience rewriting a sequential particle-in-cell code so that its key computations are executed on a GPU. This code is well-suited to GPU acceleration, as it performs data-parallel operations on a regular grid. Key performance challenges are the need for global synchronization in mapping particles to grid nodes, and managing memory bandwidth to global memory. Performa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید