Next Article in Journal
Evaluation of Packaging Form Regarding Consumers’ Sentimental Response to Bottled Beverage Containers
Next Article in Special Issue
Adaptive Neuro-Fuzzy Inference System Based Grading of Basmati Rice Grains Using Image Processing Technique
Previous Article in Journal
A Review of Medication Adherence Monitoring Technologies

Metrics 0

## Export Article

Appl. Syst. Innov. 2018, 1(2), 15; doi:10.3390/asi1020015

Article
New Fuzzy Numerical Methods for Solving Cauchy Problems
1
Institute of Engineering Mathematics, Universiti Malaysia Perlis, Kampus Tetap Pauh Putra, Arau 02600, Perlis, Malaysia
2
Institute for Research and Applications of Fuzzy Modelling, University of Ostrava, NSC IT4Innovations, 30. dubna 22, 701 03 Ostrava, Czech Republic
*
Author to whom correspondence should be addressed.
Received: 7 April 2018 / Accepted: 3 May 2018 / Published: 11 May 2018

## Abstract

:
In this paper, new fuzzy numerical methods based on the fuzzy transform (F-transform or FT) for solving the Cauchy problem are introduced and discussed. In accordance with existing methods such as trapezoidal rule, Adams Moulton methods are improved using FT. We propose three new fuzzy methods where the technique of FT is combined with one-step, two-step, and three-step numerical methods. Moreover, the FT with respect to generalized uniform fuzzy partition is able to reduce error. Thus, new representations formulas for generalized uniform fuzzy partition of FT are introduced. As an application, all these schemes are used to solve Cauchy problems. Further, the error analysis of the new fuzzy methods is discussed. Finally, numerical examples are presented to illustrate these methods and compared with the existing methods. It is observed that the new fuzzy numerical methods yield more accurate results than the existing methods.
Keywords:
fuzzy partition; fuzzy transform; new iterative method; Cauchy problems

## 1. Introduction

In fact, most mathematical models in engineering and science requires the solution of ordinary differential equations (ODEs). Generally, it is difficult to obtain the closed form solutions for ODEs, especially, for nonlinear and nonhomogeneous cases. Many models often lead to ordinary differential equations which consist of Cauchy problems are an important branch of modern mathematics that arises naturally in different areas of applied sciences, physics, and engineering. Thus, many researchers start developing methods for solving Cauchy problems are of particular importance [1,2,3].
FT was coined by Perfilieva as a new mathematical method was developed [4]. The core idea of FT is a fuzzy partition of a universe into fuzzy subsets. The technique of FT has been successfully applied into other mathematical problems as well including image processing, analysis of time series and elsewhere [5,6,7]. This idea has been applied to Cauchy problems was first published as well as other numerical classical methods [8], by proposing generalized Euler and Euler- Cauchy methods, so that the Mid-point FT method was demonstrated in [9]. The success of these applications is due in part to the fact that FT is capable to accurately approximate any continuous function. Thus, we will propose new fuzzy numerical methods for Cauchy problems with help of the FT and new iterative method.
The motivation of the proposed study comes from the papers [3,8,10]. Numeric Solution to the Cauchy problem was considered and the authors showed that the error can be reduced by using FT with uniform fuzzy partitions [8,9]. At the same time, [10,11], the concept of generalized fuzzy partition was proposed. Besides others, a necessary and sufficient condition making it possible to design easily the generalized fuzzy partition was provided [12]. This is important for various practical applications of FT. Further [3], the authors have proposed modifications trapezoidal rule and Adams-Moulton methods (2 and 3-step) to solve ODEs based on the new iterative method was introduced [2].
In this paper, we discuss the problem that considered in [8,9]. The triangular and raised cosine generating function was replaced by new representations formulas for generalized uniform fuzzy partition of FT such as power of the triangular and raised cosine generating function. We study approximation properties of the FT based on powers of triangular and raised cosine generalized uniform fuzzy partition can be constructed in such way that the FT can reduce error. Also, we propose modifications in the FT introduced by I. Perfilieva [4] with respect to new representations formulas for generalized uniform fuzzy partition of FT and then the technique of FT is combined with traditional methods based on the new iterative method [2,3] to solve Cauchy problems. It is observed that the new methods proposed are more accurate results than the fuzzy approximation method [8,9].
This paper is organized as follows. In Section 2, we introduce the basic concepts and results of the FT with respect to the generalized uniform fuzzy partition needed throughout this paper. The main part of this paper is Section 3 and Section 4, new representations for basic functions of FT, followed by the modified one step, 2-step , and 3-step based on new representations formulas for generalized uniform fuzzy partition of FT. In Section 5, numeric examples are discussed. Concluding remarks are presented in Section 6.
Throughout the paper, we denote by $N$, $N +$, $Z$, $R$, and $R +$ the sets of natural (including zero), positive natural, integer, real , and positive real numbers, respectively.

## 2. Basic Concepts

In this section, we give some definitions and introduce the necessary notation in [10], which will be used throughout the paper. Throughout this section, we deal with an interval $a , b ⊂ R$ of real numbers.
Definition 1.
(generalized uniform fuzzy partition) Let $x i ∈ a , b , i = 1 , … , n ,$ be fixed nodes such that $a = x 1 < … < x n = b , n ≥ 2$. We say that the fuzzy sets $A i : a , b → 0 , 1$ constitute a generalized fuzzy partition of $a , b$ if for every $i = 1 , … , n$ there exists $h > 0$ such that $x 0 = x 1 , x n = x n + 1 ,$ $x i − h , x i + h ⊆ a , b$ and the following conditions are fulfilled:
1.
(positivity and locality) – $A i x > 0$ if $x ∈ x i − 1 , x i + 1$ and $A i x = 0$ if $x ∈ a , b \ x i − 1 , x i + 1$;
2.
(continuity) – $A i$ is continuous on $x i − 1 , x i + 1$;
3.
(covering) – for $x ∈ a , b , ∑ i = 1 n A i ( x ) > 0$.
Fuzzy sets $A 1 , … , A n$ are called basic functions. It is important to remark that by conditions of locality and continuity, $∫ a b A i ( x ) d x > 0$. A generalized of uniform fuzzy partition of $a , b$ is defined for equidistant nodes, i.e., for all $i = 1 , … , n − 1 , x i = x i + 1 + h ,$ where $h = b − a / n − 1$ and two additional properties are satisfied,
4.
$A i x i − x = A i x i + x$ for all $x ∈ 0 , h , i = 2 , … , n − 1$;
5.
$A i x = A i − 1 x − h$ and $A i + 1 x = A i x − h$ for all $x ∈ x i , x i + 1 , i = 2 , … , n − 1$;
then the fuzzy partition is called h-uniform generalized fuzzy partition. Throughout this paper, we will write generalized uniform fuzzy partition instead of h-uniform generalized fuzzy partition.
Definition 2.
(generating function) A function $K : − 1 , 1 → 0 , 1$ is called a generating function if it is assumed to be even, continuous and $K x > 0$ if $x ∈ − 1 , 1$. The function $K : − 1 , 1 → R$ is even if for all $x ∈ 0 , 1 , K − x = K x$.
The following definition recall the concept of generalized fuzzy partition which can be easily extended to the interval $a , b$. We assume that $a , b$ is partitioned by $A 1 , … , A n$, according to Definition 1.
Definition 3.
A generalized uniform fuzzy partition of interval $a , b$, determined by the triplet $K , h , a$, can be defined using generating function K (Definition 2). Then, basic functions of a generalized uniform fuzzy partition are shifted copies of K defined by
$A i x = K x − x i h , x ∈ x i − h , x i + h ,$
for all $i = 1 , … , n$. The parameter h is called the bandwidth or the shift of the fuzzy partition and the nodes $x i = a + i h$ are called the central point of the fuzzy sets $A 1 , … , A n$.
Remark 1.
A fuzzy partition is called Ruspini if the following condition
$A i x + A i + 1 x = 1 , i = 1 , … , n − 1 ,$
holds for any $x ∈ x i , x i + 1$. This condition is often called Ruspini condition.

## 3. New Representations of Basic Functions for Particular Cases

In this section, we propose two subsection, new representations of basic functions constitute a generalized uniform fuzzy partition of interval $a , b$ and then FT technique based on new representations of basic functions.

#### 3.1. Power of the Triangular and Raised Cosine Generalized Uniform Fuzzy Partition

Two types of basic functions, triangular and sinusoidal shaped membership functions, were proposed by [4,8]. Later [13], the authors considered different shapes for the basic functions of fuzzy partition. Furthermore, a generalized fuzzy partition appeared in connection with the notion of a higher-degree F-transform [11]. Its even weaker version was implicitly introduced to satisfy the requirements of image compression [14]. Recently, the different conditions for generalized uniform fuzzy partitions was proposed by [10,12]. Table 1 provides the definition two types of generating function, triangular and raised cosine generating functions [7,10,11,12,15].
In the following, we present new representations for generating function. In particular, we present three new representations, based on the triangular and raised cosine generating functions: two generating function based on the triangular generating functions and one generating function based on the raised cosine generating function.
Definition 4.
(natural order triangular generating function) Let $K T i m : R → 0 , 1$, $i = 1 , 2$, be defined by
$1 . K T 1 m x = 1 − x m , x ≤ 1 , 0 , o t h e r w i s e = min 1 − x m , 1 ,$
$2 . K T 2 m x = 1 − x m , x ≤ 1 , 0 , o t h e r w i s e = min 1 − x m , 1 ,$
are called power of the triangular (shaped) generating functions, when $m ∈ N +$.
Definition 5.
(odd natural order raised cosine generating function) Let $K C m : R → 0 , 1$ be defined by
$K C m x = 1 2 1 + cos m π x , x ≤ 1 ; 0 , o t h e r w i s e .$
is called power of the raised cosine generating function , when m is an odd natural number $i . e . , m = 2 k − 1 , k ∈ N +$.
Remark 2.
Particularly, we can check the validity of Equation (4) using the following relation
$K C m x = 1 2 1 + cos m π x , x ≤ 1 , 0 , o t h e r w i s e . = 1 2 1 + sin m π 2 2 x + 1 , x ≤ 1 , 0 , o t h e r w i s e .$
Lemma 1.
If $K T i n x , i = 1 , 2 ,$ $K C m x$ determines power of the triangular (raised cosine) generating functions, then
$1 . ∫ − 1 1 K T 1 n x d x = 2 n + 1 , 2 . ∫ − 1 1 K T 2 n x d x = 2 n n + 1 , 3 . ∫ − 1 1 K C m x d x = 1 ,$
or equivalent
$1 . ∫ − h h K T 1 n t h d t = 2 h n + 1 , 2 . ∫ − h h K T 2 n t h d t = 2 n h n + 1 , 3 . ∫ − h h K C m t h d t = h ,$
where $0 ≤ 2 n + 1 ≤ 1 , 1 ≤ 2 n n + 1 ≤ 2$ , h be positive real numbers, m is an odd natural number and $n ∈ N +$.
Proof.
The proof can be easily obtained by using integration methods within the boundaries and then substitution $x = t / h$. ☐
On the basis of Definitions 4 and 5, Lemma 1, and according to Definition 3, we can also be defined using generating function $α K$ for $α > 0$ (in general, not necessarily satisfy Ruspini condition). Thus, basic functions of a generalized uniform fuzzy partition are shifted copies of $α K$ defined by
$A k x , x 0 = α K x − x 0 h − k , x ∈ x i − 1 , x i + 1 .$
In particular, let $K T 1 m , K T 2 m , and K C m$ be power of the triangular (and raised cosine) generating function defined above. We will say that a generalized uniform fuzzy partition is power of a triangular (or of raised cosine) generalized uniform fuzzy partition if its generating function K belongs to $α K T 1 m$, $α K T 2 m$, $o r α K C m$ whenever $α = 1 / ∫ − 1 1 K ( t ) d t$. Indeed, the equality $α$ immediately follows from $∫ − 1 1 α K T 1 m t d t = 1 ⇒ α = 1 / ∫ − 1 1 K T 1 m t d t$. In the following, we modified the definition a triangular and raised cosine generalized uniform fuzzy partition by propose that power of the triangular and raised cosine generalized uniform fuzzy partitions can be simply using the equality $α = 1 / ∫ − 1 1 K ( t ) d t$.
Definition 6.
Let $m ∈ N +$. A system of fuzzy sets $A k ∣ k ∈ Z$ defined by
$1 . A k x , x 0 = α K T 1 m x − x 0 h − k , α = m + 1 2 ,$
$2 . A k x , x 0 = α K T 2 m x − x 0 h − k , α = m + 1 2 m ,$
is called power of the triangular generalized uniform fuzzy partition of the real line determined by the triplet $( K T i m , h , x 0 ) , i = 1 , 2$. Further, let m is an odd natural number. A system of fuzzy sets $A k ∣ k ∈ Z$ defined by
$3 . A k x , x 0 = α K C m x − x 0 h − k , α = 1 ,$
is called power of the raised cosine generalized uniform fuzzy partition of the real line determined by the triplet $( K C m , h , , x 0 )$. The parameter h is bandwidth of the fuzzy partition and $x 0 + k h = x k$.
Definition 7.
Let $x 1 < … < x n$ be fixed nodes within $a , b ⊂ R$, such that $x 1 = a$, $x n = b$ and $n ≥ 2$. We consider nodes $x 1 , … , x n$ are equidistant, with distance (shift) $h = b − a / n − 1$. A system of fuzzy sets $B 1 , … , B n : a , b → 0 , 1$ be power of a triangular and raised cosine generalized uniform fuzzy partitions of $a , b$ if it is defined by
$B k x = A k ( x , a ) , x ∈ a , b , 0 , o t h e r w i s e . o r e q u i v a l e n t B k x = α K x − x k h , x ∈ a , b , 0 , o t h e r w i s e .$
where $x k = a + k h$. In the sequel, we denote K for a generating function determined by the Formulas (2)–(4). Further, α, $A k ( x , a ) , k = 1 , … , n$, are determined by the Formulas (6)–(8).
Lemma 2.
If $B k x$ determines power of the raised cosine generalized uniform fuzzy partition of$a , b$, then $B k x$ satisfied Ruspini condition (1) when m (see (4) ) is an odd natural number.
Proof.
Indeed, if $x ∈ a , b$, there exists $k ∈ 1 , … , n − 1$ such that $x ∈ x k , x k + 1$. By (4) and (8), and Remark 1, we get
$B k x + B k + 1 x = A k ( x , a ) + A k + 1 ( x , a ) = α K C m x − x k h + α K C m x − x k + 1 h , = 1 2 1 + cos m π x − x k h + 1 2 1 + cos m π x − x k + 1 h , = 1 + 1 2 cos m π h x − x k + cos m π h x − x k + 1 .$
By the properties of trigonometric functions, notice that $cos θ + π = − cos θ$ , it is easy to see that
$cos m π x − x k h + cos m π x − x k + 1 h = cos m π x − x k + 1 h + π + cos m π x − x k + 1 h .$
Thus, if m is an odd natural number, the result is 0. ☐
In the following, if K is a normal generating function (i.e., $K ( 0 ) = 1$, not necessarily satisfy Ruspini condition), we use generating function $α K$ for $α > 0$, where $α K x = α · K x$.
Lemma 3.
If basic functions $B k , k = 1 , … , n ,$ of a generalized uniform fuzzy partition are shifted copies of $α K , α > 0 ,$ defined by the Formula (5) and moreover, K is normal as an additional condition. Then, for each $k = 1 , … , n , B k ( x k ) = α , x k ∈ x k − h , x k + h$.
Proof.
A generating function K is said to be normal if $K ( 0 ) = 1$. By the Formula (5) and a generating function K is normal, we get $B k x k = α K x k − x k h = α K ( 0 ) = α > 0 .$ ☐
Corollary 1.
Let the assumptions of Lemma 3 be fulfilled, but fuzzy sets $B k , k = 1 , … , n , n ≥ 2 ,$ determined by Definition 7. Then, $f o r e a c h k = 1 , … , n , B k ( x k ) = α , x k ∈ x k − h , x k + h$, where α is defined by Definition 7.
Proof.
Indeed, the proof immediately follows from Definition 7 and Lemma 3. ☐
Corollary 2.
Let the assumptions of Lemma 3 be fulfilled, but fuzzy sets $B k , k = 1 , … , n , n ≥ 2 ,$ determined by Definition 3. Then, for each $k = 1 , … , n$, $B k ( x k ) = 1 , x k ∈ x k − h , x k + h$.

#### 3.2. New FT Based Power of the Triangular and Raised Cosine Generalized Uniform Fuzzy Partition

In this subsection, we present the main principles of F-transform detailed in [8,10,11] that are modified with respect to power of the triangular and raised cosine generalized uniform fuzzy partition. Further, we will show that FT components with respect to power of the triangular and raised cosine generalized uniform fuzzy partition can be simplified and approximated of an original function, say f.
Definition 8.
Let f be a continuous function on $a , b$ and $B k ( t )$, $k = 1 , … , n$, be power of the triangular and raised cosine generalized uniform fuzzy partition of $a , b$ , $n ≥ 2$. A vector of real numbers $F [ f ] = F 1 , F 2 , … , F n$ given by
$F k = ∫ a b f t B k ( t ) d t ∫ a b B k ( t ) d t ,$
for $k = 1 , … , n$ is called the direct FT of f with respect to power of the triangular and raised cosine generalized uniform fuzzy partition $B k$.
In the following, we assume a generating function K in the Formulas (2)–(4). We will simplify the representation (10).
Lemma 4.
Let $f ∈ C a , b$ and according to Definition 7, fuzzy sets $B k , k = 1 , … , n , n ≥ 2 ,$ be power of a triangular and raised cosine generalized uniform fuzzy partition of $a , b$ with a generating function K, then representation (10) of direct FT can be simplified as follows for $k = 1 , … , n$
$F k = ∫ − 1 1 f t h + t k K ( t ) d t ∫ − 1 1 K ( t ) d t = ∫ − h h f t + t k K ( t h ) d t ∫ − h h K ( t h ) d t .$
Proof.
In this proof, we will write a generating function K instead of (2)–(4). By Definition 7, we get
$B k t = α K t − t k h , t ∈ t k − h , t k + h ,$
for $k = 1 , … , n$ , $t 0 = t 1 , t n + 1 = t n$ , and substituting $u = t − t k h$ and then substituting $t = s / h$ . Thus, we get
$∫ t k − 1 t k + 1 f t B k ( t ) d t = α h ∫ − 1 1 f t h + t k K ( t ) d t = α ∫ − h h f t + t k K ( t h ) d t$
$∫ t k − 1 t k + 1 B k ( t ) d t = α h ∫ − 1 1 K ( t ) d t = α ∫ − h h K ( t h ) d t$
and its corresponding results with representation (10). ☐
Indeed, the previous lemma holds for every fuzzy partition generated by a kernel. Now, we will simplify the above given expressions for the coefficients $F [ f ] = F 1 , F 2 , … , F n$ in the representation (10) even more. This fact is very important for applications which are more flexible and consequently easier to use.
Lemma 5.
Let the assumptions of Lemma 4 be fulfilled. Then, the coefficients $F [ f ] = F 1 , F 2 , … , F n$ in the expression (10) of the FT component $F k$ of f as follows:
$F k = 1 h ∫ a b f t B k ( t ) d t = α h ∫ a b f t K t − t k h d t ,$
for $k = 1 , … , n$, where interval $a , b$ is partitioned by power of the triangular and raised cosine generalized uniform fuzzy partition $B 1 , … , B n$ and α is defined by Definition 7.
Proof.
Let $k ∈ 1 , … , n$ and consider set of fuzzy sets $B k ( x )$ from power of the triangular and raised cosine generalized uniform fuzzy partition of $a , b$ in (9). We will prove the equality $∫ t k − 1 t k + 1 B k ( t ) d t = h$. We get by virtue of Lemmas 1 and 4, and (6):
$∫ t k − 1 t k + 1 B k ( t ) d t = ∫ t k − 1 t k + 1 A k ( t , a ) , d t = ∫ t k − h t k + h m + 1 2 K T 1 m t − t k h d t = h ∫ − 1 1 m + 1 2 K T 1 m t d t = h ,$
where h is the bandwidth of the fuzzy partition and $t k = a + k h$. Similarly, the other Formulas (7) and (8) will be proved and then its corresponding in the expression (10). ☐
Lemma 6.
Let $f ∈ C a , b$. Then for any $ε > 0$ there exist $n ε ∈ N$ and $B 1 , … , B n ε$ be basic functions form power of the triangular and raised cosine generalized uniform fuzzy partition of $a , b$. Let $F k , k = 1 … , n ,$ be the integral FT components of f with respect to $B 1 , … , B n ε$. Then for each $k = 1 … , n ε − 1$ the following estimations hold: $f ( t ) − F i ≤ ε$ for each $t ∈ a , b ∩ t k , t k + 1$ and $i = k , k + 1$.
Proof.
See [4]. ☐
Corollary 3.
Let the conditions of Lemma 6 be fulfilled. Then for each $k = 1 … , n ε − 1$ the following estimations hold: $F k − F k + 1 < ε$.
Proof.
According to [4,16], let $t ∈ a , b ∩ t k , t k + 1$. Then by Lemma 6, for any $k = 1 , … , n − 1$ we obtain $f t − F k < ε / 2 a n d f t − F k + 1 < ε / 2 . T h u s , F k − F k + 1 ≤ f t − F k + f t − F k + 1 < ε 2 + ε 2 = ε .$ ☐
The following theorem estimates the difference between the original function and its direct FT with respect to power of the triangular and raised cosine generalized uniform fuzzy partition.
Theorem 1.
Let $f t ∈ C 2 a , b$ and the conditions of Lemma 5 be fulfilled. Then for $k = 1 , … , n$
$F k = α f t k + O h 2 ,$
where $α > 0$ or α is defined by Definition 7.
Proof.
By locality condition for Definition 1, Lemmas 3 and 5, and according to the proof of Lemma 9.3 [8], using the trapezoid formula with nodes $t k − 1 , t k , t k + 1$ to the numerical computation of the integral, we get $f o r α > 0$
$F k = 1 h ∫ t k − 1 t k + 1 f t B k ( t ) d t , = 1 h . h 2 f t k − 1 B k ( t k − 1 ) + 2 f t k B k ( t k ) + f t k + 1 B k ( t k + 1 ) + O h 2 , = f t k B k ( t k ) + O h 2 = f t k A k ( t k , a ) + O h 2 , = f t k α K 0 + O h 2 , = α f t k + O h 2 .$
☐
Definition 9.
Let $F [ f ] = F 1 , F 2 , … , F n$ be direct FT of a function $f ∈ C a , b$ with respect to the fuzzy partition $B k ( t )$, $k = 1 , … , n$ of $a , b$. Then, the function $f ^$ defined on $a , b$
$f ^ t = ∑ k = 1 n F k B k ( t ) ∑ k = 1 n B k ( t ) ,$
is called the inverse FT of f.
Corollary 4.
Let the assumptions of Lemma 2 and moreover, Let $f ^ t$ be the inverse FT of f with respect to power of the raised cosine generating function . Then, for all $t ∈ a , b$ the following holds:$f ^ t = ∑ k = 1 n F k B k ( t ) .$
Proof.
This proof immediately follows from Defintion 9, Lemma 2 and then using $∑ k = 1 n B k ( t ) = 1$. ☐
The following lemma estimates the difference between the original function and its inverse FT.
Lemma 7.
Let the assumptions of Theorem 1 and let $f ^ t$ be the inverse FT of f with respect to the fuzzy partition of $a , b$ is given by Definition 7. Then, for all $t ∈ a , b$ the following estimation holds:
$f ^ t = α f t k + O h 2 .$
Proof.
Let $t ∈ a , b$ so that $x ∈ t k , t k + 1$ for some $k = 1 , … , n$. By Theorem 1,
$f ^ t − α f t k = ∑ k = 1 n F k B k ( t ) ∑ k = 1 n B k ( t ) − α f t = ∑ k = 1 n F k B k ( t ) ∑ k = 1 n B k ( t ) − ∑ k = 1 n α f t k B k ( t ) ∑ k = 1 n B k ( t ) = ∑ k = 1 n F k − α f t k B k ( t ) ∑ k = 1 n B k ( t ) = O h 2 .$
☐
Corollary 5.
Let the assumptions of Lemma 7, then $f ^ t − f t < ε .$
Proof.
The proof easily follows from the proof of Lemma 7 and then using Lemma 6 as follows:
$f ^ t − f t = ∑ k = 1 n F k − f t B k ( t ) ∑ k = 1 n B k ( t ) < ε .$
☐
Remark 3.
According to the Definitions 1 and 2, if the normality is considered to be an additional condition for generating function (i.e., $K ( 0 ) = 1$) and generalized uniform fuzzy partition of $a , b$ satisfies $A k ( x k ) = α , α > 0$, then it is easy to see that the inverse FT $f ^ t k = F k$ for all $k = 1 , … , n$. This is true for Definition 7. Moreover, if orthogonality condition (Ruspini condition (1)) is replaced by covering condition in Definition 1 and generalized uniform fuzzy partition of $a , b$ satisfies $A k ( x k ) = α = 1$, then it is easy to also see that the inverse FT $f ^ t k = F k$ for all $k = 1 , … , n$. This is true for Formula (8) only.
Important property of the direct FT as well as inverse FT is their linearity, namely, given $f , g ∈ C a , b$ and $α , β ∈ R$, if $h = α f + β g$, then $F h = α F f + β F g$ and $h ^ = α f ^ + β g ^$. In the next section, we present new fuzzy numerical methods based on the FT and a new iterative method to numeric solution of the Cauchy problem.

## 4. New Fuzzy Numerical Methods for Cauchy Problem

Consider the initial value problem (IVP) for the Cauchy problem:
$y ′ = f ( t , y ) , y ( t 1 ) = y 1 , a = t 1 ≤ t ≤ t n = b .$
where $y 1 ∈ R$ and f is continuous function on $a , b × R$ and satisfies Lipschitz condition. In fact, the analytical solution of problem (15) is often difficult and sometimes impossible to obtain. Instead, numerical analysis is interested with obtaining approximate solutions with errors within reasonable bounds. Thus, a usage of fuzzy numerical methods seems to be suitable.
In [8,9], the authors have presented Euler method and Mid-point rule, based on FT to numeric solution of Cauchy problem (15). A new iterative method (NIM) has been proposed for solving linear (nonlinear) functional equations, ordinary differential equations and delay differential equations [2,3].
In this section, we present three new schemes to solve Cauchy problem (15), that use the FT and NIM. Our motivation stems from the classical approach, trapezoidal rule (1-step) and Adams Moulton methods (2 and 3-step). For the rest of this paper, suppose that we are given the Cauchy problem (15), where the function f on $a , b$ are sufficiently smooth and we assume that all necessary requirements for constructing the FT of the solution of Cauchy problem (15) are fulfilled. Now, we present numerical Scheme I, II, and III. The first scheme uses 1-step method, while the second one uses 2-step method, and the third uses 3-step method.

#### 4.1. Numeric Scheme I: Modified Trapezoidal Rule Based on FT and NIM for Cauchy Problem

In the present subsection, we will construct a numeric scheme of the more advanced method known as the Trapezoidal Rule. Recall that it is a one-step method with second-order accuracy, which can be considered as a Runge–Kutta method. We propose modification of trapezoidal rule based on FT and NIM for solving Cauchy problem. Modification of the trapezoidal rule can be improved by the FT to solve Cauchy problem (15). We contributed to numeric methods of Cauchy problem (15) by scheme provides formulas for the FT components, $Y k$, $k = 2 , … , n − 1$, of the unknown function $y ( t )$ with respect to choose some power of the triangular (or raised cosine) generalized uniform fuzzy partition, $B 1 , … , B n$, of interval $a , b$ with parameter h to approximate solution of Cauchy problem (15). The first, choose the number $n ≥ 2$ and compute $h = b − a / n − 1$, then construct the generalized uniform fuzzy partition of $a , b$ using Definition 7. Note that each function $B k$ spans over three nodes $t k − 1 , t k , t k + 1 , k = 2 , … , n − 1 .$ Nevertheless, $B k ( t k − 1 ) = B k ( t k + 1 ) = 0$ and $B k ( t k ) = 1$. Now, we apply the FT and NIM to Cauchy problem (15) and obtain the numeric Scheme I for $k = 1 , … , n − 1$ as follows (see [3,8] for technical details):
$Y 1 = y 1 , Y k + 1 ∗ = Y k + h F k / 2 , Y k + 1 ∗ ∗ = Y k + 1 ∗ + h F k + 1 ∗ / 2 , Y k + 1 = Y k + h F k + F k + 1 ∗ ∗ / 2 ,$
where
$F k = ∫ a b f ( t , Y k ) B k ( t ) d t ∫ a b B k ( t ) d t , F k + 1 ∗ = ∫ a b f ( t , Y k + 1 ∗ ) B k + 1 ( t ) d t ∫ a b B k + 1 ( t ) d t , F k + 1 ∗ ∗ = ∫ a b f ( t , Y k + 1 ∗ ∗ ) B k + 1 ( t ) d t ∫ a b B k + 1 ( t ) d t .$
In the sequel, the approximate solution of Cauchy problem (15) can be obtained using the inverse FT as follows:
$y n ( t ) = ∑ k = 1 n Y k B k ( t ) .$

#### 4.2. Numeric Scheme II: Modified 2-Step Adams Moulton Method Based on FT and NIM for Cauchy Problem

The Scheme I uses 1-step method for solving Cauchy problem (15). In this subsection, we improve 2-step Adams Moulton method using FT and NIM for solving Cauchy problem (15). The 2-step Adams Moulton method can be improved to effectively approximate the solution of (15) by the FT components, $Y k$, $k = 2 , … , n − 1$, of the unknown function $y ( t )$ with respect to choose some power of the triangular (or raised cosine) generalized uniform fuzzy partition (9). Let $Y 1 = y 1$ and $Y 2 = y 2$ if possible; otherwise, we can compute FT component $Y 2$ from numeric Scheme I. Analogously to [3,8], we apply the FT and NIM to Cauchy problem (15) and obtain the numeric Scheme II in the following form for $k = 2 , … , n − 1$:
$Y k + 1 ∗ = Y k + h 8 F k − F k − 1 / 12 , Y k + 1 ∗ ∗ = Y k + 1 ∗ + 5 h F k + 1 ∗ / 12 , Y k + 1 = Y k + h 8 F k − F k − 1 + 5 F k + 1 ∗ ∗ / 12 ,$
where
$F k − 1 = ∫ a b f ( t , Y k − 1 ) B k − 1 ( t ) d t ∫ a b B k − 1 ( t ) d t , F k = ∫ a b f ( t , Y k ) B k ( t ) d t ∫ a b B k ( t ) d t , F k + 1 ∗ = ∫ a b f ( t , Y k + 1 ∗ ) B k + 1 ( t ) d t ∫ a b B k + 1 ( t ) d t , and F k + 1 ∗ ∗ = ∫ a b f ( t , Y k + 1 ∗ ∗ ) B k + 1 ( t ) d t ∫ a b B k + 1 ( t ) d t .$
Then, obtain the desired approximation for y by the inverse FT (18) applied to $Y 1 , … , Y n$.

#### 4.3. Numeric Scheme III: Modified 3-Step Adams Moulton Method Based on FT and NIM for Cauchy Problem

In this subsection, we improve 3-step Adams Moulton method using FT and NIM for solving Cauchy problem (15). The 3-step Adams Moulton method can be improved to effectively approximate the solution of (15) by the FT components, $Y k$, $k = 2 , … , n − 1$, of the unknown function $y ( t )$ with respect to choose some power of the triangular (or raised cosine) generalized uniform fuzzy partition (see Definition 7), $B 1 , … , B n$, of interval $a , b$ with parameter $h = b − a / n − 1$ , $n ≥ 2$. Let $Y 1 = y 1$, $Y 2 = y 2$ and $Y 3 = y 3$ if possible; otherwise, we can compute FT components $Y 2 a n d Y 3$ from numeric Scheme I. Now, we apply the FT and NIM to Cauchy problem (15) and obtain the following numeric Scheme III for $k = 3 , … , n − 1$ (see [3,8] for technical details):
$Y k + 1 ∗ = Y k + h 19 F k − 5 F k − 1 + F k − 2 / 24 , Y k + 1 ∗ ∗ = Y k + 1 ∗ + 9 h F k + 1 ∗ / 24 , Y k + 1 = Y k + h 19 F k − 5 F k − 1 + F k − 2 + 9 F k + 1 ∗ ∗ / 24 ,$
where
$F k − 2 = ∫ a b f ( t , Y k − 2 ) A k − 2 ( t ) d t ∫ a b A k − 2 ( t ) d t , F k − 1 = ∫ a b f ( t , Y k − 1 ) A k − 1 ( t ) d t ∫ a b A k − 1 ( t ) d t , F k = ∫ a b f ( t , Y k ) A k ( t ) d t ∫ a b A k ( t ) d t , F k + 1 ∗ = ∫ a b f ( t , Y k + 1 ∗ ) A k + 1 ( t ) d t ∫ a b A k + 1 ( t ) d t , and F k + 1 ∗ ∗ = ∫ a b f ( t , Y k + 1 ∗ ∗ ) A k + 1 ( t ) d t ∫ a b A k + 1 ( t ) d t .$
In the sequel, the inverse FT (18) approximates the solution $y ( t )$ of the Cauchy problem (15).

#### 4.4. Error Analysis of Fuzzy Numeric Method for Cauchy Problem

In this subsection, we present error analysis for numeric scheme I only, because the technique of error analysis for rest numeric schemes (Schemes II and III) can be obtained analogously. Consider the Formula (16). If $y ( t k ) = y k$ and $Y k$ denote the exact solution and the numerical solution and substituting the exact solution in the Formula (16), we get
$y k + 1 ∗ = y k + h F k e / 2 , y k + 1 ∗ ∗ = y k + 1 ∗ + h F k + 1 e ∗ / 2 , y k + 1 = y k + h F k e + F k + 1 e ∗ ∗ / 2 ,$
where
$F k e = ∫ a b f ( t , y k ) B k ( t ) d t ∫ a b B k ( t ) d t , F k + 1 e ∗ = ∫ a b f ( t , y k + 1 ∗ ) B k + 1 ( t ) d t ∫ a b B k + 1 ( t ) d t , F k + 1 e ∗ ∗ = ∫ a b f ( t , y k + 1 ∗ ∗ ) B k + 1 ( t ) d t ∫ a b B k + 1 ( t ) d t ,$
and the truncation error $T k$ of the Scheme I is given by
$T k = y k + 1 − y k h − 1 2 F k e + F k + 1 e ∗ ∗ .$
Rearranging (16), we get
$0 = Y k + 1 − Y k h − 1 2 F k + F k + 1 ∗ ∗ .$
If we denote the error $e k + 1 = Y k + 1 − y k + 1$ and subtracting (24) from (23), so:
$T k h = e k + 1 − e k − h 2 F k − F k e − h 2 F k + 1 ∗ ∗ − F k + 1 e ∗ ∗ .$
Lemma 8.
Let f is assumed to be sufficiently smooth function of its arguments on $a , b$ and satisfies the Lipschitz condition with the constant L with respect to y, then we get for $k = 1 , … , n$,
$e k + 1 ≤ e k 1 + c + T h and F k e − F k + 1 e ∗ ∗ ≤ L h M 2$
where $c = h L + h 2 L 2 2 + h 3 L 3 8$, $T = max 1 ≤ k ≤ n T k$, $M 2$ is upper bound for f , and $F k e , F k + 1 e ∗ ∗$ are determined by Formula (22).
Proof.
By hypothesis, f satisfies the Lipschitz condition and using Lemma 5, Formulas (16), (17), (21) and (22), we get
$F k − F k e ≤ 1 h ∫ a b f ( t , Y k ) B k ( t ) d t − ∫ a b f ( t , y k ) B k ( t ) d t ≤ L e k F k + 1 ∗ − F k + 1 e ∗ ≤ 1 h ∫ a b f ( t , Y k + 1 ∗ ) B k + 1 ( t ) d t − ∫ a b f ( t , y k + 1 ∗ ) B k + 1 ( t ) d t ≤ L Y k + 1 ∗ − y k + 1 ∗ F k + 1 ∗ ∗ − F k + 1 e ∗ ∗ ≤ 1 h ∫ a b f ( t , Y k + 1 ∗ ∗ ) B k + 1 ( t ) d t − ∫ a b f ( t , y k + 1 ∗ ∗ ) B k + 1 ( t ) d t ≤ L Y k + 1 ∗ ∗ − y k + 1 ∗ ∗ Y k + 1 ∗ − y k + 1 ∗ ≤ Y k + h F k / 2 − y k + h F k e / 2 ≤ e k 1 + h L 2 Y k + 1 ∗ ∗ − y k + 1 ∗ ∗ ≤ Y k + 1 ∗ + h F k + 1 ∗ / 2 − y k + 1 ∗ + h F k + 1 e ∗ / 2 ≤ e k 1 + h L 2 2 e k + 1 ≤ e k + h L 2 e k + h L 2 y k + 1 ∗ ∗ − Y k + 1 ∗ ∗ + T h ≤ e k + h L 2 e k + h L 2 e k 1 + h L 2 2 + T h = e k 1 + h L + h 2 L 2 2 + h 3 L 3 8 + T h$
Furthermore, by using $f ( t , y ( t ) ) ≤ M 2$, we get
$F k e − F k + 1 e ∗ ∗ = 1 h ∫ a b f ( t , y k ) − f ( t + h , y k + 1 ∗ ∗ ) B k ( t ) d t = 1 h ∫ a b f ( t , y k ) − f ( t , y k + 1 ∗ ∗ ) + f ( t , y k + 1 ∗ ∗ ) − f ( t + h , y k + 1 ∗ ∗ ) B k ( t ) d t ≤ L y k − y k + 1 ∗ ∗ = L h 2 − F k e − F k + 1 e ∗ = L h 2 1 h ∫ a b f ( t , y k ) + f ( t , y k + 1 ∗ ) B k ( t ) d t ≤ L h M 2$
This completes the proof. ☐
Theorem 2.
Consider the the numeric Scheme I (16), where $f ∈ C 2 a , b$ and satisfies the Lipschitz condition with the constant L with respect to y. Then, the solution $Y k , k = 1 , … , n ,$ obtained by the numeric scheme I (16) for solving Cauchy problem (15) satisfies
$e k = Y k − y k ≤ h M 2 L e k c ,$
where$c = h L + h 2 L 2 2 + h 3 L 3 8$, $M 1 , M 2$ are upper bound for $f ′ , f$ , respectively, on $[ a , b ]$, and $M 1 + M 2 L = M$.
Proof.
By hypothesis, $y ″$ exists and bounded on $a , b$ with $max a ≤ t ≤ b y ″ t = M 1$ by assuming that $f ∈ C 2 a , b$. Then, using Lemma 8, (23) and Taylor’s theorem for $k = 1 , … , n − 1$, we get
$T k = y k + 1 − y k h − 1 2 F k e + F k + 1 e ∗ ∗ = 1 2 h y ″ ξ k + f ( t k , y k ) − 1 2 F k e + F k + 1 e ∗ ∗ = 1 2 h y ″ ξ k + f ( t k , y k ) − F k e + 1 2 F k e − 1 2 F k + 1 e ∗ ∗ = 1 2 h y ″ ξ k + 1 2 F k e − F k + 1 e ∗ ∗$
where $ξ k ∈ t k , t k +$. Now, using Lemma 8
$T = max 1 ≤ k ≤ n T k ≤ 1 2 h y ″ ξ k + L h M 2 2 ≤ h 2 M 1 + L M 2 = h M 2$
Now, by virtue of Lemma 8 and we have used $e 1 = 0$, $( 1 + c ) k ≤ e k c$, we get for $k = 1 , … , n$
$e k ≤ 1 + c k − 1 c T h ≤ 1 + c k L + h L 2 2 + h 2 L 3 8 T ≤ T L e k c ≤ h M 2 L e k c$
where $c = h L + h 2 L 2 2 + h 3 L 3 8$. Thus, if the step length $h → 0$, then for all k, the error,$e k$ converges to zero. So the method is convergent. This completes the proof. ☐

## 5. Numerical Examples

In this section, we present examples of the Cauchy problem (15).
Example 1.
Consider the following initial value problem with initial conditions $y 0 = 1$ and with a smooth right-hand function
$y ′ ( t ) = t 2 − y , t ∈ 0 , 2 .$
Example 2.
Consider the Cauchy problem (15) with oscillating right-hand function. We take $f ( t , y ) = 1 +$$2 y cos t 2 + sin 2 t 2 , t ( π 2 ) = 2 . 1951 , a = π 2 a n d b = 3 π 2$.
The results are listed in Table 2, Table 3 and Table 4 by fuzzy numerical methods proposed in this paper with respect to case $K T 1 201$ and Table 5 by fuzzy numerical methods proposed in this paper with respect to case $K T 1 1 , K T 1 3 , K T 1 201 , K C 1$. The Euclidean distance is given by Norm $ℓ 2$ defined as $Y − y ( t ) 2 = ∑ k Y k − y ( t k ) 2$ and mean square error (MSE) defined as $MSE = 1 n Y k − y ( t k ) 2 2$. This is an easily computable quantity for a particular sample. Concluding remarks are summarized as follows:
• In view of Table 2, a comparison between the Euler method (Euler-FT) [8], the Mid-point rule (Mid-FT), Scheme I and II [9] and three new schemes (16), (19) and (20) in this paper for Example 1. We can easily observe from Table 2, the better results (in comparison with the Euler-FT method [8]) are obtained by the three new schemes in this paper and the best result (in comparison with the Scheme I, II and II) is obtained by the Scheme III. Also, the better results (in comparison with the Mid-point rule (Mid-FT), Scheme I and II [9]) are obtained by the Scheme II (19) and Scheme III (20) in this paper where all fuzzy numerical methods used the FT components and the best approximation is shown by the Scheme III (20) with FT components.
• In Table 3, a comparison of MSE and a comparison of Norm $ℓ 2$ for Examples 1 and 2. We can easily observe, the best results are obtained by the three new schemes in this paper and the better results (in comparison with the other numerical classical methods) are obtained by all fuzzy numerical methods used the FT components except Euler-FT [8] for these examples.
• In view of Table 4, a comparison between the three new schemes (16), (19) and (20) in this paper and the Trapezoidal Rule, 2-Step Adams Moulton Method and 3-Step Adams Moulton Method based on Euler method for Example 2. We can easily observe from Table 4, the better results are obtained by the three new schemes in this paper and the best result (in comparison with the Scheme I, II and II) is obtained by the Scheme III.
• In Table 5, a comparison between computation errors for three schemes based on the FT with respect to the power of the triangular and raised cosine generalized uniform fuzzy partition determined by Formula (9), where the advantage of the $K T 1 m$ for Examples 1 and 2 is evident.
This constitutes an important improvement to previous methods which do not provide such information except in the methods such as Euler-FT proposed in [8] and Mid-FT , Scheme I, and Scheme II [9] for Cauchy problems by the more efficient way of computation approximate solutions. Thus, this study will be of particular importance.

## 6. Conclusions

We extended applicability of fuzzy numeric methods to the initial value problem (the Cauchy problem). We proposed three new numeric methods based on the FT and NIM and then analyzed their suitability. We considered in the case of the generalized uniform fuzzy partition is power of the triangular (raised cosine) generalized uniform fuzzy partition and showed that the newly proposed schemes outperform the Euler-FT [8] and Mid-FT , Scheme I, and Scheme II [9] especially on examples where the generalized uniform fuzzy partition is power of the triangular generalized uniform fuzzy partition by using generating function (2). Alos, the newly proposed schemes in this paper outperform the Trapezoidal Rule, 2-Step Adams Moulton Method and 3-Step Adams Moulton Method. Moreover, we proved that the Scheme I determines an approximate solution which converges to the exact solution. This constitutes an important improvement to previous results were coined by I. Perfilieva [8]. To conclude previous sections, the proposed schemes are more accurate and stable. In particular, these schemes can be used for solving initial value problem.

## Author Contributions

H. A. ALKasasbeh and M. Z. Ahmad proposed and designed the numerical methods. H. A. ALKasasbeh performed the numerical experiments. I. Perfilieva evaluated the results and supported this work. M. Z. Ahmad project administration. Z. R. Yahya provided software and data curation.

## Acknowledgments

This work of Irina Perfilieva has been supported by the project “LQ1602 IT4Innovations excellence in science” and by the Grant Agency of the Czech Republic (project No. 16-09541S). Also, many thanks given to Universiti Malaysia Perlis for providing all facilities until this work completed successfully.

## Conflicts of Interest

The authors declare no conflicts of interest.

## References

1. Ahmad, M.Z.; Hasan, M.K.; Baets, B.D. Analytical and numerical solutions of fuzzy differential equations. Inf. Sci. 2013, 236, 156–167. [Google Scholar] [CrossRef]
2. Daftardar-Gejji, V.; Jafari, H. An iterative method for solving nonlinear functional equations. J. Math. Anal. Appl. 2006, 316, 753–763. [Google Scholar] [CrossRef]
3. Sukale, Y.; Daftardar-Gejji, V. New Numerical Methods for Solving Differential Equations. Int. J. Appl. Comput. Math. 2017, 3, 1639–1660. [Google Scholar] [CrossRef]
4. Perfilieva, I. Fuzzy transforms: Theory and applications. Fuzzy Sets Syst. 2006, 157, 993–1023. [Google Scholar] [CrossRef]
5. Perfilieva, I.; Baets, B.D. Fuzzy transforms of monotone functions with application to image compression. Inf. Sci. 2010, 180, 3304–3315. [Google Scholar] [CrossRef]
6. Nguyen, L.; Novák, V. Filtering out high frequencies in time series using F-transform with respect to raised cosine generalized uniform fuzzy partition. In Proceedings of the 2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), Istanbul, Turkey, 2–5 August 2015; pp. 1–8. [Google Scholar]
7. Perfilieva, I.; Hodáková, P.; Hurtík, P. Differentiation by the F-transform and application to edge detection. Fuzzy Sets Syst. 2016, 288, 96–114. [Google Scholar] [CrossRef]
8. Perfilieva, I. Fuzzy transform: Application to the Reef growth problem. In Fuzzy Logic in Geology; Demicco, R.V., Klir, G.J., Eds.; Academic Press: Amsterdam, The Netherlands, 2003; Chapter 9; pp. 275–300. [Google Scholar]
9. Khastan, A.; Perfilieva, I.; Alijani, Z. A new fuzzy approximation method to Cauchy problems by fuzzy transform. Fuzzy Sets Syst. 2016, 288, 75–95. [Google Scholar] [CrossRef]
10. Perfilieva, I. F-Transform. In Handbook of Computational Intelligence; Kacprzyk, J., Pedrycz, W., Eds.; Springer: Berlin/Heidelberg, Germany, 2015; pp. 113–130. [Google Scholar]
11. Perfilieva, I.; Daňková, M.; Bede, B. Towards a higher degree F-transform. Fuzzy Sets Syst. 2011, 180, 3–19. [Google Scholar] [CrossRef]
12. Holčapek, M.; Perfilieva, I.; Novák, V.; Kreinovich, V. Necessary and sufficient conditions for generalized uniform fuzzy partitions. Fuzzy Sets Syst. 2015, 277, 97–121. [Google Scholar] [CrossRef]
13. Bede, B.; Rudas, I.J. Approximation properties of fuzzy transforms. Fuzzy Sets Syst. 2011, 180, 20–40. [Google Scholar] [CrossRef]
14. Hurtik, P.; Perfilieva, I. Image Compression Methodology Based on Fuzzy Transform. In International Joint Conference CISIS’12-ICEUTE´12-SOCO´12 Special Sessions; Springer: Berlin/Heidelberg, Germany, 2013; pp. 525–532. [Google Scholar]
15. Loquin, K.; Strauss, O. Histogram density estimators based upon a fuzzy partition. Stat. Probab. Lett. 2008, 78, 1863–1868. [Google Scholar] [CrossRef]
16. Jahedi, S.; Mehdipour, M.; Rafizadeh, R. Approximation of integrable function based on ϕ—transform. Soft Comput. 2013, 18, 2015–2022. [Google Scholar] [CrossRef]
Table 1. Generating functions of strong uniform fuzzy partition.
Table 1. Generating functions of strong uniform fuzzy partition.
Triangular Generating FunctionRaised Cosine Generating Function
$max 1 − x , 0$$1 2 1 + cos π x ∣ − 1 , 1$
Table 2. Comparison of numeric results for Example 1. The columns contain the exact and seven approximate solutions of the Cauchy problem (27) with a smooth right-hand function: the first three approximate solution is obtained by the three new schems ((16), (19) and (20)), the fourth approximate solution by the Euler-FT [8] with FT components and the last three by the schemes are proposed in [9]. The best approximation is shown by the Scheme III proposed above (20) with FT components.
Table 2. Comparison of numeric results for Example 1. The columns contain the exact and seven approximate solutions of the Cauchy problem (27) with a smooth right-hand function: the first three approximate solution is obtained by the three new schems ((16), (19) and (20)), the fourth approximate solution by the Euler-FT [8] with FT components and the last three by the schemes are proposed in [9]. The best approximation is shown by the Scheme III proposed above (20) with FT components.
$t i$Solution $y ( t )$Proposed Scheme IProposed Scheme IIProposed Scheme IIIEuler-FT in [8]Mid-FT in [9]Scheme I in [9]Scheme II in [9]
011111111
0.10.9051630.9053500.9051630.9051630.9001660.9051620.9043920.904297
0.20.8212690.8216050.8213220.8212690.8113160.82130.8197220.819741
0.30.7491820.7496300.7492740.7492210.7343510.7492350.7468600.747182
0.40.6896800.6902080.6897980.6897420.6700830.6897860.6865920.687391
0.50.6434690.6440470.6436020.6435460.6192410.6436110.6396290.641061
0.60.6111880.6117880.6113240.6112710.5824840.6113970.6066150.608821
0.70.5934150.5940120.5935430.5934950.5604020.5936650.5881290.591239
0.80.5906710.5912430.5907810.5907410.5535280.5909980.5846970.588828
0.90.6034300.6039560.6035130.6034830.5623420.6037990.5967950.602053
10.6321210.6325810.6321680.6321490.5872740.6325710.6248510.631332
1.10.6771290.6775070.6771320.6771270.6287140.6776180.6692530.677045
1.20.7388060.7390850.7387570.7387680.6870090.7393810.7303530.739535
1.30.8174680.8176350.8173600.8173880.7624750.8180750.8084660.819111
1.40.9134030.9134430.9132290.9132760.8553940.9140990.9038810.916053
1.51.0268701.0267721.0266241.0266920.9660211.0275881.0168561.030615
1.61.1581031.1578571.1577791.1578691.0945861.1589151.1476251.163024
1.71.3073161.3069111.3069091.3070221.2412941.3081381.2964001.313489
1.81.4747011.4741271.4742051.4743431.4063311.475621.4633721.482195
1.91.6604311.6596811.6598421.6600061.5898641.6613471.6487151.669312
21.8646651.8636361.8638991.8640971.7793781.8656841.8525851.874993
Table 3. The values of MSE and Norm $ℓ 2$ for Example 1–2.
Table 3. The values of MSE and Norm $ℓ 2$ for Example 1–2.
MethodEx.1Ex.2
Norm $ℓ 2$MSENorm $ℓ 2$MSE
Proposed Scheme I$2.21945 × 10 − 03$$2.34569 × 10 − 07$$3.42892 × 10 − 01$$5.59882 × 10 − 03$
Proposed Scheme II$1.28684 × 10 − 03$$7.88551 × 10 − 08$$3.76033 × 10 − 01$$6.73336 × 10 − 03$
Proposed Scheme III$9.28253 × 10 − 04$$4.10311 × 10 − 08$$2.15401 × 10 − 01$$2.20942 × 10 − 03$
Euler-FT [8]$2.20790 × 10 − 01$$2.32134 × 10 − 03$$3.74484 × 10 + 00$$6.67801 × 10 − 01$
Mid-FT [9]$2.56525 × 10 − 03$$3.13357 × 10 − 07$$6.73731 × 10 − 01$$2.16149 × 10 − 02$
Scheme I [9]$3.54973 × 10 − 02$$6.00026 × 10 − 05$$8.42893 × 10 − 01$$3.38319 × 10 − 02$
Scheme II [9]$1.90439 × 10 − 02$$1.72701 × 10 − 05$$5.90233 × 10 − 01$$1.65893 × 10 − 02$
Trapezoidal Rule$4.30423 × 10 − 02$$8.82208 × 10 − 05$$1.93095 × 10 + 00$$1.77551 × 10 − 01$
2-Step Adams Moulton$3.49968 × 10 − 02$$5.83228 × 10 − 05$$1.85289 × 10 + 00$$1.63485 × 10 − 01$
3-Step Adams Moulton$3.14968 × 10 − 02$$4.72405 × 10 − 05$$1.57237 × 10 + 00$$1.17732 × 10 − 01$
Table 4. Comparison of numeric results for Example 2. The columns contain the exact and six approximate solutions of the Cauchy problem (27) with oscillating right-hand function: the first three approximate solution is obtained by the three new schems ((16), (19), and (20)), the last three approximate solution by the Trapezoidal Rule, 2-Step Adams Moulton Method and 3-Step Adams Moulton Method. The best approximation is shown by the Scheme III proposed above (20) with FT components.
Table 4. Comparison of numeric results for Example 2. The columns contain the exact and six approximate solutions of the Cauchy problem (27) with oscillating right-hand function: the first three approximate solution is obtained by the three new schems ((16), (19), and (20)), the last three approximate solution by the Trapezoidal Rule, 2-Step Adams Moulton Method and 3-Step Adams Moulton Method. The best approximation is shown by the Scheme III proposed above (20) with FT components.
$t i$Solution $y ( t )$Proposed Scheme IProposed Scheme IIProposed Scheme IIITrap $1$2-Step Adams $2$3-Step Adams $3$
1.5707963272.1950622.1950622.1950622.1950622.1950622.1950622.195062
1.7278759591.8832811.8942591.8832811.8832811.8606131.8832811.883281
1.8849555921.4850031.5110461.4908531.4850031.4544281.4638131.485003
2.0420352251.1856051.2248681.1916211.1848301.1724181.1638391.177378
2.1991148581.2067581.2567211.2081471.2022921.2052641.1806481.194336
2.356194491.6881831.7337961.6755381.6767881.6380711.6130251.638504
2.5132741232.5466292.5580692.5087982.5254112.3712882.3704152.421052
2.6703537563.4200513.3816903.3627403.3961183.1102923.1512413.228492
2.8274333883.8175943.7516603.7663653.8022393.4590383.5344353.617396
2.9845130213.4791873.4512883.4630393.4769303.1538573.2269563.285059
3.1415926542.7112912.7608422.7222802.7078112.4800462.4986762.521585
3.2986722862.3052012.4045562.3016862.2808602.1681972.1170532.127181
3.4557519192.8713452.9428182.8108632.8186392.6222652.5583982.599754
3.6128315524.0800854.0354463.9525874.0152303.5550343.5563563.660448
3.7699111844.7670954.6450814.6470764.7338254.1048304.1885764.317767
3.9269908174.2097854.1845894.1838794.2133753.6431273.7284923.801548
4.084070453.2582433.3834823.2639623.2241572.9359402.8959672.895039
4.2411500823.4818733.6093323.3863383.3709213.1114992.9899803.008814
4.3982297154.8731464.7995884.6424404.7332004.0942804.0559384.179701
4.5553093485.5011925.3313275.3117755.4446574.5616914.6526994.813484
4.712388984.4985914.5513574.4851284.4939163.8179033.8671673.912209
$1$ Trapezoidal Rule; $2$ 2-Step Adams Moulton Method; $3$ 3-Step Adams Moulton Method.
Table 5. The values of MSE and Norm $ℓ 2$ for Examples 1 and 2 by the three schemes with respect to the power of the triangular and raised cosine generalized uniform fuzzy partition are proposed in this paper. The best approximation is shown by using $K T 1 201$.
Table 5. The values of MSE and Norm $ℓ 2$ for Examples 1 and 2 by the three schemes with respect to the power of the triangular and raised cosine generalized uniform fuzzy partition are proposed in this paper. The best approximation is shown by using $K T 1 201$.
Proposed SchemeCaseEx.1Ex.2
Norm $ℓ 2$MSENorm $ℓ 2$MSE
I$K T 1 1$$7.81857 × 10 − 03$$2.91095 × 10 − 06$$6.38151 × 10 − 01$$1.93922 × 10 − 02$
$K T 1 3$$5.06528 × 10 − 03$$1.22176 × 10 − 06$$4.65538 × 10 − 01$$1.03203 × 10 − 02$
$K T 1 201$$2.21945 × 10 − 03$$2.34569 × 10 − 07$$3.42892 × 10 − 01$$5.59882 × 10 − 03$
$K C 1$$6.96371 × 10 − 03$$2.30920 × 10 − 06$$5.79002 × 10 − 01$$1.59640 × 10 − 02$
II$K T 1 1$$5.92425 × 10 − 03$$1.67127 × 10 − 06$$5.45616 × 10 − 01$$1.41761 × 10 − 02$
$K T 1 3$$3.58895 × 10 − 03$$6.13360 × 10 − 07$$4.29959 × 10 − 01$$8.80307 × 10 − 03$
$K T 1 201$$1.28684 × 10 − 03$$7.88551 × 10 − 08$$3.76033 × 10 − 01$$6.73336 × 10 − 03$
$K C 1$$5.18129 × 10 − 03$$1.27837 × 10 − 06$$5.01710 × 10 − 01$$1.19864 × 10 − 02$
III$K T 1 1$$5.31047 × 10 − 03$$1.34291 × 10 − 06$$4.42442 × 10 − 01$$9.32167 × 10 − 03$
$K T 1 3$$3.09350 × 10 − 03$$4.55702 × 10 − 07$$2.88083 × 10 − 01$$3.95199 × 10 − 03$
$K T 1 201$$9.28253 × 10 − 04$$4.10311 × 10 − 08$$2.15401 × 10 − 01$$2.20942 × 10 − 03$
$K C 1$$4.59684 × 10 − 03$$1.00624 × 10 − 06$$3.84860 × 10 − 01$$7.05320 × 10 − 03$