SlideShare a Scribd company logo
IOSR Journal of Engineering (IOSRJEN) www.iosrjen.org
ISSN (e): 2250-3021, ISSN (p): 2278-8719
Vol. 04, Issue 11 (November. 2014), ||V2|| PP 23-35
International organization of Scientific Research 23 | P a g e
Construction Of Shape Function By Radial Point Interpolation
Method For 1d Case
A. Mjidila1
, S. Jalal2
, L. Bousshine3
, Z. Elmaskaoui4
1,2,3,4
(Ain Chock Hassan II University, NHSEM, Oasis, Eljadida road, PB8118 Casablanca
Laboratory of Technologies of Constructions and the Industrial Systems)
Abstract: - In this paper, is presented a construction of Shape function by Radial Point Interpolation Method
for 1D case. The original code 2D, developed by G.R. Lui and coworkers, was modified for 1D case. Treated
case is a 1D support Domain built over six nodes. Three basic functions were used to construct the shape
functions, Multi-Quadratic (MQ), exponential (Exp) and Thin Plate Spline (TPS) functions.
Keywords - Mesh-less method, Shape function, RPIM, Basis function.
I. INTRODUCTION
The method of function interpolation/approximation based on arbitrary nodes is one of the most important
issues in an MFree method. MFree methods may be classified according to the MFree
interpolation/approximation methods used.
1. Meshfree methods based on the moving least squares approximation
2. Meshfree methods based on the integral representation method for the function approximation
These two methods can be seen in specialized literature.
3. Meshfree methods based on the point interpolation method
The point interpolation method (PIM) is an MFree interpolation technique that was used by GR Liu
and his colleagues (GR Liu and Gu, 2001a) to construct shape functions using nodes distributed locally to
formulate Mf'ree weak-form methods. Different from the NILS approximation, PIM uses interpolations to
construct shape functions that possess Kronecker delta property. Two different types of PIM formulations using
the polynomial basis (GR Liu and Gu, 2001c) and the radial function basis (REF) (Wang and GR Liu, 2000)
have been developed.
A good method for creating MFree shape functions should satisfy some basic requirements.
 It should be sufficiently robust for reasonably arbitrarily distributed nodes (arbitrary nodal distribution).
 It should be numerically stable (stability).
 It should satisfy up to a certain order of consistency (consistency).
 It should be compactly supported, i.e., it should be regarded as zero outside a bounded region, the support
domain.
The approximated unknown function using the shape function should be compatible" (compatibility) throughout
the problem domain when a global weak-form is used, or should be compatible within the local quadrature
domain when a local weak-form is used.
It is ideal if the shape function possesses the Kronecker delta function property (Delta function property), i.e.
the shape function is unit at the node and zero at other nodes in the support domain.
 It should be computationally efficient (efficiency)
II. RADIAL POINT INTERPOLATION SHAPE FUNCTION
In seeking for an approximate solution to a problem governed by PDEs and boundary conditions, one
first needs to approximate the unknown field function using trial (shape) functions, before any formulation
procedure can be applied to establish the discretized system equations. This paragraph discusses various
techniques for Mf'ree shape function constructions. These shape functions are locally supported, because only a
set of field nodes in a small local domain are used in the construction and the shape function is not used or
regarded as zero outside the local domain. Such a local domain is termed the support domain.
In the finite element method (FEM), the shape functions are created using interpolation techniques
based on elements formed by a set of fixed nodes. This type of interpolation is termed stationary element based
interpolation. In MFree methods, the problem domain is usually represented by field nodes that are, in general,
arbitrarily distributed. The field variables at an arbitrary point in the problem domain are approximated using a
group of field nodes in a local support domain. [2]
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 24 | P a g e
The point interpolation method (PIM) is one of the series representation methods for the function
approximation, and is useful for creating MFree shape functions. In order to avoid the singularity problem in the
polynomial PIM, the radial basis function (REF) is used to develop the radial point interpolation method
(RPIM) shape functions for MFree weak-form methods (GR Liu and Gu, 2001c; Wang and Liu, 2000; 2002a,c).
The RPIM interpolation augmented with polynomials can be written as:
 

m
j
TT
jj
n
i
ii bxpaxRbxpaxRxu
11
)()()()()( (1)
where Ri(x) is a radial basis function (REF), n is the number of REFs, pj(x) is monomial in the space
coordinates xT=[x, y], and m is the number of polynomial basis functions. When m=0, pure REFs are used.
Otherwise, the REF is augmented with m polynomial basis functions. Coefficients a, and b, are constants to be
determined.
In the radial basis function Ri(x), the variable is only the distance between the point of interest x and a node at
xi,
problems1Dfor)(rand
problems2Dfor)()( 22
i
ii
xx
yyxxr


( 2)
There are a number of types of radial basis functions (REF), and the characteristics of RBFs have been widely
investigated (Kansa, 1990; Sharan et al.,1997; Franke and Schaback, 1997; etc.). Four often used REFs, the
multi-quadrics (MQ) function, the Gaussian (Exp) function, the thin plate spline (TPS) function and the
Logarithmic radial basis function are listed in table 1.
Table 1 Typical radial basis functions
Name Expression Shape Parametrs
1. Multi-Quadratics (MQ) q
ccii drxR ))(()( 22
 qc ,0
2. Gaussian (Exp)
))(exp()( 2
c
i
ci
d
r
xR  c
3. Thin Plate Spline 
ii rxR )( 
4. Logarithmic
iii rrxR log)( 
 
In order to determine ai and bi in equation (1), a support domain is formed for the point of interest at x, and n
field nodes are included in the support domain. Coefficients ai and bj in Equation (1) can be determined by
enforcing Equation (1) to be satisfied at these n nodes surrounding the point of interest x. This leads to n linear
equations, one for each node. The matrix form of these equations can be expressed as
bPaRU ms  0 (3)
where the vector of function values Us is
 T
ns uuuU ...21 (4)
The moment matrix of TBFs is













)()(2)(1
)2(1)2(2)2(1
)1()1(2)1(1
0
...
............
...
...
rnnrnrn
rrr
rnrr
RRR
RRR
RRR
R ( 5)
Tne polynomial moment matrix is
)(321
321
321
)()()()(
......
...
...
1...111
nmnmmmm
n
n
T
m
xpxpxpxp
yyyy
xxxx
P

















 (6)
The vector of coefficients for RBFs is
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 25 | P a g e
 T
n
T
aaaa ...21 (7)
The vector of coefficients for polynomial is
 T
n
T
bbbb ...21 (8)
In equation (5) rk in Ri(rk) is defined as
)()( 22
ikikk yyxxr  (9)
However, There are n+m variables in equation (4). The additional m equations can be added using the following
m constraint conditions.


n
i
T
miij aPaxp
1
m1,2,...,j,0)( (10)
Combing Equations (3) et (10) yields the following set of equations in the matrix form
0
0
00
Ga
b
a
P
PRU
U T
m
ms
s 


















 (11)
Where
 m21n210 b...bba...aaaT
 (12)
 T
ns uuuU 0...00...21 (13)
Because the matrix R0, is symmetric, the matrix G will also be symmetric. Solving Equation (11), we obtain
sUG
b
a
a
~1
0








 (14)
Equation (14) can be re-written as
 







b
a
xpxRbxpaxRxu TTTT
)()()()()( (15)
Using Equation (14) we can obtain
  s
T
s
TTTT
UxUGxpxRbxpaxRxu
~
)(
~
)()()()()( 1
 
(16)
Where the RPIM shape function can be expressed as
 
 )(...)()(...)()(
)()()(
~
121
1
xxxxx
GxpxRx
mnnn
TTT





(17)
Finally, the RPIM shape functions corresponding to the nodal displacements vector Φ(x) are obtained as
 )(...)()()(
~
21 xxxx n
T
 (18)
Equation (16) can be re-written as
)(u(x)
n
1i
i
 is
T
uUx  (19)
The derivatives of u(x) are easily obtained as
)((x)u ,, s
T
ll Ux (20)
Where Ɩ denotes either the coordinate x or y. A comma designates a partial differentiation with respect to the
indicated spatial coordinate that follows.
There are several advantages of using RBFs as a basis in constructing PIM shape functions that use local
compact support domains.
 Using REFs can effectively solve the singularity problem of the polynomial PIM.
 RPIM shape functions are stable and hence flexible for arbitrary and irregular nodal distributions.
 RPIM shape functions can be easily created for three-dimensional domains, because the only variable is the
distance r in a REF. For three-dimensional interpolation, we simply change the distance expression to
)()()( 222
iii zzyyxxr  (21)
 RPIM shape functions are better suited than MLS functions for fluid dynamics problems.
However, RPIM also has some shortcomings, such as
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 26 | P a g e
 RPIM shape functions usually give less accurate solutions for solid problems compared to MLS and the
polynomial PlM shape functions.
 Some shape parameters must be determined carefully, because they can affect the accuracy and the
performance of the RPIM shape functions used in MFree methods.
 RPIM shape functions are usually computationally more expensive than the polynomial PIM because more
nodes are required in the local support domain.
III. 1D-RPIM SHAPE FUNCTION CALCULUS
There a 2D-code developed by G.R. Lui and coworkers, was modified for 1D case to calculate the RPIM shape
function and theirs first and second derivatives to respect of x.
The case study is a domain formed by six nodes as shown in fig. 1
Figure 1: 1D domain formed by six nodes
The table 2 gives the spatial coordinate for each node. A set of six nodes of interest is chosen as is given in table
3.
In this study, the following coefficients are chosen : q=0.5, αc=2, dc=1, η=2 and ambasis=0 (RPIM is pure).
Table 2, Field nodes and their coordinates
Node 1 2 3 4 5 6
Coordinate 0 1 2 3 4 5
Table 3, Field node of interest
Node 1 2 3 4 5 6
Coordinate 0 1 2 3 4 5
The figure 2 gives the flowchart of modified code.
Figure 2, Flowchart of modified code
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 27 | P a g e
IV. THE RESULT AND DISCUSSION
The following figures (3), (10) and (17) give the result obtained by the modified code in cases:
 the Quadratic-RBF,
 the exponential-RBF,
 The TPS-RBF.
Figure 3, the result by MQ RBF
The following figures (4-9) show shape function Φ and theirs first and second derivatives to respect of x in each
node, for MQ-RBF.
Figure 4, Φ function and and its first and second derivatives to respect of x for node 1 by MQ method
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 28 | P a g e
Figure 5, Φ function and and its first and second derivatives to respect of x for node 2 by MQ method
Figure 6, Φ function and and its first and second derivatives to respect of x for node 3 by MQ method
Figure 7, Φ function and and its first and second derivatives to respect of x for node 4 by MQ method
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 29 | P a g e
Figure 8, Φ function and and its first and second derivatives to respect of x for node 5 by MQ method
Figure 9, Φ function and and its first and second derivatives to respect of x for node 6 by MQ method
Figure 10, the result by Exp RBF
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 30 | P a g e
The following figures (10-15) show shape function Φ and theirs first and second derivatives to respect of x in
each node, for EXP-RBF.
Figure 11, Phi, Φ function and and its first and second derivatives to respect of x for node 1 by EXP
method
Figure 12,Φ function and and its first and second derivatives to respect of x for node 2 by EXP method
Figure 13, Φ function and and its first and second derivatives to respect of x for node 3 by EXP method
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 31 | P a g e
Figure 14, Φ function and and its first and second derivatives to respect of x for node 4 by EXP method
Figure 15, Φ function and and its first and second derivatives to respect of x for node 5 by EXP method
Figure 16, Φ function and and its first and second derivatives to respect of x for node 6 by EXP method
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 32 | P a g e
Figure 17, result by TPS-RBF
The following figures (18-23) show shape function Φ and theirs first and second derivatives to respect of x in
each node, for TPS-RBF.
Figure 18,Φ function and and its first and second derivatives to respect of x for node 1 by TPS method
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 33 | P a g e
Figure 19,Φ function and and its first and second derivatives to respect of x for node 2 by TPS method
Figure 20,Φ function and and its first and second derivatives to respect of x for node 3 by TPS method
Figure 21,Φ function and and its first and second derivatives to respect of x for node 4 by TPS method
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 34 | P a g e
Figure 22,Φ function and and its first and second derivatives to respect of x for node 5 by TPS method
Figure 23,Φ function and and its first and second derivatives to respect of x for node 6 by TPS method
If the points of interest are different from nodes, for example the field (0.5, 1.5, 2.5, 3.5, 4.5, 5.5) is chosen as a
set of interest points. In this case the Φ function and its derivatives for the interest point xv=2.5 are shown in
figures 23 to 25 by the three different methods.
Figure 24, Φ function and and its first and second derivatives for node xv =2.5 by MQ method.
ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case
International organization of Scientific Research 35 | P a g e
REFERENCES
Books:
[1] Rong Liu, Meshfree methods: moving beyond the finite element method (CRC Press LLC, 2003).
[2] Rong Liu and Y.T. Gu, An Introduction to Meshfree Methods and their programming, (2006 Springer )
[3] Youping Chen, James D. Lee, and Azim Eskandarian, Meshless Methods in Solid Mechanics(2006
Springer Science , Inc)

More Related Content

What's hot

A Hybrid Technique for Shape Matching Based on chain code and DFS Tree
A Hybrid Technique for Shape Matching Based on chain code and DFS TreeA Hybrid Technique for Shape Matching Based on chain code and DFS Tree
A Hybrid Technique for Shape Matching Based on chain code and DFS Tree
IOSR Journals
 
Enhanced Morphological Contour Representation and Reconstruction using Line S...
Enhanced Morphological Contour Representation and Reconstruction using Line S...Enhanced Morphological Contour Representation and Reconstruction using Line S...
Enhanced Morphological Contour Representation and Reconstruction using Line S...
CSCJournals
 
Improved algorithm for road region segmentation based on sequential monte car...
Improved algorithm for road region segmentation based on sequential monte car...Improved algorithm for road region segmentation based on sequential monte car...
Improved algorithm for road region segmentation based on sequential monte car...
csandit
 
An optimal general type-2 fuzzy controller for Urban Traffic Network
An optimal general type-2 fuzzy controller for Urban Traffic NetworkAn optimal general type-2 fuzzy controller for Urban Traffic Network
An optimal general type-2 fuzzy controller for Urban Traffic Network
ISA Interchange
 
Unimodal Multi-Feature Fusion and one-dimensional Hidden Markov Models for Lo...
Unimodal Multi-Feature Fusion and one-dimensional Hidden Markov Models for Lo...Unimodal Multi-Feature Fusion and one-dimensional Hidden Markov Models for Lo...
Unimodal Multi-Feature Fusion and one-dimensional Hidden Markov Models for Lo...
IJECEIAES
 
A survey on graph kernels
A survey on graph kernelsA survey on graph kernels
A survey on graph kernels
vincyy
 
Numerical modelling in Geo mechanics
Numerical modelling in Geo mechanicsNumerical modelling in Geo mechanics
Numerical modelling in Geo mechanics
Ulimella Siva Sankar
 
Local Binary Fitting Segmentation by Cooperative Quantum Particle Optimization
Local Binary Fitting Segmentation by Cooperative Quantum Particle OptimizationLocal Binary Fitting Segmentation by Cooperative Quantum Particle Optimization
Local Binary Fitting Segmentation by Cooperative Quantum Particle Optimization
TELKOMNIKA JOURNAL
 
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...
CSCJournals
 
Numerical modelling in Geomechanics
Numerical modelling in GeomechanicsNumerical modelling in Geomechanics
Numerical modelling in Geomechanics
Ulimella Siva Sankar
 
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SETA BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
csandit
 
U130304127141
U130304127141U130304127141
U130304127141
IOSR Journals
 
Topology
TopologyTopology
Topology
lxmota
 
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO Systems
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO SystemsA New Approach to Linear Estimation Problem in Multiuser Massive MIMO Systems
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO Systems
Radita Apriana
 
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document SegmentationA Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
University of Bari (Italy)
 
Image Processing Research paper
Image Processing Research paperImage Processing Research paper
Image Processing Research paper
Ronak Vyas
 
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document SegmentationA Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
University of Bari (Italy)
 

What's hot (18)

A Hybrid Technique for Shape Matching Based on chain code and DFS Tree
A Hybrid Technique for Shape Matching Based on chain code and DFS TreeA Hybrid Technique for Shape Matching Based on chain code and DFS Tree
A Hybrid Technique for Shape Matching Based on chain code and DFS Tree
 
Enhanced Morphological Contour Representation and Reconstruction using Line S...
Enhanced Morphological Contour Representation and Reconstruction using Line S...Enhanced Morphological Contour Representation and Reconstruction using Line S...
Enhanced Morphological Contour Representation and Reconstruction using Line S...
 
Improved algorithm for road region segmentation based on sequential monte car...
Improved algorithm for road region segmentation based on sequential monte car...Improved algorithm for road region segmentation based on sequential monte car...
Improved algorithm for road region segmentation based on sequential monte car...
 
An optimal general type-2 fuzzy controller for Urban Traffic Network
An optimal general type-2 fuzzy controller for Urban Traffic NetworkAn optimal general type-2 fuzzy controller for Urban Traffic Network
An optimal general type-2 fuzzy controller for Urban Traffic Network
 
Unimodal Multi-Feature Fusion and one-dimensional Hidden Markov Models for Lo...
Unimodal Multi-Feature Fusion and one-dimensional Hidden Markov Models for Lo...Unimodal Multi-Feature Fusion and one-dimensional Hidden Markov Models for Lo...
Unimodal Multi-Feature Fusion and one-dimensional Hidden Markov Models for Lo...
 
A survey on graph kernels
A survey on graph kernelsA survey on graph kernels
A survey on graph kernels
 
Numerical modelling in Geo mechanics
Numerical modelling in Geo mechanicsNumerical modelling in Geo mechanics
Numerical modelling in Geo mechanics
 
Local Binary Fitting Segmentation by Cooperative Quantum Particle Optimization
Local Binary Fitting Segmentation by Cooperative Quantum Particle OptimizationLocal Binary Fitting Segmentation by Cooperative Quantum Particle Optimization
Local Binary Fitting Segmentation by Cooperative Quantum Particle Optimization
 
Lec10 matching
Lec10 matchingLec10 matching
Lec10 matching
 
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...
 
Numerical modelling in Geomechanics
Numerical modelling in GeomechanicsNumerical modelling in Geomechanics
Numerical modelling in Geomechanics
 
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SETA BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
 
U130304127141
U130304127141U130304127141
U130304127141
 
Topology
TopologyTopology
Topology
 
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO Systems
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO SystemsA New Approach to Linear Estimation Problem in Multiuser Massive MIMO Systems
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO Systems
 
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document SegmentationA Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
 
Image Processing Research paper
Image Processing Research paperImage Processing Research paper
Image Processing Research paper
 
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document SegmentationA Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
A Run Length Smoothing-Based Algorithm for Non-Manhattan Document Segmentation
 

Similar to E041122335

Optical modeling and design of freeform surfaces using anisotropic Radial Bas...
Optical modeling and design of freeform surfaces using anisotropic Radial Bas...Optical modeling and design of freeform surfaces using anisotropic Radial Bas...
Optical modeling and design of freeform surfaces using anisotropic Radial Bas...
Milan Maksimovic
 
Dycops2019
Dycops2019 Dycops2019
Dycops2019
Jéssyca Bessa
 
Bg2420212027
Bg2420212027Bg2420212027
Bg2420212027IJMER
 
A Robust Method Based On LOVO Functions For Solving Least Squares Problems
A Robust Method Based On LOVO Functions For Solving Least Squares ProblemsA Robust Method Based On LOVO Functions For Solving Least Squares Problems
A Robust Method Based On LOVO Functions For Solving Least Squares Problems
Dawn Cook
 
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SETA BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
sipij
 
Human Arm Inverse Kinematic Solution Based Geometric Relations and Optimizati...
Human Arm Inverse Kinematic Solution Based Geometric Relations and Optimizati...Human Arm Inverse Kinematic Solution Based Geometric Relations and Optimizati...
Human Arm Inverse Kinematic Solution Based Geometric Relations and Optimizati...
Waqas Tariq
 
Improved Characters Feature Extraction and Matching Algorithm Based on SIFT
Improved Characters Feature Extraction and Matching Algorithm Based on SIFTImproved Characters Feature Extraction and Matching Algorithm Based on SIFT
Improved Characters Feature Extraction and Matching Algorithm Based on SIFT
Nooria Sukmaningtyas
 
A novel architecture of rns based
A novel architecture of rns basedA novel architecture of rns based
A novel architecture of rns based
VLSICS Design
 
E04923142
E04923142E04923142
E04923142
IOSR-JEN
 
CPREDICTION OF INVERSE KINEMATICS SOLUTION OF A REDUNDANT MANIPULATOR USING A...
CPREDICTION OF INVERSE KINEMATICS SOLUTION OF A REDUNDANT MANIPULATOR USING A...CPREDICTION OF INVERSE KINEMATICS SOLUTION OF A REDUNDANT MANIPULATOR USING A...
CPREDICTION OF INVERSE KINEMATICS SOLUTION OF A REDUNDANT MANIPULATOR USING A...
Ijripublishers Ijri
 
An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multi...
An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multi...An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multi...
An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multi...
IJERA Editor
 
1-s2.0-S0045782514004332-main.pdf
1-s2.0-S0045782514004332-main.pdf1-s2.0-S0045782514004332-main.pdf
1-s2.0-S0045782514004332-main.pdf
filiatra
 
D04922630
D04922630D04922630
D04922630
IOSR-JEN
 
A 3-D Riesz-Covariance Texture Model for the Prediction of Nodule Recurrence ...
A 3-D Riesz-Covariance Texture Model for the Prediction of Nodule Recurrence ...A 3-D Riesz-Covariance Texture Model for the Prediction of Nodule Recurrence ...
A 3-D Riesz-Covariance Texture Model for the Prediction of Nodule Recurrence ...
Institute of Information Systems (HES-SO)
 
Section5 Rbf
Section5 RbfSection5 Rbf
Section5 Rbfkylin
 
The Geometric Characteristics of the Linear Features in Close Range Photogram...
The Geometric Characteristics of the Linear Features in Close Range Photogram...The Geometric Characteristics of the Linear Features in Close Range Photogram...
The Geometric Characteristics of the Linear Features in Close Range Photogram...
IJERD Editor
 
Farsi character recognition using new hybrid feature extraction methods
Farsi character recognition using new hybrid feature extraction methodsFarsi character recognition using new hybrid feature extraction methods
Farsi character recognition using new hybrid feature extraction methods
ijcseit
 
International Journal of Computer Science, Engineering and Information Techno...
International Journal of Computer Science, Engineering and Information Techno...International Journal of Computer Science, Engineering and Information Techno...
International Journal of Computer Science, Engineering and Information Techno...
ijcseit
 
Chapter 4 Shape function.finite element analysis , shape function derivation
Chapter 4 Shape function.finite element analysis , shape function derivationChapter 4 Shape function.finite element analysis , shape function derivation
Chapter 4 Shape function.finite element analysis , shape function derivation
kensingtonazemafac
 
A partial linearization method for the traffic assignment problem.pdf
A partial linearization method for the traffic assignment problem.pdfA partial linearization method for the traffic assignment problem.pdf
A partial linearization method for the traffic assignment problem.pdf
Ann Wera
 

Similar to E041122335 (20)

Optical modeling and design of freeform surfaces using anisotropic Radial Bas...
Optical modeling and design of freeform surfaces using anisotropic Radial Bas...Optical modeling and design of freeform surfaces using anisotropic Radial Bas...
Optical modeling and design of freeform surfaces using anisotropic Radial Bas...
 
Dycops2019
Dycops2019 Dycops2019
Dycops2019
 
Bg2420212027
Bg2420212027Bg2420212027
Bg2420212027
 
A Robust Method Based On LOVO Functions For Solving Least Squares Problems
A Robust Method Based On LOVO Functions For Solving Least Squares ProblemsA Robust Method Based On LOVO Functions For Solving Least Squares Problems
A Robust Method Based On LOVO Functions For Solving Least Squares Problems
 
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SETA BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SET
 
Human Arm Inverse Kinematic Solution Based Geometric Relations and Optimizati...
Human Arm Inverse Kinematic Solution Based Geometric Relations and Optimizati...Human Arm Inverse Kinematic Solution Based Geometric Relations and Optimizati...
Human Arm Inverse Kinematic Solution Based Geometric Relations and Optimizati...
 
Improved Characters Feature Extraction and Matching Algorithm Based on SIFT
Improved Characters Feature Extraction and Matching Algorithm Based on SIFTImproved Characters Feature Extraction and Matching Algorithm Based on SIFT
Improved Characters Feature Extraction and Matching Algorithm Based on SIFT
 
A novel architecture of rns based
A novel architecture of rns basedA novel architecture of rns based
A novel architecture of rns based
 
E04923142
E04923142E04923142
E04923142
 
CPREDICTION OF INVERSE KINEMATICS SOLUTION OF A REDUNDANT MANIPULATOR USING A...
CPREDICTION OF INVERSE KINEMATICS SOLUTION OF A REDUNDANT MANIPULATOR USING A...CPREDICTION OF INVERSE KINEMATICS SOLUTION OF A REDUNDANT MANIPULATOR USING A...
CPREDICTION OF INVERSE KINEMATICS SOLUTION OF A REDUNDANT MANIPULATOR USING A...
 
An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multi...
An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multi...An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multi...
An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multi...
 
1-s2.0-S0045782514004332-main.pdf
1-s2.0-S0045782514004332-main.pdf1-s2.0-S0045782514004332-main.pdf
1-s2.0-S0045782514004332-main.pdf
 
D04922630
D04922630D04922630
D04922630
 
A 3-D Riesz-Covariance Texture Model for the Prediction of Nodule Recurrence ...
A 3-D Riesz-Covariance Texture Model for the Prediction of Nodule Recurrence ...A 3-D Riesz-Covariance Texture Model for the Prediction of Nodule Recurrence ...
A 3-D Riesz-Covariance Texture Model for the Prediction of Nodule Recurrence ...
 
Section5 Rbf
Section5 RbfSection5 Rbf
Section5 Rbf
 
The Geometric Characteristics of the Linear Features in Close Range Photogram...
The Geometric Characteristics of the Linear Features in Close Range Photogram...The Geometric Characteristics of the Linear Features in Close Range Photogram...
The Geometric Characteristics of the Linear Features in Close Range Photogram...
 
Farsi character recognition using new hybrid feature extraction methods
Farsi character recognition using new hybrid feature extraction methodsFarsi character recognition using new hybrid feature extraction methods
Farsi character recognition using new hybrid feature extraction methods
 
International Journal of Computer Science, Engineering and Information Techno...
International Journal of Computer Science, Engineering and Information Techno...International Journal of Computer Science, Engineering and Information Techno...
International Journal of Computer Science, Engineering and Information Techno...
 
Chapter 4 Shape function.finite element analysis , shape function derivation
Chapter 4 Shape function.finite element analysis , shape function derivationChapter 4 Shape function.finite element analysis , shape function derivation
Chapter 4 Shape function.finite element analysis , shape function derivation
 
A partial linearization method for the traffic assignment problem.pdf
A partial linearization method for the traffic assignment problem.pdfA partial linearization method for the traffic assignment problem.pdf
A partial linearization method for the traffic assignment problem.pdf
 

More from IOSR-JEN

C05921721
C05921721C05921721
C05921721
IOSR-JEN
 
B05921016
B05921016B05921016
B05921016
IOSR-JEN
 
A05920109
A05920109A05920109
A05920109
IOSR-JEN
 
J05915457
J05915457J05915457
J05915457
IOSR-JEN
 
I05914153
I05914153I05914153
I05914153
IOSR-JEN
 
H05913540
H05913540H05913540
H05913540
IOSR-JEN
 
G05913234
G05913234G05913234
G05913234
IOSR-JEN
 
F05912731
F05912731F05912731
F05912731
IOSR-JEN
 
E05912226
E05912226E05912226
E05912226
IOSR-JEN
 
D05911621
D05911621D05911621
D05911621
IOSR-JEN
 
C05911315
C05911315C05911315
C05911315
IOSR-JEN
 
B05910712
B05910712B05910712
B05910712
IOSR-JEN
 
A05910106
A05910106A05910106
A05910106
IOSR-JEN
 
B05840510
B05840510B05840510
B05840510
IOSR-JEN
 
I05844759
I05844759I05844759
I05844759
IOSR-JEN
 
H05844346
H05844346H05844346
H05844346
IOSR-JEN
 
G05843942
G05843942G05843942
G05843942
IOSR-JEN
 
F05843238
F05843238F05843238
F05843238
IOSR-JEN
 
E05842831
E05842831E05842831
E05842831
IOSR-JEN
 
D05842227
D05842227D05842227
D05842227
IOSR-JEN
 

More from IOSR-JEN (20)

C05921721
C05921721C05921721
C05921721
 
B05921016
B05921016B05921016
B05921016
 
A05920109
A05920109A05920109
A05920109
 
J05915457
J05915457J05915457
J05915457
 
I05914153
I05914153I05914153
I05914153
 
H05913540
H05913540H05913540
H05913540
 
G05913234
G05913234G05913234
G05913234
 
F05912731
F05912731F05912731
F05912731
 
E05912226
E05912226E05912226
E05912226
 
D05911621
D05911621D05911621
D05911621
 
C05911315
C05911315C05911315
C05911315
 
B05910712
B05910712B05910712
B05910712
 
A05910106
A05910106A05910106
A05910106
 
B05840510
B05840510B05840510
B05840510
 
I05844759
I05844759I05844759
I05844759
 
H05844346
H05844346H05844346
H05844346
 
G05843942
G05843942G05843942
G05843942
 
F05843238
F05843238F05843238
F05843238
 
E05842831
E05842831E05842831
E05842831
 
D05842227
D05842227D05842227
D05842227
 

Recently uploaded

From Daily Decisions to Bottom Line: Connecting Product Work to Revenue by VP...
From Daily Decisions to Bottom Line: Connecting Product Work to Revenue by VP...From Daily Decisions to Bottom Line: Connecting Product Work to Revenue by VP...
From Daily Decisions to Bottom Line: Connecting Product Work to Revenue by VP...
Product School
 
DevOps and Testing slides at DASA Connect
DevOps and Testing slides at DASA ConnectDevOps and Testing slides at DASA Connect
DevOps and Testing slides at DASA Connect
Kari Kakkonen
 
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Product School
 
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdfFIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
Safe Software
 
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Jeffrey Haguewood
 
Knowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and backKnowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and back
Elena Simperl
 
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 previewState of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
Prayukth K V
 
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
Sri Ambati
 
UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3
DianaGray10
 
"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi
Fwdays
 
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
Product School
 
The Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and SalesThe Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and Sales
Laura Byrne
 
The Future of Platform Engineering
The Future of Platform EngineeringThe Future of Platform Engineering
The Future of Platform Engineering
Jemma Hussein Allen
 
Connector Corner: Automate dynamic content and events by pushing a button
Connector Corner: Automate dynamic content and events by pushing a buttonConnector Corner: Automate dynamic content and events by pushing a button
Connector Corner: Automate dynamic content and events by pushing a button
DianaGray10
 
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Tobias Schneck
 
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdfFIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
UiPathCommunity
 
Epistemic Interaction - tuning interfaces to provide information for AI support
Epistemic Interaction - tuning interfaces to provide information for AI supportEpistemic Interaction - tuning interfaces to provide information for AI support
Epistemic Interaction - tuning interfaces to provide information for AI support
Alan Dix
 
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualitySoftware Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Inflectra
 

Recently uploaded (20)

From Daily Decisions to Bottom Line: Connecting Product Work to Revenue by VP...
From Daily Decisions to Bottom Line: Connecting Product Work to Revenue by VP...From Daily Decisions to Bottom Line: Connecting Product Work to Revenue by VP...
From Daily Decisions to Bottom Line: Connecting Product Work to Revenue by VP...
 
DevOps and Testing slides at DASA Connect
DevOps and Testing slides at DASA ConnectDevOps and Testing slides at DASA Connect
DevOps and Testing slides at DASA Connect
 
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
 
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdfFIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
 
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
 
Knowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and backKnowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and back
 
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 previewState of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
 
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
 
UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3
 
"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi
 
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
 
The Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and SalesThe Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and Sales
 
The Future of Platform Engineering
The Future of Platform EngineeringThe Future of Platform Engineering
The Future of Platform Engineering
 
Connector Corner: Automate dynamic content and events by pushing a button
Connector Corner: Automate dynamic content and events by pushing a buttonConnector Corner: Automate dynamic content and events by pushing a button
Connector Corner: Automate dynamic content and events by pushing a button
 
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
 
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdfFIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
 
Epistemic Interaction - tuning interfaces to provide information for AI support
Epistemic Interaction - tuning interfaces to provide information for AI supportEpistemic Interaction - tuning interfaces to provide information for AI support
Epistemic Interaction - tuning interfaces to provide information for AI support
 
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualitySoftware Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
 

E041122335

  • 1. IOSR Journal of Engineering (IOSRJEN) www.iosrjen.org ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 04, Issue 11 (November. 2014), ||V2|| PP 23-35 International organization of Scientific Research 23 | P a g e Construction Of Shape Function By Radial Point Interpolation Method For 1d Case A. Mjidila1 , S. Jalal2 , L. Bousshine3 , Z. Elmaskaoui4 1,2,3,4 (Ain Chock Hassan II University, NHSEM, Oasis, Eljadida road, PB8118 Casablanca Laboratory of Technologies of Constructions and the Industrial Systems) Abstract: - In this paper, is presented a construction of Shape function by Radial Point Interpolation Method for 1D case. The original code 2D, developed by G.R. Lui and coworkers, was modified for 1D case. Treated case is a 1D support Domain built over six nodes. Three basic functions were used to construct the shape functions, Multi-Quadratic (MQ), exponential (Exp) and Thin Plate Spline (TPS) functions. Keywords - Mesh-less method, Shape function, RPIM, Basis function. I. INTRODUCTION The method of function interpolation/approximation based on arbitrary nodes is one of the most important issues in an MFree method. MFree methods may be classified according to the MFree interpolation/approximation methods used. 1. Meshfree methods based on the moving least squares approximation 2. Meshfree methods based on the integral representation method for the function approximation These two methods can be seen in specialized literature. 3. Meshfree methods based on the point interpolation method The point interpolation method (PIM) is an MFree interpolation technique that was used by GR Liu and his colleagues (GR Liu and Gu, 2001a) to construct shape functions using nodes distributed locally to formulate Mf'ree weak-form methods. Different from the NILS approximation, PIM uses interpolations to construct shape functions that possess Kronecker delta property. Two different types of PIM formulations using the polynomial basis (GR Liu and Gu, 2001c) and the radial function basis (REF) (Wang and GR Liu, 2000) have been developed. A good method for creating MFree shape functions should satisfy some basic requirements.  It should be sufficiently robust for reasonably arbitrarily distributed nodes (arbitrary nodal distribution).  It should be numerically stable (stability).  It should satisfy up to a certain order of consistency (consistency).  It should be compactly supported, i.e., it should be regarded as zero outside a bounded region, the support domain. The approximated unknown function using the shape function should be compatible" (compatibility) throughout the problem domain when a global weak-form is used, or should be compatible within the local quadrature domain when a local weak-form is used. It is ideal if the shape function possesses the Kronecker delta function property (Delta function property), i.e. the shape function is unit at the node and zero at other nodes in the support domain.  It should be computationally efficient (efficiency) II. RADIAL POINT INTERPOLATION SHAPE FUNCTION In seeking for an approximate solution to a problem governed by PDEs and boundary conditions, one first needs to approximate the unknown field function using trial (shape) functions, before any formulation procedure can be applied to establish the discretized system equations. This paragraph discusses various techniques for Mf'ree shape function constructions. These shape functions are locally supported, because only a set of field nodes in a small local domain are used in the construction and the shape function is not used or regarded as zero outside the local domain. Such a local domain is termed the support domain. In the finite element method (FEM), the shape functions are created using interpolation techniques based on elements formed by a set of fixed nodes. This type of interpolation is termed stationary element based interpolation. In MFree methods, the problem domain is usually represented by field nodes that are, in general, arbitrarily distributed. The field variables at an arbitrary point in the problem domain are approximated using a group of field nodes in a local support domain. [2]
  • 2. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 24 | P a g e The point interpolation method (PIM) is one of the series representation methods for the function approximation, and is useful for creating MFree shape functions. In order to avoid the singularity problem in the polynomial PIM, the radial basis function (REF) is used to develop the radial point interpolation method (RPIM) shape functions for MFree weak-form methods (GR Liu and Gu, 2001c; Wang and Liu, 2000; 2002a,c). The RPIM interpolation augmented with polynomials can be written as:    m j TT jj n i ii bxpaxRbxpaxRxu 11 )()()()()( (1) where Ri(x) is a radial basis function (REF), n is the number of REFs, pj(x) is monomial in the space coordinates xT=[x, y], and m is the number of polynomial basis functions. When m=0, pure REFs are used. Otherwise, the REF is augmented with m polynomial basis functions. Coefficients a, and b, are constants to be determined. In the radial basis function Ri(x), the variable is only the distance between the point of interest x and a node at xi, problems1Dfor)(rand problems2Dfor)()( 22 i ii xx yyxxr   ( 2) There are a number of types of radial basis functions (REF), and the characteristics of RBFs have been widely investigated (Kansa, 1990; Sharan et al.,1997; Franke and Schaback, 1997; etc.). Four often used REFs, the multi-quadrics (MQ) function, the Gaussian (Exp) function, the thin plate spline (TPS) function and the Logarithmic radial basis function are listed in table 1. Table 1 Typical radial basis functions Name Expression Shape Parametrs 1. Multi-Quadratics (MQ) q ccii drxR ))(()( 22  qc ,0 2. Gaussian (Exp) ))(exp()( 2 c i ci d r xR  c 3. Thin Plate Spline  ii rxR )(  4. Logarithmic iii rrxR log)(    In order to determine ai and bi in equation (1), a support domain is formed for the point of interest at x, and n field nodes are included in the support domain. Coefficients ai and bj in Equation (1) can be determined by enforcing Equation (1) to be satisfied at these n nodes surrounding the point of interest x. This leads to n linear equations, one for each node. The matrix form of these equations can be expressed as bPaRU ms  0 (3) where the vector of function values Us is  T ns uuuU ...21 (4) The moment matrix of TBFs is              )()(2)(1 )2(1)2(2)2(1 )1()1(2)1(1 0 ... ............ ... ... rnnrnrn rrr rnrr RRR RRR RRR R ( 5) Tne polynomial moment matrix is )(321 321 321 )()()()( ...... ... ... 1...111 nmnmmmm n n T m xpxpxpxp yyyy xxxx P                   (6) The vector of coefficients for RBFs is
  • 3. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 25 | P a g e  T n T aaaa ...21 (7) The vector of coefficients for polynomial is  T n T bbbb ...21 (8) In equation (5) rk in Ri(rk) is defined as )()( 22 ikikk yyxxr  (9) However, There are n+m variables in equation (4). The additional m equations can be added using the following m constraint conditions.   n i T miij aPaxp 1 m1,2,...,j,0)( (10) Combing Equations (3) et (10) yields the following set of equations in the matrix form 0 0 00 Ga b a P PRU U T m ms s                     (11) Where  m21n210 b...bba...aaaT  (12)  T ns uuuU 0...00...21 (13) Because the matrix R0, is symmetric, the matrix G will also be symmetric. Solving Equation (11), we obtain sUG b a a ~1 0          (14) Equation (14) can be re-written as          b a xpxRbxpaxRxu TTTT )()()()()( (15) Using Equation (14) we can obtain   s T s TTTT UxUGxpxRbxpaxRxu ~ )( ~ )()()()()( 1   (16) Where the RPIM shape function can be expressed as    )(...)()(...)()( )()()( ~ 121 1 xxxxx GxpxRx mnnn TTT      (17) Finally, the RPIM shape functions corresponding to the nodal displacements vector Φ(x) are obtained as  )(...)()()( ~ 21 xxxx n T  (18) Equation (16) can be re-written as )(u(x) n 1i i  is T uUx  (19) The derivatives of u(x) are easily obtained as )((x)u ,, s T ll Ux (20) Where Ɩ denotes either the coordinate x or y. A comma designates a partial differentiation with respect to the indicated spatial coordinate that follows. There are several advantages of using RBFs as a basis in constructing PIM shape functions that use local compact support domains.  Using REFs can effectively solve the singularity problem of the polynomial PIM.  RPIM shape functions are stable and hence flexible for arbitrary and irregular nodal distributions.  RPIM shape functions can be easily created for three-dimensional domains, because the only variable is the distance r in a REF. For three-dimensional interpolation, we simply change the distance expression to )()()( 222 iii zzyyxxr  (21)  RPIM shape functions are better suited than MLS functions for fluid dynamics problems. However, RPIM also has some shortcomings, such as
  • 4. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 26 | P a g e  RPIM shape functions usually give less accurate solutions for solid problems compared to MLS and the polynomial PlM shape functions.  Some shape parameters must be determined carefully, because they can affect the accuracy and the performance of the RPIM shape functions used in MFree methods.  RPIM shape functions are usually computationally more expensive than the polynomial PIM because more nodes are required in the local support domain. III. 1D-RPIM SHAPE FUNCTION CALCULUS There a 2D-code developed by G.R. Lui and coworkers, was modified for 1D case to calculate the RPIM shape function and theirs first and second derivatives to respect of x. The case study is a domain formed by six nodes as shown in fig. 1 Figure 1: 1D domain formed by six nodes The table 2 gives the spatial coordinate for each node. A set of six nodes of interest is chosen as is given in table 3. In this study, the following coefficients are chosen : q=0.5, αc=2, dc=1, η=2 and ambasis=0 (RPIM is pure). Table 2, Field nodes and their coordinates Node 1 2 3 4 5 6 Coordinate 0 1 2 3 4 5 Table 3, Field node of interest Node 1 2 3 4 5 6 Coordinate 0 1 2 3 4 5 The figure 2 gives the flowchart of modified code. Figure 2, Flowchart of modified code
  • 5. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 27 | P a g e IV. THE RESULT AND DISCUSSION The following figures (3), (10) and (17) give the result obtained by the modified code in cases:  the Quadratic-RBF,  the exponential-RBF,  The TPS-RBF. Figure 3, the result by MQ RBF The following figures (4-9) show shape function Φ and theirs first and second derivatives to respect of x in each node, for MQ-RBF. Figure 4, Φ function and and its first and second derivatives to respect of x for node 1 by MQ method
  • 6. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 28 | P a g e Figure 5, Φ function and and its first and second derivatives to respect of x for node 2 by MQ method Figure 6, Φ function and and its first and second derivatives to respect of x for node 3 by MQ method Figure 7, Φ function and and its first and second derivatives to respect of x for node 4 by MQ method
  • 7. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 29 | P a g e Figure 8, Φ function and and its first and second derivatives to respect of x for node 5 by MQ method Figure 9, Φ function and and its first and second derivatives to respect of x for node 6 by MQ method Figure 10, the result by Exp RBF
  • 8. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 30 | P a g e The following figures (10-15) show shape function Φ and theirs first and second derivatives to respect of x in each node, for EXP-RBF. Figure 11, Phi, Φ function and and its first and second derivatives to respect of x for node 1 by EXP method Figure 12,Φ function and and its first and second derivatives to respect of x for node 2 by EXP method Figure 13, Φ function and and its first and second derivatives to respect of x for node 3 by EXP method
  • 9. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 31 | P a g e Figure 14, Φ function and and its first and second derivatives to respect of x for node 4 by EXP method Figure 15, Φ function and and its first and second derivatives to respect of x for node 5 by EXP method Figure 16, Φ function and and its first and second derivatives to respect of x for node 6 by EXP method
  • 10. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 32 | P a g e Figure 17, result by TPS-RBF The following figures (18-23) show shape function Φ and theirs first and second derivatives to respect of x in each node, for TPS-RBF. Figure 18,Φ function and and its first and second derivatives to respect of x for node 1 by TPS method
  • 11. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 33 | P a g e Figure 19,Φ function and and its first and second derivatives to respect of x for node 2 by TPS method Figure 20,Φ function and and its first and second derivatives to respect of x for node 3 by TPS method Figure 21,Φ function and and its first and second derivatives to respect of x for node 4 by TPS method
  • 12. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 34 | P a g e Figure 22,Φ function and and its first and second derivatives to respect of x for node 5 by TPS method Figure 23,Φ function and and its first and second derivatives to respect of x for node 6 by TPS method If the points of interest are different from nodes, for example the field (0.5, 1.5, 2.5, 3.5, 4.5, 5.5) is chosen as a set of interest points. In this case the Φ function and its derivatives for the interest point xv=2.5 are shown in figures 23 to 25 by the three different methods. Figure 24, Φ function and and its first and second derivatives for node xv =2.5 by MQ method.
  • 13. ConstructionOf ShapeFunction ByRadialPoint InterpolationMethod For1d Case International organization of Scientific Research 35 | P a g e REFERENCES Books: [1] Rong Liu, Meshfree methods: moving beyond the finite element method (CRC Press LLC, 2003). [2] Rong Liu and Y.T. Gu, An Introduction to Meshfree Methods and their programming, (2006 Springer ) [3] Youping Chen, James D. Lee, and Azim Eskandarian, Meshless Methods in Solid Mechanics(2006 Springer Science , Inc)