Next Article in Journal
An Analysis of the Effects of Lifestyle Changes by Using a Fractional-Order Population Model of the Overweight/Obese Diabetic Population
Next Article in Special Issue
Finite-Approximate Controllability of ν-Caputo Fractional Systems
Previous Article in Journal
The Impulsive Coupled Langevin ψ-Caputo Fractional Problem with Slit-Strip-Generalized-Type Boundary Conditions
Previous Article in Special Issue
Exploring Propagating Soliton Solutions for the Fractional Kudryashov–Sinelshchikov Equation in a Mixture of Liquid–Gas Bubbles under the Consideration of Heat Transfer and Viscosity
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Generalized Discrete Proportional Derivative and Its Applications

by
Rajiniganth Pandurangan
1,*,
Saravanan Shanmugam
2,
Mohamed Rhaima
3,* and
Hamza Ghoudi
4
1
Department of Mathematics, School of Engineering and Technology, Dhanalakshmi Srinivasan University, Samayapuram 621112, Tamil Nadu, India
2
Centre for Nonlinear Systems, Chennai Institute of Technology, Chennai 600069, Tamil Nadu, India
3
Department of Statistics and Operations Research, College of Sciences, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia
4
Departments of mathematics, MODAL’X UMR9023, UFR SEGMI, BAT G, 200, Ave de la Republique, University of Paris Nanterre, 92000 Nanterre, France
*
Authors to whom correspondence should be addressed.
Fractal Fract. 2023, 7(12), 838; https://doi.org/10.3390/fractalfract7120838
Submission received: 5 October 2023 / Revised: 15 November 2023 / Accepted: 21 November 2023 / Published: 27 November 2023
(This article belongs to the Special Issue Mathematical and Physical Analysis of Fractional Dynamical Systems)

Abstract

:
The aim of this paper is to define the generalized discrete proportional derivative (GDPD) and illustrate the application of the Leibniz theorem, the binomial expansion, and Montmort’s formulas in the context of the generalized discrete proportional case. Furthermore, we introduce the generalized discrete proportional Laplace transform and determine the GDPLT of various functions using the inverse operator. The results obtained are showcased through relevant examples and validated using MATLAB.

1. Introduction

Undoubtedly, mathematics holds immense value across various disciplines, including physics, economics, and engineering [1,2,3,4,5,6,7,8]. The concept of a difference equation becomes essential when describing the evolution of a phenomenon over time. In the works of [9,10], the discrete case of the differential operator Δ is precisely defined as
Δ f ( k ) = f ( k + 1 ) f ( k ) , k N = { 0 , 1 , 2 , 3 , } .
The discrete cases of derivatives (both real and complex order) and integrals can be defined using discrete fractional calculus, extending the principles of (integer-order) differential calculus [11,12,13]. Specifically, fractional derivatives in this context are synonymous with Riemann–Liouville fractional derivatives (RLFDs), and their definitions have been explored in various ways in [14,15,16,17].
Likewise, discrete fractional derivatives can be defined through various approaches. In the realm of difference calculus, particularly fractional difference calculus [10,18,19], one encounters the forward h-difference operator Δ h , which is defined as
h Δ h f ( x ) = f ( x + h ) f ( x ) , x [ 0 , ) , h ( 0 , ) .
In 1989, Miller and Ross introduced the discrete counterpart of the RLFD, elucidating numerous characteristics of the fractional difference operator [11,20]. This work not only involved proposing the discrete analogue but also encompassed the definition of various generalized difference operators. We further extended our contributions by deriving exact solutions and presenting numerical solutions for a variety of functions [21,22,23]. Notably, we introduced the discrete variant of the generalized proportional derivative, known as the generalized proportional delta operator.
In the study presented in [24], the authors investigated lower regularized incomplete gamma functions, showcasing their utility in demonstrating the existence and uniqueness of solutions for fractional differential equations involving nonlocal fractional derivatives. Exploring a new frontier, [25] delves into the realm of solutions for a distinct category of nonlinear generalized proportional fractional differential inclusions. This exploration encompasses scenarios where the right-hand side incorporates a Caratheodory-type multivalued nonlinearity, extending the analysis to infinite intervals. Furthermore, [26] introduces a comprehensive two-step design approach aimed at implementing a fractional-order proportional integral controller tailored for a specific class of fractional-order plant models. Motivated by the preceding discussions and incentives, the principal objective of this paper is to delve into the concept of the GDPD. This investigation involves demonstrating the practical applicability of Leibniz’s theorem, binomial expansion, and Montmort’s formulas within the generalized discrete proportional setting.
Expanding on prior research, we have extended the discrete form of the generalized proportional differential operator. Its inverse has been skillfully employed to derive fundamental formulas, enabling the computation of closed-form solutions and numerical solutions for distinct categories of finite and infinite series within the domain of number theory. Remarkably, the application of this operator to advance the theoretical foundations of the discrete version remains unparalleled in the existing literature.
A clear distinction often arises between numerical solutions and closed-form solutions in prevalent methodologies. Discrepancies emerge, necessitating the individual determination of the error factor. Remarkably, when utilizing the generalized proportional difference operator and its inverse, the need for a separate determination of the error factor is obviated. The equivalence between numerical solutions and closed form solutions is consistently observed in our methodologies.
In this article, the generalized proportional delta operator Δ μ has been proposed. Section 2 studies the generalized discrete proportional case of the Leibnitz theorem, binomial expansion, and Montmort’s formulas by defining the generalized proportional difference operator. In Section 3, we establish the inverse generalized proportional delta operator and derives exact and numerical solutions of various functions. In Section 4, we discuss the applications in various types of arithmetic progression (AP) of finite series involving the operator Δ μ . In Section 5, we define the generalized proportional discrete Laplace transform (GDPLT) and obtain the GDPLT of various functions. To demonstrate our findings, appropriate examples are supplied and confirmed using MATLAB in Section 6. Finally, the conclusion of this paper is given in Section 7.

2. Basic Definitions and Results

Prior to presenting and proving our results, we lay the foundation by introducing essential definitions and lemmas. This section unveils fundamental concepts and provides preliminary results that will prove crucial in our subsequent discussions.
Definition 1
([27]). A Conformable Differential Operator is defined by
D α f ( t ) = α f ( t ) + ( 1 α ) f ( t ) , α [ 0 , 1 ] ,
which represents the α-derivative of f ( t ) . Here, D α is conformable provided the function f ( t ) is differentiable at t and f ( t ) = d d t f ( t ) .
Definition 2
([23]). Let f ( t ) be real- or complex-valued function on [ 0 , ) . Then, the forward ( α , β ) -difference operator Δ ( α , β ) ( ) on f ( t ) is defined by
Δ ( α , β ) ( ) f ( t ) = β f ( t + ) α f ( t ) , ( 0 , ) .
Remark 1
([19,23]). When α = 1 and β = 1 , the difference operator Δ ( 1 , 1 ) ( ) becomes the generalized difference operator Δ , defined as Δ f ( t ) = f ( t + ) f ( t ) .
Definition 3.
By Definition 1, the generalized proportional delta operator for the function w ( t ) : [ 0 , ) C , > 0 is defined by
Δ μ w ( t ) = μ Δ w ( t ) + ( 1 μ ) w ( t ) , μ [ 0 , 1 ] .
Lemma 1.
If L w ( t ) = w ( t + ) is the usual lead operator, then
L = 1 μ ( Δ μ + 2 μ 1 ) = ( 1 + Δ ) = ( 1 + Δ ) .
Proof. 
From the usual lead operator L , we write
L w ( t ) = w ( t + ) = w ( t + ) w ( t ) + w ( t ) = ( 1 + Δ ) w ( t ) .
When = 1 , (5) becomes L = Δ + 1 . Then, from (3) and (5), we obtain
( 1 + Δ ) w ( t ) = L w ( t ) = ( 1 + Δ ) w ( t ) .
L w ( t ) = 1 μ ( Δ μ + 2 μ 1 ) w ( t ) .
By comparing Equations (6) and (7), we complete the proof. □
Lemma 2.
If a, b are constants and w 1 ( t ) , w 2 ( t ) are any real- or complex-valued functions on t [ 0 , ) , then
(i) 
Δ μ [ a w 1 ( t ) + b w 2 ( t ) ] = a Δ μ w 1 ( t ) + b Δ μ w 2 ( t ) ;
(ii) 
Δ μ 1 Δ μ 2 w ( t ) = Δ μ 2 Δ μ 1 w ( t ) = Δ μ 1 + μ 2 w ( t ) ;
(iii) 
Δ μ [ w 1 ( t ) w 2 ( t ) ] = Δ μ w 2 ( t ) L w 1 ( t ) + ( 2 μ 1 ) w 2 ( t ) Δ w 1 ( t ) ;
(iv) 
Δ μ w 1 ( t ) w 2 ( t ) = w 2 ( t ) Δ μ w 1 ( t ) ( 2 μ 1 ) w 1 ( t ) Δ w 2 ( t ) w 2 ( t ) L w 2 ( t ) .
Proof. 
The proof follows by Definition 3. □
Definition 4.
By Definition 3, the second order of Δ μ is defined as Δ 2 μ = Δ μ Δ μ and, in general, the n t h order of Δ μ is defined as Δ n μ = Δ ( n 1 ) μ ( Δ μ ) .
The following are easy deductions.
(i)
For the positive integers p, q and μ [ 0 , 1 ] , Δ p μ Δ q μ = Δ q μ Δ p μ ;
(ii)
For μ [ 0 , 1 ] and w : [ 0 , ) C   Δ n μ ( c w ( t ) ) = c Δ n μ w ( t ) ;
(iii)
L Δ μ w ( t ) = Δ μ L w ( t ) ;
(iv)
For the function w : [ 0 , ) C ,
Δ r μ = i = 0 r ( 1 2 μ ) i r C i ( μ L ) ( r i )
and hence, Δ r μ w ( t ) = i = 0 r ( 1 2 μ ) i r C i μ r i w ( t + ( r i ) ) ;
(v)
Δ n μ = μ L n + ( 1 2 μ ) ;
(vi)
Δ n μ = 1 μ n 1 [ Δ μ + ( 2 μ 1 ) ] n + ( 1 2 μ ) ;
(vii)
Δ n μ = 1 μ n 1 k = 0 r r C k Δ ( r k ) μ ( 2 μ 1 ) k + ( 1 2 μ ) .
The following theorem presents the generalized discrete proportional case of Leibniz’s theorem.
Theorem 1.
Let w ( t ) and z ( t ) , t [ 0 , ) , be any two functions. Then,
Δ n μ [ w ( t ) z ( t ) ] = r = 0 n n C r 2 1 μ n r i = 0 r 2 μ 2 3 μ + 1 μ i r C i × Δ ( r i ) μ w ( t ) Δ ( n r ) μ z ( t + ( r i ) ) , μ [ 0 , 1 ] .
Proof. 
Define the operators L 1 , L 2 , ( Δ n μ ) 1 , ( Δ n μ ) 1 and hence L as
L 1 w ( t ) z ( t ) = w ( t + ) z ( t ) , L 2 w ( t ) z ( t ) = w ( t ) z ( t + ) ,
( Δ n μ ) 1 = μ L 1 + ( 1 2 μ ) , ( Δ n μ ) 2 = μ L 2 + ( 1 2 μ ) , L = L 1 L 2 .
From (4) and (10), we have Δ μ = μ L + 1 2 μ = μ L 1 L 2 + 1 2 μ = 2 μ 1 μ ( Δ μ ) 2 + ( Δ μ ) 1 L 2 + H , where H = 2 μ 2 3 μ + 1 μ .
From the above expression, we obtain
Δ n μ ( w ( t ) z ( t ) ) = ( 2 μ 1 ) ( Δ μ ) 2 + ( Δ μ ) 1 L 2 + H n w ( t ) z ( t ) .
The results follow from the binomial theorem, (9)–(11). □
Next, we establish the generalized discrete proportional form of the binomial expansion.
Theorem 2.
For n , m Z + , the generalized discrete proportional case of the binomial expansion is given by
( t + n ) m = p = 0 n n C p 1 ( 2 μ 1 ) p q = 0 p p C q μ p q ( 1 2 μ ) q [ t + ( p q ) ] m .
Proof. 
From (4), we have L = 1 μ ( Δ μ + 2 μ 1 ) . Furthermore, L n = 1 μ ( Δ μ + 2 μ 1 ) n . This implies
L n w ( t ) = 1 μ ( Δ μ + 2 μ 1 ) n w ( t ) .
The proof follows by taking w ( t ) = t m on (13) and using binomial theorem. □
We now introduce the discrete case of Montmort’s generalized proportional formula.
Lemma 3.
If the series t = 0 c k t k converges, then
t = 0 c k t k = μ t = 0 x t Δ t μ ( μ ( 2 μ 1 ) x ) t + 1 c 0 .
Proof. 
Using the lead operator L = 1 μ ( Δ μ + 2 μ 1 ) , we can get
t = 0 c t x t = t = 0 x t L t c 0 = { 1 x L } 1 c 0 = { 1 x 1 μ ( Δ μ + 2 μ 1 ) } 1 c 0 .
Now, the proof follows by using the binomial expansion. □

3. Inverse of the Generalized Proportional Difference Operator

In this section, we establish the inverse of the generalized proportional difference operator Δ μ and present explicit formulas for partial sums involving higher powers of the geometric arithmetic progression. Additionally, we illustrate the application of these formulas through relevant examples, providing a comprehensive understanding of their utility in practical scenarios.
Definition 5.
By Definition 3, we define the inverse of the generalized proportional difference operator represented as follows. If Δ μ z ( t ) = w ( t ) , then
Δ μ w ( t ) = z ( t ) 2 μ 1 t z ( j ) ,
where z ( j ) is constant and the n t h order inverse generalized proportional difference operator represented by Δ n μ is defined as
Δ n μ w ( t ) = Δ ( n 1 ) μ Δ μ w ( t ) .
Lemma 4.
Let μ [ 0 , 1 ) , w(t)=1, j = t t and t [ , ) . Then,
Δ μ ( 1 ) = 1 ( 1 μ ) 1 2 1 μ t j = 1 μ k = 1 t 2 1 μ k 1 .
Proof. 
From (3) and (15), we get the proof. □
Lemma 5.
If μ [ 0 , 1 ) , ℓ is positive real and t [ 0 , ) , then
Δ μ w ( t ) | j t = 1 μ k = 1 t 2 1 μ k 1 w ( t k ) .
Proof. 
The proof is followed by (15) and the relation
Δ μ 1 μ k = 1 t 2 1 μ k 1 w ( t k ) + c j = w ( t ) .
 □
The operator methods of summation on Δ μ are as follows.
Theorem 3.
Assume that P ( t ) , t 2 is any function of t and λ 1 . Then, we obtain,
1 μ k = 1 t 2 1 μ k 1 L ( λ k P k ) = λ t ( λ 1 ) ( 1 2 μ ) i = 0 ( 1 ) i λ i ( λ 1 ) i ( 1 2 μ ) i P ( t ) | j t ,
where L ( λ k P k ) = λ t k P ( t k ) .
Proof. 
For a function F ( t ) , we find
Δ μ λ t F ( t ) = λ t [ μ λ L + ( 1 2 μ ) ] F ( t ) = λ t P ( t ) ,
hence, we obtain
[ μ λ L + ( 1 2 μ ) ] 1 P ( t ) = F ( t ) .
From (19) and (15), we find
Δ μ λ t P ( t ) = λ t F ( t ) 2 1 μ t λ j F ( j ) ,
and hence by (20), we obtain
Δ μ λ t P ( t ) = λ t [ μ λ L + ( 1 2 μ ) ] 1 P ( t ) 2 1 μ t c j ,
where c j = λ j [ μ λ L + ( 1 2 μ ) ] 1 P ( j ) . Equations (17) and (21), along with the binomial theorem, are now used to support the proof. □

4. Applications in Various Sorts of A.P. Finite Series Involving Δ μ

Utilizing Δ μ as a tool, we derive expressions for the sums of both arithmetico-geometric progressions and arithmetico-double geometric progressions in the realm of number theory.
The following theorem presents the general formula for the summation of higher powers in an arithmetico-geometric progression.
Theorem 4.
Let t [ , ) , [ 0 , ) , μ [ 0 , 1 ) and j = t t . Then,
1 μ k = 1 t 2 1 μ k 1 ( t k ) m = F n ( t ) 2 1 μ t F n ( j ) ,
where F n ( t ) = t m 1 μ + k = 1 m ( μ ) k ( 1 μ ) k + 1 Δ μ t m .
Proof. 
From (16), we have
Δ μ ( 1 ) = F 0 ( t ) 2 1 μ t F 0 ( j ) ,
where F 0 ( t ) = 1 ( 1 μ ) . Since Δ μ t = ( 1 μ ) t + μ , (15) and (23) give
Δ μ t = F 1 ( t ) 2 1 μ t F 1 ( j ) ,
F 1 ( t ) = t ( 1 μ ) 2 μ ( 1 μ ) 2 . Since Δ μ t 2 = ( 1 μ ) t 2 + 2 μ t + μ 2 , Δ μ is linear, (15), (23) and (24) yield
Δ μ t 2 = F 2 ( t ) 2 1 μ t F 2 ( j ) ,
where F 2 ( t ) = t 2 ( 1 μ ) + k = 1 2 ( μ ) k ( 1 μ ) k + 1 Δ k t 2 . Similarly,
Δ μ t 3 = ( 1 μ ) t 3 + 3 μ t 2 + 3 μ 2 t + 2 μ 3 ,
and from (15) and (26), we find
Δ μ t 3 = F 3 ( t ) 2 1 μ t F 3 ( j ) ,
where F 3 ( t ) = t 3 ( 1 μ ) + k = 1 3 ( μ ) k ( 1 μ ) k + 1 Δ μ t 3 . Now, proceeding with the same process for Δ μ t m , we get the proof. □
Theorem 5.
Let t [ , ) , [ 0 , ) , μ [ 0 , 1 ) and j = t t . Then,
1 μ k = 1 t 2 1 μ k 1 ( t k ) ( m ) = G n ( t ) 2 1 μ t G n ( j ) ,
where G n ( t ) = t ( m ) 1 μ + k = 1 m ( μ ) k ( 1 μ ) k + 1 Δ μ t ( m ) .
Proof. 
From (24), we have
Δ μ t ( 1 ) = G 1 ( t ) 2 1 μ t G 1 ( j ) ,
where G 1 ( t ) = t ( 1 ) ( 1 μ ) μ ( 1 μ ) 2 . Since Δ μ t ( 2 ) = ( 1 μ ) t ( 2 ) + 2 μ t ( 1 ) , Δ μ is linear, (15) and (29) yield
Δ μ t ( 1 ) = G 2 ( t ) 2 1 μ t G 2 ( j ) ,
where G 2 ( t ) = t ( 2 ) ( 1 μ ) + k = 1 2 ( μ ) k ( 1 μ ) k + 1 Δ μ t ( 1 ) . Similarly, since
Δ μ t ( 3 ) = ( 1 μ ) t ( 3 ) + 3 μ t 2 μ 2 t ,
from Definitions (15) and (31), we find
Δ μ t ( 3 ) = G 3 ( t ) 2 1 μ t G 3 ( j ) ,
where G 3 ( t ) = t ( 3 ) ( 1 μ ) + k = 1 3 ( μ ) k ( 1 μ ) k + 1 Δ μ t ( 3 ) . Now, proceeding with the same process for Δ μ t ( m ) , we get the proof. □
The following theorem provides the formula for the sum of an arithmetico-double geometric progression.
Theorem 6.
If t [ , ) and j = t t , then
1 μ k = 1 t 2 1 μ k 1 ( t k ) m a t k = H m ( t ) 2 1 μ t H m ( j ) ,
where
H m ( t ) = t m a t 1 2 μ + μ a + k = 1 m ( μ ) k ( 1 2 μ + μ a ) k + 1 Δ ( t m ) L m ( a t ) .
Proof. 
Δ μ a t = ( 1 2 μ + μ a ) a t , which yields from (15) that
Δ μ a t = a t 1 2 μ + μ a 2 1 μ t a j 1 2 μ + μ a .
Δ μ t a t = ( 1 2 μ + μ a ) t a t + μ a a t , which yields from (15) that
Δ μ ( t a t ) = t a t 1 2 μ + μ a μ a ( 1 2 μ + μ a ) 2 a t j t .
Δ μ t 2 a t = ( 1 2 μ + μ a ) t 2 a t + 2 μ a t a t + μ 2 a a t , which yields from (15) that
Δ μ ( t 2 a t ) = t 2 a t 1 2 μ + μ a + k = 1 2 ( μ ) k ( 1 2 μ + μ a ) 3 Δ ( t m ) L 2 a t j t .
Now, we proceed with the same process for w ( t ) = t m a t , and this completes the proof. □
Remark 2.
The following Table 1 is a comparison of Theorem 3, Theorem 4, Theorem 5 and Theorem 6.
Remark 3.
Researchers can analyze discrete generalized proportional differences and inverse differences across various functions. Readers may apply this operator in Newton’s law of cooling to reduce errors.

5. Applications of the Generalized Discrete Proportional Laplace Transform Using Δ μ

Within this section, we delve into the application of Δ μ to determine the GDPLT. The subsequent definition elucidates the GDPLT.
Definition 6.
By Definition 3, let w ( t ) be a function of t defined for t 0 and let [ 0 , 1 ] . Then, the generalized discrete proportional Laplace transform is defined by
L μ { w ( t ) } = μ Δ μ e s t w ( t ) | 0 + ( 1 μ ) Δ μ t e s t w ( t ) | 0 ,
= t = 1 ( 2 μ 1 ) r 1 T + 1 μ μ t = 1 ( 2 μ 1 ) r 1 ( t r ) T ,
where T = e s ( t r ) w ( t r ) , and L μ { w ( t ) } = W ( s ) and L μ 1 { W ( s ) } = w ( t ) denote the inverse of the generalized discrete proportional Laplace transform.
Lemma 6
(Numerical solution). Let w ( t ) be a function of t defined for t [ 0 , ) and lim t Δ μ w ( t ) = 0 . Then,
Δ μ w ( t ) | t = k = 1 μ k 1 ( 2 μ 1 ) k w ( t + k ) .
Proof. 
The proof follows from the relation
Δ μ k = 1 μ k 1 ( 2 μ 1 ) k w ( t + k ) = w ( t ) , w ( j ) = 0 as t and (3). □
Lemma 7
(Exact solution). Let w ( t ) be a function of t ( 0 , ) , s > 0 and > 0 . Then, the generalized discrete proportional Laplace transform of w ( t ) is given by
L μ { w ( t ) } = k = 1 ( 2 μ 1 ) k + ( 1 μ ) μ k e s k w ( k ) .
Proof. 
The generalized discrete proportional Laplace transform of w ( t ) is
L μ { w ( t ) } = μ Δ μ e s k w ( k ) | 0 + ( 1 μ ) Δ μ k e s k w ( k ) | 0 = k = 1 ( 2 μ 1 ) k e s ( t + k ) w ( t + k ) | 0 + 1 μ μ k = 1 ( 2 μ 1 ) k ( t + e ) e s ( t + k ) w ( t + k ) | 0
Hence,
L μ { w ( t ) } = k = 1 ( 2 μ 1 ) k + ( 1 μ ) μ k e s k w ( k ) .
The proof is complete. □
The following Proposition 1 establishes the equivalence between the numerical solution and the exact solution of the generalized discrete proportional Laplace transform.
Proposition 1.
Let w ( t ) be a function of t ( 0 , ) , s > 0 and > 0 . Then, the numerical and exact solutions of the generalized discrete proportional Laplace transform of w ( t ) are equal, which is given by
k = 1 μ k 1 ( 2 μ 1 ) k w ( t + k ) = k = 1 ( 2 μ 1 ) k + ( 1 μ ) μ k e s k w ( k ) .
Proof. 
Comparing (39) and (41), we get the proof. □
Lemma 8.
Let t [ , ) and w ( t ) = e s t , t > 0 . Then,
Δ μ ( e s t ) | j t = e s t μ e s 2 μ + 1 | j t .
Proof. 
The proof follows by (3) and (15). □
Lemma 9.
Let t [ , ) and w ( t ) = t e s t , t > 0 . Then,
Δ μ ( t e s t ) | j t = t e s t μ e s 2 μ + 1 | j t μ e s ( t + ) ( μ e s 2 μ + 1 ) 2 | j t .
Proof. 
Using (3), (15) and Lemma 8, the proof is complete. □
Proposition 2.
Let w ( t ) be a unit step function of t and > 0 . Then, the generalized discrete proportional Laplace transform of w ( t ) is given by
L μ { w ( t ) } = μ μ e s 2 μ + 1 + ( 1 μ ) μ e s ( μ e s 2 μ + 1 ) 2 .
Proof. 
Taking w ( t ) = 1 , t > 0 in (37), we get
L μ { 1 } = μ Δ μ ( e s t ) | 0 + ( 1 μ ) Δ μ ( t e s t ) | 0 .
Using (43) and (44) in (46), we get the proof. □
Lemma 10.
Let t [ , ) and w ( t ) = e ( s a ) t , t > 0 . Then,
Δ μ ( e ( s a ) t ) | j t = e ( s a ) t μ e ( s a ) 2 μ + 1 | j t .
Proof. 
The proof follows by (3) and (15). □
Lemma 11.
Let t [ , ) and w ( t ) = t e ( s a ) t , t > 0 . Then,
Δ μ ( t e ( s a ) t ) | j t = t e ( s a ) t μ e ( s a ) 2 μ + 1 | j t μ e ( s a ) ( t + ) ( μ e ( s a ) 2 μ + 1 ) 2 | j t .
Proof. 
Using (3), (15) and Lemma 8, the proof is complete. □
Proposition 3.
Let w ( t ) = e a t be a function of t and > 0 . Then, the generalized discrete proportional Laplace transform of w ( t ) is given by
L μ { w ( t ) } = μ μ e ( s a ) 2 μ + 1 + ( 1 μ ) μ e ( s a ) ( μ e ( s a ) 2 μ + 1 ) 2 .
Proof. 
Taking w ( t ) = e a t , t > 0 in (37), we get
L μ { e a t } = μ Δ μ ( e ( s a ) t ) | 0 + ( 1 μ ) Δ μ ( t e ( s a ) t ) | 0 .
Using (47) and (48) in (50), we get the proof. □
Lemma 12.
Let t [ , ) and w ( t ) = e ( s + a ) t , a , t > 0 . Then,
Δ μ ( e ( s + a ) t ) | j t = e ( s + a ) t μ e ( s + a ) 2 μ + 1 | j t .
Proof. 
The proof follows by (3) and (15). □
Lemma 13.
Let t [ , ) and w ( t ) = t e ( s + a ) t , a , t > 0 . Then,
Δ μ ( t e ( s + a ) t ) | j t = t e ( s + a ) t μ e ( s + a ) 2 μ + 1 | j t μ e ( s + a ) ( t + ) ( μ e ( s + a ) 2 μ + 1 ) 2 | j t .
Proof. 
Using (3), (15) and Lemma 8, the proof is complete. □
Theorem 7.
Let w ( t ) = e a t be a function of t and a , > 0 . Then, the generalized discrete proportional Laplace transform of w ( t ) is given by
L μ { w ( t ) } = μ μ e ( s + a ) 2 μ + 1 + ( 1 μ ) μ e ( s + a ) ( μ e ( s a ) 2 μ + 1 ) 2 .
Proof. 
Taking w ( t ) = e a t , t > 0 in (37), we get
L μ { e a t } = μ Δ μ ( e ( s + a ) t ) | 0 + ( 1 μ ) Δ μ ( t e ( s a ) t ) | 0 .
Using (51) and (52) in (54), we get the proof. □
Lemma 14.
Let t [ , ) and w ( t ) = e ( s i a ) t , a , t > 0 . Then,
Δ μ ( e ( s i a ) t ) | j t = e ( s i a ) t μ e ( s i a ) 2 μ + 1 | j t .
Proof. 
The proof follows by (3) and (15). □
Lemma 15.
Let t [ , ) and w ( t ) = t e ( s i a ) t , a , t > 0 . Then,
Δ μ ( t e ( s i a ) t ) | j t = t e ( s i a ) t μ e ( s i a ) 2 μ + 1 | j t μ e ( s i a ) ( t + ) ( μ e ( s i a ) 2 μ + 1 ) 2 | j t .
Proof. 
Using (3), (15) and Lemma 8, the proof is complete. □
Theorem 8.
Let w ( t ) = e i a t be a function of t and a , > 0 . Then, the generalized discrete proportional Laplace transform of w ( t ) is given by
L μ { e i a t } = μ μ e ( s i a ) 2 μ + 1 + ( 1 μ ) μ e ( s i a ) ( μ e ( s i a ) 2 μ + 1 ) 2 .
or
L μ { c o s a t } = μ μ e s c o s a 2 μ + 1 ( μ e s c o s a 2 μ + 1 ) 2 + ( μ e s s i n a ) 2 + ( 1 μ )
μ 3 e 3 s c o s a 2 μ 2 ( 2 μ 1 ) e 2 s + μ ( 2 μ 1 ) 2 e s c o s a ( A 2 μ ( 2 μ 1 ) e s c o s a + ( 2 μ + 1 ) 2 ) 2 + ( B 2 μ ( 2 μ 1 ) e s s i n a ) 2 ,
and
L μ { s i n a t } = μ μ e s s i n a ( μ e s c o s a 2 μ + 1 ) 2 + ( μ e s s i n a ) 2 + ( 1 μ )
μ 3 e 3 s s i n a + μ ( 2 μ 1 ) 2 e s s i n a ( A 2 μ ( 2 μ 1 ) e s c o s a + ( 2 μ + 1 ) 2 ) 2 + ( B 2 μ ( 2 μ 1 ) e s s i n a ) 2 ,
where A = μ 2 e 2 s c o s a and B = μ 2 e 2 s s i n a .
Proof. 
Taking w ( t ) = e i a t , t > 0 in (37), we get
L μ { e i a t } = μ Δ μ ( e ( s i a ) t ) | 0 + ( 1 μ ) Δ μ ( t e ( s i a ) t ) | 0 .
Using (55) and (56) in (60), we get (57), and equating the coefficients of real and imaginary parts, we get (58) and (59). □
Lemma 16.
Let t [ , ) and w ( t ) = t 2 e s t , t > 0 . Then,
Δ μ ( t 2 e s t ) | j t = t 2 e s t μ e s 2 μ + 1 | j t μ e s ( μ e s 2 μ + 1 ) 2 ( 2 t + μ e s + 1 ) e s t | j t .
Proof. 
Using (3), (15) and Lemma 8, the proof is complete. □
Proposition 4.
Let w ( t ) = t be a function of t and > 0 . Then, the generalized discrete proportional Laplace transform of w ( t ) is given by
L μ { w ( t ) } = μ 2 2 ( μ e s 2 μ + 1 ) 2 + ( 1 μ ) 2 μ 2 2 e 2 s + μ 2 e s ( μ e s 2 μ + 1 ) 2 .
Proof. 
Taking w ( t ) = t , t > 0 in (37), we get
L μ { t } = μ Δ μ ( t e s t ) | 0 + ( 1 μ ) Δ μ ( t 2 e s t ) | 0 .
Using (43) and (61) in (63), we get the proof. □

6. Numerical Examples

Within this section, we showcase examples and figures that demonstrate the application of the GDPD and the generalized discrete proportional Laplace transform to various functions.
Definition 3 is demonstrated using the following example.
Example 1.
Let μ [ 0 , 1 ] and n Z . The generalized proportional difference of a function as follows:
(i) 
w ( t ) = t 2 at μ = n 5 , 0 n 5 , we have the following:
μ = 0 , ( 0 , ) : Δ 0 t 2 = t 2
μ = 1 5 , ( 0 , ) : Δ 1 5 t 2 = ( 0.2 ) ( 2 t + 2 ) + ( 0.8 ) t 2
μ = 2 5 , ( 0 , ) : Δ 2 5 t 2 = ( 0.4 ) ( 2 t + 2 ) + ( 0.6 ) t 2
μ = 3 5 , ( 0 , ) : Δ 3 5 t 2 = ( 0.6 ) ( 2 t + 2 ) + ( 0.4 ) t 2
μ = 4 5 , ( 0 , ) : Δ 4 5 t 2 = ( 0.8 ) ( 2 t + 2 ) + ( 0.2 ) t 2
μ = 1 , ( 0 , ) : Δ 1 t 2 = ( 2 t + 2 ) .
(ii) 
w ( t ) = l o g ( a t ) + e a t , t 0 and a = 0.5 at μ = n 5 , 0 n 5 , we have the following:
μ = 0 , ( 0 , ) : Δ 0 ( l o g ( a t ) + e a t ) = e a t
μ = 1 5 , ( 0 , ) : Δ 1 5 ( l o g ( a t ) + e a t ) = ( 0.2 ) l o g t + t + ( 0.6 + 0.2 a ) e a t
μ = 2 5 , ( 0 , ) : Δ 2 5 ( l o g ( a t ) + e a t ) = ( 0.4 ) l o g t + t + ( 0.2 + 0.4 a ) e a t
μ = 3 5 , ( 0 , ) : Δ 3 5 ( l o g ( a t ) + e a t ) = ( 0.6 ) l o g t + t + ( 0.2 + 0.6 a ) e a t
μ = 4 5 , ( 0 , ) : Δ 4 5 ( l o g ( a t ) + e a t ) = ( 0.8 ) l o g t + t + ( 0.6 + 0.8 a ) e a t
μ = 1 , ( 0 , ) : Δ 1 ( l o g ( a t ) + e a t ) = l o g t + t + ( 1 + a ) e a t .
The following Figure 1a–d shows the graphical representation for the given fuction w ( t ) = t 2 .
In Figure 1, we visually depict the transformation of the generalized proportional differences of t 2 from t 2 to 2 t + 2 as μ increases from 0 to 1. Moreover, the graphical representation in Figure 2 depicts the generalized proportional difference of w ( t ) = log ( a t ) + e a t for various shift values .
The efficacy of Theorem 2 is demonstrated through the illustrative example presented in Example 2.
Example 2.
If θ is expressed in degrees with positive real values in an anticlockwise orientation, then
tan ( t + n θ ) = i = 0 n n C i 1 ( 2 μ 1 ) i r = 0 i i C r μ i r ( 1 2 μ ) r t a n [ t + ( i r ) ] .
The effectiveness of Theorem 4 is verified through the following illustrative Example 3.
Example 3.
By taking = 3 , μ = 0.2 and t = 7 in (16), we obtain
1 0.2 k = 1 2 2 1 0.2 k 1 = 1 ( 1 0.2 ) 2 1 0.2 2 1 ( 1 0.2 ) = 10 .
The effectiveness of Theorem 4 is verified through the following illustrative example.
Example 4.
Using m = 2 , t = 7 , = 2 and μ = 0.6 in (22), we obtain
1 0.6 k = 1 3 2 1 0.6 k 1 ( 7 2 k ) 2 = F 2 ( 7 ) 2 1 0.6 3 F 2 ( 1 ) = 46.851851 ,
where F 2 ( 7 ) = 47.5 and F 2 ( 1 ) = 17.5 .
The effectiveness of Theorem 5 is verified through the following illustrative Example 5.
Example 5.
Using m = 3 , t = 13 , = 3 and μ = 0.3 in (5), we get
1 0.3 k = 1 4 2 1 0.3 k 1 ( 13 3 k ) ( 3 ) = G 3 ( 13 ) 2 1 0.3 3 G 3 ( 1 ) = 682.46914 ,
where F 2 ( 7 ) = 749.79592 and F 2 ( 1 ) = 21.25781 .
The effectiveness of Theorem 6 is verified through the following illustrative Example 6.
Example 6.
Substituting m = 1 , t = 7 , = 2 , a = 2 and μ = 0.1 in Theorem 6, we get
1 0.1 k = 1 4 2 1 0.1 k 1 ( 7 2 k ) 2 ( 7 2 k ) = H 1 ( 7 ) 2 1 0.1 3 H 1 ( 1 ) = 960 ,
where H 1 ( 7 ) = 675.55556 and H 1 ( 1 ) = 0.55556 .
The following Figure 3, Figure 4, Figure 5, Figure 6 and Figure 7 show the generalized discrete proportional Laplace transform of a unit step function, the generalized discrete proportional Laplace transform of e a t , the generalized discrete proportional Laplace transform of e a t , the generalized discrete proportional Laplace transform of c o s ( a t ) , and the generalized discrete proportional Laplace transform of s i n ( a t ) .

7. Conclusions

This article explores the generalized discrete proportional case of Leibnitz’s theorem, binomial expansion, and Montmort’s equations by establishing the difference operator. The authors developed the inverse generalized proportional delta operator and obtained exact and numerical solutions for diverse functions. We also addressed applications in various types of APs of finite series involving the operator, and defined and obtained the GDPLT of various functions. We provide and confirm MATLAB examples to demonstrate our findings. Similarly, one can find the generalized discrete proportional Laplace transform of other functions. Readers (researchers) can discover several applications in the fields of control systems and engineering, as well as image processing. Our future studies will continue in this vein.

Author Contributions

R.P. and M.R., writing—original draft: R.P. methodology: R.P., M.R. and H.G., conceptualization: R.P. and S.S., supervision: R.P., M.R. and S.S., investigation: R.P., M.R., H.G. and S.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by “Researchers Supporting Project number (RSPD2023R683), King Saud University, Riyadh, Saudi Arabia”. This work was also funded by the Centre for Nonlinear Systems, Chennai Institute of Technology (CIT), India, funding number CIT/CNS/2023/RP-005.

Data Availability Statement

There is no data contained in this article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Moumen, A.; Mennouni, A.; Bouye, M. A novel Vieta–Fibonacci projection method for solving a system of fractional integro differential equations. Mathematics 2023, 11, 3985. [Google Scholar] [CrossRef]
  2. Malinowska, A.B.; Torres, D.F.M. Generalized natural boundary conditions for fractional variational problems in terms of the Caputo derivative. Comput. Math. Appl. 2010, 59, 3110–3116. [Google Scholar] [CrossRef]
  3. Michal, F.; JinRong, W.; Michal, P. Fractional integral equations. Fractional Order Equations and Inclusions; De Gruyter: Berlin, Germany; Boston, MA, USA, 2017; pp. 37–90. [Google Scholar]
  4. Jafari, H.; Tuan, N.A.; Ganji, R.M. A new numerical scheme for solving pantograph type nonlinear fractional integro-differential equations. J. King Saud Univ. 2021, 33, 101185. [Google Scholar] [CrossRef]
  5. Sabatier, J.; Agrawal, O.P.; Machado, J.A.T. Advances in Fractional Calculus; Springer: Dordrecht, The Netherlands, 2007. [Google Scholar]
  6. Almeida, R.; Torres, D.F.M. Necessary and sufficient conditions for the fractional calculus of variations with Caputo derivatives. Commun. Nonlinear Sci. Numer. Simul. 2011, 16, 1490–1500. [Google Scholar] [CrossRef]
  7. Magin, R.L. Fractional Calculus in Bio Engineering; Begell House: Danbury, CT, USA, 2006. [Google Scholar]
  8. Micula, S. An iterative numerical method for fractional integral equations of the second kind. J. Comput. Appl. Math. 2018, 339, 124–133. [Google Scholar] [CrossRef]
  9. Mickens, R.E. Difference Equations; Van Nostrand Reinhold Company: New York, NY, USA, 1990. [Google Scholar]
  10. Agarwal, R.P. Difference Equations and Inequalities; Marcel Dekker: New York, NY, USA, 2000. [Google Scholar]
  11. Miller, K.S.; Ross, B. An Introduction to the Fractional Calculus and Fractional Differential Equations; Wiley: New York, NY, USA, 1993. [Google Scholar]
  12. Samko, S.G.; Kilbas, A.A.; Marichev, O.I. Fractional Integrals and Derivatives, Translated from the 1987 Russian Original; Gordon and Breach: Yverdon, Switzerland, 1993. [Google Scholar]
  13. Kang, Y.; Xie, Y.; Lu, J.; Jiang, J. On the nonexistence of non-constant exact periodic solutions in a class of the Caputo fractional-order dynamical systems. Nonlinear Dyn. 2015, 82, 1259–1267. [Google Scholar] [CrossRef]
  14. Almeida, R.; Torres, D.F.M. Calculus of variations with fractional derivatives and fractional integrals. Appl. Math. Letter. 2009, 22, 1816–1820. [Google Scholar] [CrossRef]
  15. Frederico, G.S.F.; Torres, D.F.M. Fractional conservation laws in optimal control theory. Nonlinear Dyn. 2008, 53, 215–222. [Google Scholar] [CrossRef]
  16. El-Nabulsi, R.A.; Torres, D.F.M. Necessary optimality conditions for fractional action-like integrals of variational calculus with Riemann–Liouville derivatives of order (α, β). Math. Methods Appl. Sci. 2007, 30, 1931–1939. [Google Scholar] [CrossRef]
  17. Mozyrska, D.; Torres, D.F.M. Minimal modified energy control for fractional linear control systems with the Caputo derivative. Carpathian J. Math. 2010, 26, 210–221. [Google Scholar]
  18. Bastos, N.R.O.; Ferreira, R.A.C.; Torres, D.F.M. Discrete time fractional variational problems. Signal Process 2011, 91, 513–524. [Google Scholar] [CrossRef]
  19. Ferreira, R.A.C.; Torres, D.F.M. Fractional h-difference equations arising from the calculus of variations. Appl. Anal. Discret. Math. 2011, 5, 110–121. [Google Scholar] [CrossRef]
  20. Miller, K.S.; Ross, B. Fractional Difference Calculus, in Univalent Functions, Fractional Calculus, and Their Applications; Horwood: Chichester, UK, 1989; pp. 139–152. [Google Scholar]
  21. Xavier, G.B.A.; Rajiniganth, P. Finite series and closed form solution of nth order α difference equation. Int. J. Pure Appl. Math. 2016, 90, 671–681. [Google Scholar]
  22. Xavier, G.B.A.; Rajiniganth, P.; Chandrasekar, V. Finite series and closed form solution of second order α-difference equation. Int. J. Pure Appl. Math. 2014, 90, 177–188. [Google Scholar] [CrossRef]
  23. Xavier, G.B.A.; Rajiniganth, P.; Chandrasekar, V.; Manuel, M.M.S. Forward (α, β)-difference operator and its some applications in number theory. Int. J. Appl. Math. 2012, 25, 109–124. [Google Scholar]
  24. Abdeljawad, Z.L.T.; Jarad, F. On existence–uniqueness results for proportional fractional differential equations and incomplete gamma functions. Adv. Differ. Equ. 2020, 2020, 641. [Google Scholar]
  25. Abbas, M.I.; Hristova, S. Existence nesults of Non linear generalized proportional fractional differential inclusions via the diagonalization technique. AIMS Math. 2021, 76, 12832–12844. [Google Scholar] [CrossRef]
  26. Swarnaka, J. Discrete time realization of fractional order proportional integral controller for a class of fractional order system. Numer. Algebr. Control. Optim. 2022, 12, 309–320. [Google Scholar] [CrossRef]
  27. Laura, A.L.G.; Grace, K.B. The calculus of proportional α-derivatives. Rose-Hulman Undergrad. Math. J. 2017, 18, 20–42. [Google Scholar]
Figure 1. Generalized proportional difference of w ( t ) = t 2 for different shift values .
Figure 1. Generalized proportional difference of w ( t ) = t 2 for different shift values .
Fractalfract 07 00838 g001
Figure 2. Generalized proportional difference of w ( t ) = l o g ( a t ) + e a t for different shift values .
Figure 2. Generalized proportional difference of w ( t ) = l o g ( a t ) + e a t for different shift values .
Fractalfract 07 00838 g002
Figure 3. Generalized discrete proportional Laplace transform of the unit step function: (a) is the input signal, (bd) show the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Figure 3. Generalized discrete proportional Laplace transform of the unit step function: (a) is the input signal, (bd) show the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Fractalfract 07 00838 g003
Figure 4. Generalized discrete proportional Laplace transform of e a t : (a) is the input signal, (bd) shows the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Figure 4. Generalized discrete proportional Laplace transform of e a t : (a) is the input signal, (bd) shows the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Fractalfract 07 00838 g004
Figure 5. Generalized discrete proportional Laplace transform of e a t : (a) is the input signal, (bd) shows the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Figure 5. Generalized discrete proportional Laplace transform of e a t : (a) is the input signal, (bd) shows the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Fractalfract 07 00838 g005
Figure 6. Generalized discrete proportional Laplace transform of c o s ( a t ) : (a) is the input signal, (bd) shows the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Figure 6. Generalized discrete proportional Laplace transform of c o s ( a t ) : (a) is the input signal, (bd) shows the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Fractalfract 07 00838 g006
Figure 7. Generalized discrete proportional Laplace transform of s i n ( a t ) : (a) is the input signal, (bd) shows the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Figure 7. Generalized discrete proportional Laplace transform of s i n ( a t ) : (a) is the input signal, (bd) shows the output signal with fixed ( 0.2 , 0.5 , and 1 ) and various μ .
Fractalfract 07 00838 g007
Table 1. Comparison.
Table 1. Comparison.
FunctionsNumerical SolutionExact Solution
1 1 μ k = 1 t 2 1 μ k 1 1 ( 1 μ ) 1 2 1 μ t j
t 1 μ k = 1 t 2 1 μ k 1 ( t k ) F 1 ( t ) 2 1 μ t F 1 ( j ) , where
F 1 ( t ) = t ( 1 μ ) 2 μ ( 1 μ ) 2
t m 1 μ k = 1 t 2 1 μ k 1 ( t k ) m F n ( t ) 2 1 μ t F n ( j ) , where
F n ( t ) = t m 1 μ + k = 1 m ( μ ) k ( 1 μ ) k + 1 Δ μ t m
t ( m ) 1 μ k = 1 t 2 1 μ k 1 ( t k ) ( m ) G n ( t ) 2 1 μ t G n ( j ) , where
G n ( t ) = t ( m ) 1 μ + k = 1 m ( μ ) k ( 1 μ ) k + 1 Δ μ t ( m )
t m a t 1 μ k = 1 t 2 1 μ k 1 ( t k ) m a t k H m ( t ) 2 1 μ t H m ( j ) , where
H m ( t ) = t m a t 1 2 μ + μ a +
k = 1 m ( μ ) k ( 1 2 μ + μ a ) k + 1 Δ ( t m ) L m ( a t ) .
λ k P k 1 μ k = 1 t 2 1 μ k 1 L ( λ k P k ) λ t ( λ 1 ) ( 1 2 μ ) i = 0 ( 1 ) i λ i ( λ 1 ) i ( 1 2 μ ) i P ( t ) | j t
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Pandurangan, R.; Shanmugam, S.; Rhaima, M.; Ghoudi, H. The Generalized Discrete Proportional Derivative and Its Applications. Fractal Fract. 2023, 7, 838. https://doi.org/10.3390/fractalfract7120838

AMA Style

Pandurangan R, Shanmugam S, Rhaima M, Ghoudi H. The Generalized Discrete Proportional Derivative and Its Applications. Fractal and Fractional. 2023; 7(12):838. https://doi.org/10.3390/fractalfract7120838

Chicago/Turabian Style

Pandurangan, Rajiniganth, Saravanan Shanmugam, Mohamed Rhaima, and Hamza Ghoudi. 2023. "The Generalized Discrete Proportional Derivative and Its Applications" Fractal and Fractional 7, no. 12: 838. https://doi.org/10.3390/fractalfract7120838

Article Metrics

Back to TopTop