See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/289060148

Numerical solution of initial value problems using fuzzy transform

Article  in  International Journal of Applied Engineering Research · January 2014

CITATIONS READS

3 220

2 authors:

Awni M. Abu-Saman Huda El-zerii

Al-Azhar University - Gaza Palestinian Ministry of Education and Higher Education
21 PUBLICATIONS   23 CITATIONS    2 PUBLICATIONS   5 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

New Algorithm for Finding Roots of Arbitrary Matrices View project

All content following this page was uploaded by Awni M. Abu-Saman on 16 March 2016.

The user has requested enhancement of the downloaded file.

International Journal of Applied Engineering Research
ISSN 0973-4562 Volume 9, Number 23 (2014) pp. 13667-13675
© Research India Publications
http://www.ripublication.com

Numerical Solution of Initial Value Problems using Fuzzy

Transform

Awni M. Abu-Saman and Huda S. EL-Zerii

Associate Professor of Applied Mathematics

Al-azhar University-Gaza(AUG), Gaza, PALESTINE
Email: a.asman@alazhar.edu.ps, huda.salim.2015@gmail.com

Abstract

The aim of this contribution is to present an alternative approach to the

solution of Differential Equations, we focus on a numerical algorithm in
which the Fuzzy transform will be used as a technique to approximate the
solution of Ordinary Differential Equations. The Numerical algorithm will be
investigated suitably and implemented to many examples with uniform and
non-uniform partitions. Results show that fuzzy transform is a powerful tool
for approximating the solution of Differential Equations.

keywords: Fuzzy set theory, fuzzy transform, fuzzy partition, Numerical

algorithm and ordinary differential equations.

AMS Subject Classification: 15A09

1. Introduction
Fuzzy transform was introduced for the first time by Irina Perfilieva in 2001, it is an
interesting technique to approximate solutions of Differential Equations; The Fuzzy
transform technique depends basically on Fuzzy Set Theory which was published in
1965 by Lotfi Zadeh [14], Fuzzy Set Theory is one of the most important theories, it
proved its ability in solving many problems, which encourage scientists to use it in
different fields [2, 14].
Fragments of the Fuzzy set theory has been used to establish a new field called
fuzzy approximation, focusing on approximation properties of fuzzy models. Fuzzy
transform is belonging to these models. Fuzzy transform has been proposed as a pilot
fuzzy approximation technique with the aim of being applied in up to now unusual
application fields such as numerical solution of differential equations [10].
Instead of wavelet transform, Martina and Radek [4] considered fuzzy transform

Paper Code: 27015 - IJAER

13668 Awni M. Abu-Saman and Huda S. EL-Zerii

as an alternative approach to the solution of image fusion problem.

F-transform introduces an approximate representation of continuous functions
defined on closed interval [ , ] ⊂ ℛ. this technique actually like other transforms,
consists of two transforms " direct F-transform and inverse F-transform".
The aim of this contribution is to present an alternative approach to the numerical
solution of differential equations.

2. Basic Concepts of Fuzzy Transform

Before introducing F-transform technique, we have to determine an interval [ , ] as a
common domain for all functions in our study, and partition this domain into
subintervals to define membership functions on [ , ] to introduce fuzzy sets on the
function domain , this operation is called "Fuzzy Partition " [8, 10, 11].

Definition 1 [9] Let = < <⋯< = be fixed nodes within =

[ , ] such that = , = and ≥ 2. we say that fuzzy sets , … , are basic
functions and form a fuzzy partition of if the following conditions hold true for
each = 1, … , :
1. : [ , ] → [0, 1], ( ) = 1
2. ( ) = 0 if ∉ ( , );
3. is continuous on ;
4. strictly increases on [ , ] and strictly decreases on [ , ];
5. ∑ ( )
x = 1, ∀x ∈ .
If the nodes ,…, are equidistant, then ℎ = , and = +
ℎ( − 1), ∀ = 1, … , so the following properties are hold:
6. ( − ) = ( + ), ∀ ∈ [0, ℎ], = 2, … , − 1, > 2
7. ( ) = ( − ℎ), ∀ ∈ [ + ℎ, ], = 2, … , − 1, > 2
8. ( + )= ( − ), ∀ ∈ [0, ℎ], = 1, … , − 1, ≥ 2

The most popular basic functions are triangular shaped basic functions and
sinusoidal shaped basic functions [14].
Now we give the definition of the F-transform and it’s inverse taken from [14]
for the one dimensional case, the definition also will be extended to the discrete case.

Definition 2[8] Let , … , be basic functions which form a fuzzy partition on

[ , ] and ∈ [ , . We say that the -tuple of real numbers [ , … , ] given by
]
∫ ( ) ( )
= , = 1, … , (3)
∫ ( )
is the direct integral Fuzzy transform of with respect to , … , .
And to transform the integral F-transform back we use the inverse F-transform
formula
Numerical Solution of Initial Value Problems using Fuzzy Transform 13669

, ( )= ( ) (4)

f the original function ( ) is known only at some nodes , … , ∈ [ , ], then we

can't use the direct F-transform in the previous definition, so we will need to use the
discrete F-transform which defined as follows.

Definition 3 [8] Let a function ( ) be given at nodes , … , ∈ [ , ]and

( ), . . . , ( ), ≪ , be basic functions which form a fuzzy partition of [ , ].
We say that the -tuple of real numbers [ , … , ] is the direct (discrete) F-transform
of with respect to , … , if
∑ ( )
= = 1, … , (5)
∑ ( )
And to transform the discrete F-transform back we use the same inverse F-
transform formula, but we consider that function only at points where the original
function is given as:

, ( )= ( ) , = 1, … , (6)

The inverse F-transform gives a continuous function, but we have to ensure that
this function uniformly converges to the original function . The sequence of the
inverse F-transform uniformly converges to the original function [11].

4. Numerical Implementation and Results

In this section, the F-transform numerical algorithm is implemented as a user
subroutine for MATLAB [5], the subroutine will be simulated and applied to second
Order Ordinary Differential Equations. For simplicity we will consider her a general
form of initial value problem with constant coefficients.
consider the second IVP of the form
′′ ( ) ′( )
= + ( ) + ( ), ≤ ≤ (7)
( )= , ( )= ′
(8)
where : [ , ] → ℛ is a continuous solution of equation (7)
Define the uniform partition = < <⋯< = with equidistant step
ℎ= on [ , ], and define a basic function { , … , } of [ , ], so we construct a
fuzzy partition.
Now by applying F-transform as a linear operator [7] on equation (7) we get
[ ′′] = [ ′] + [ ]+ [ ] (9)

where
[ ′′] = [ ′′ , ′′ , … , ′′ ] is the F-transform components of ′′,
[ ′ ] = [ ′ , ′ , … , ′ ] is the F-transform components of ′,
[ ] = [ , , … , ] is the F-transform components of , and
[ ] = [ , , … , ] is the F-transform components of .
13670 Awni M. Abu-Saman and Huda S. EL-Zerii

′′ ′
In equation (9), and are replaced by their finite differences.
′′
( + ℎ) − 2 ( ) + ( − ℎ)
≈
ℎ
and
′
( + ℎ) − ( )
≈
ℎ
so,
( + ℎ) − ( )
∫ ′ ( ) ∫ ( ) ( )
′
= ≈ ℎ
∫ ( ) ∫ ( )
1 ∫ ( + ℎ) ( ) ∫ ( ) ( )
= −
ℎ ∫ ( ) ∫ ( )
The above equation can be written as:
1
′ = ( − ) (10)
ℎ
Similarly,
1
′′ = ( −2 + ) (11)
ℎ
By substituting (10) and (11) into (7), the following recursive equation obtained
[ ( ℎ − ℎ + 2) − +ℎ
= (12)
(1 − ℎ )
= 2,3, … , − 1
By applying the F-transform to the initial conditions (8) and replacing by its
finite difference.
∫ ( ) ( )
= = (13)
∫ ( )
= ℎ+ (14)
Equations (12), (13), and (14) determine the F-transform components of =
[ , , … , ] . Finally; The F-transform inverse is used to get the continuous
approximation of .

Example 1 Consider the following IVP

′′ ( )
= ′+2 , 0 ≤ ≤ 2
(0) = 2, ′
(0) = 7
The analytical solution of the above problem is = 3 −
The above example is simulated on the mathematical code MATLAB [5] with F –
transform as a user-subroutine. Equations 13, 14, and 15 are used to find the F-
transform components of in our example with different partitions and different basis
shape functions. Results in Figs.(1-4) show that the computed solution of the above
example using the Sinusoidal shaped basic functions was not close to the analytical
solution, while the computed solution with triangular shaped basic functions are much
closer to the analytical solution and the error is smaller, Increasing the number of
Numerical Solution of Initial Value Problems using Fuzzy Transform 13671

partitions improve the computed solution and gets closer to the analytical solution as
n increases.

Fig.(1) The approximated solution with triangular shaped basic functions for
n=10

Fig.(2) =
13672 Awni M. Abu-Saman and Huda S. EL-Zerii

Fig.(3) The approximated solution with triangular shaped basic functions for
n=100

Fig.(4) =

Example 2 Consider the following IVP

′′ ( )
+8 ′ =9 , 0≤ ≤3
Numerical Solution of Initial Value Problems using Fuzzy Transform 13673

with the initial values (0) = 1 and ′ (0) = −19

The analytical solution of the above example is = − + 2
The solution of the above problem is also simulated in the mathematical code
MATLAB [5] with the F- Transform user subroutine, The F- Transform of the
components of y are computed from equations 12, 13 and 14for different partitions
and different shaped basic functions. Figures 5, 6, and 7 show the computed results
for different values of n with triangular shaped basic functions. The obtained results
indicates that computed solutions are closer to the analytical solution as the partition
number n increases, the best results obtained are for n=1000.

Fig.(5) The approximated solution with triangular shaped basic functions for
n=50

Fig.(6) The approximated solution with triangular shaped basic functions for
n=500
13674 Awni M. Abu-Saman and Huda S. EL-Zerii

Fig.(7) The approximated solution with triangular shaped basic functions for
n=1000

5. Conclusions
In this article, the F-transform was used to put a numerical algorithm for solving
Initial Value Problems, the algorithm is simulated on MATLAB as a user subroutine,
The F –transform enabled us to get a continuous formula for the IVPs. Despite the
difficulties of the computations, it's interesting to get a continuous solution of the
IVPs. With using the finite difference approximation for the derivative of the IVPs,
the obtained solution gets closer to the analytical solution as the number of partitions
n increases, which agrees well with the assertion of Burden, and Faires in [1].

References

[1] Burden, R., and Faires. J., 2011, Numerical Analysis, 9th edition, Brooks/Cole.
[2] Chen, G., Tat Pham, T., 2001, ‘Introduction to fuzzy set, fuzzy logic, and fuzzy
control system’, CRC Press.
[3] Dankova and Valasek, R., 2006 ‘Fuzzy transform and the problem of image
fusion’, Journal of Electrical Engineering , Vol. 57, No. 12.
[4] Martina, D., and Radek, V., 2006, ’Full fuzzy transform and the problem of
image fusion’, Journal of Electrical Engineering, No. 12, Vol. 57,
[5] MATLAB User’s Guide, 2013, Version 9, The Math Works Inc.,
[6] Patane, G., 2010, ‘fuzzy transform and least-squares approximation’, Elsevier.
[7] Perfilieva, I., 2003 ‘Fuzzy Transforms and Universal Approximation’,
Numerical Solution of Initial Value Problems using Fuzzy Transform 13675

EUSFLAT conference, PP 529-533.

[8] Perfilieva, I., 2005, ‘ Fuzzy transforms: Theory and applications’, Fuzzy Sets
and Systems, Vol. 157, No. 8, PP 003-1023.
[9] Perfilieva, I., 2007, ‘Fuzzy transforms in image compressions and fusion’ , Acta
Mathematica Universitatis Ostraviensis, Vol 15, No. 1, pp 27-37
[10] Perfilieva, I., and Valasek, R., 2005 ‘Data compression on the basis of fuzzy
transform’, EUSFLAT-LFA conference , PP 663-668.
[11] Perfilieva, I., Novak, V., and Dvorak, A., 2008 ‘Fuzzy Transform in the
analysis of data’, International Journal of Approximate Reasoning, Vol. 48, PP
36-46.
[12] Perfilieva, I., and Hodakova, P., 2011, ‘Fuzzy and Fourier Transforms’,
EUSFLAT-LFA conference, PP 452-456.
[13] Stefanini, L., 2009 ‘Fuzzy transform and smooth Functions’. IFSA-EUSFLAT
conference, PP 579-584.
[14] 1 Stepnika, M., 2007, ‘fuzzy transform and its Applications to problems in
engineering practice’, PH.D. Thesis "Ostrava Uni.".
[15] Zadah, L., 1965, ‘Fuzzy Sets’, Information and Control, Vol. 8, PP 338-353.
 13676 Awni M. Abu-Saman and Huda S. EL-Zerii

View publication stats