Volume 56, Number 2, March-April 2022
|Page(s)||637 - 648|
|Published online||14 April 2022|
Sufficient conditions for extremum of fractional variational problems
Department of Mathematics, Veer Surendra Sai University of Technology, Burla 768018, India
2 Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA
* Corresponding author: email@example.com
Accepted: 27 February 2022
Sufficient conditions for extremum of fractional variational problems are formulated with the help of Caputo fractional derivatives. The Euler–Lagrange equation is defined in the Caputo sense and Jacobi conditions are derived using this. Again, Wierstrass integral for the considered functional is obtained from the Jacobi conditions and the transversality conditions. Further, using the Taylor’s series expansion with Caputo fractional derivatives in the Wierstrass integral, the Legendre’s sufficient condition for extremum of the fractional variational problem is established. Finally, a suitable counterexample is presented to justify the efficacy of the fresh findings.
Mathematics Subject Classification: 26A33 / 58E15 / 34K37 / 49K10 / 49K20 / 35R11
Key words: Caputo fractional derivative / Jacobi conditions / transversality conditions / Wierstrass integral / Legendre’s condition
© The authors. Published by EDP Sciences, ROADEF, SMAI 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.