THEORETICAL AND NUMERICAL COMPUTATIONS OF CONVEXITY ANALYSIS FOR FRACTIONAL DIFFERENCES USING LOWER BOUNDEDNESS

Pshtiwan Othman Mohammed, Dumitru Baleanu*, Eman Al-Sarairah, Thabet Abdeljawad*, Nejmeddine Chorfi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

This study focuses on the analytical and numerical solutions of the convexity analysis for fractional differences with exponential and Mittag-Leffler kernels involving negative and nonnegative lower bounds. In the analytical part of the paper, we will give a new formula for 2 of the discrete fractional differences, which can be useful to obtain the convexity results. The correlation between the nonnegativity and negativity of both of the discrete fractional differences, (aCFRαf)(t)and(aABRαf)(t), with the convexity of the functions will be examined. In light of the main lemmas, we will define the two decreasing subsets of (2, 3), namely k, and k,. The decrease of these sets enables us to obtain the relationship between the negative lower bound of αf)(t) and the convexity of the function on a finite time set given by Na+1P:= {a + 1,a + 2,...,P}, for some P Na+1:= {a + 1,a + 2,...}. Besides, the numerical part of the paper is dedicated to examine the validity of the sets k, and k, in certain regions of the solutions for different values of k and k. For this reason, we will illustrate the domain of the solutions by means of several figures in which the validity of the main theorems are explained.

Original languageEnglish
Article number2340183
JournalFractals
DOIs
Publication statusAccepted/In press - 2023
Externally publishedYes

Keywords

  • AB and CF Fractional Differences
  • Convexity Analysis
  • Negative and Nonnegative Lower Bounds
  • Theoretical and Numerical Results

Fingerprint

Dive into the research topics of 'THEORETICAL AND NUMERICAL COMPUTATIONS OF CONVEXITY ANALYSIS FOR FRACTIONAL DIFFERENCES USING LOWER BOUNDEDNESS'. Together they form a unique fingerprint.

Cite this