Approximation of inverse problems for fractional differential equations in abstract spaces

This article focuses on approximating a fractional-order inverse problem (IP) for an abstract differential equation in a Hilbert space. The main tools to find out the results are fixed-point methods, the α -resolvent family, and optimal control (OC) theory. We have defined an optimal control problem corresponding to the original inverse problem, and then by using an approximate optimal control problem, we have proved that the sequence of solutions to this approximate optimal control problem will converge to the solution of our original inverse problem. Furthermore, the fractional Crank–Nicolson scheme and a matrix optimization algorithm are utilized to derive approximation results, ensuring the convergence of the proposed numerical method. Finally, an example is presented to illustrate and validate the theoretical findings.

Authors

Institutions

Publication Details

Journal
Alexandria Engineering Journal
Published
2025-03-07
DOI
https://doi.org/10.1016/j.aej.2025.02.079
Citations
1
Primary Topic
Numerical methods in inverse problems
Type
article
Field-Weighted Citation Impact
3.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Approximation of inverse problems for fractional differential equations in abstract spaces

Santosh Ruhil, Muslim Malik, Kottakkaran Sooppy Nisar, Fahad Sameer Alshammari
1 citations
Alexandria Engineering Journal
Numerical methods in inverse problems
3.69
article

Approximation of inverse problems for fractional differential equations in abstract spaces

Santosh Ruhil, Muslim Malik, Kottakkaran Sooppy Nisar, Fahad Sameer Alshammari
article en
1 citations

Abstract

This article focuses on approximating a fractional-order inverse problem (IP) for an abstract differential equation in a Hilbert space. The main tools to find out the results are fixed-point methods, the α -resolvent family, and optimal control (OC) theory. We have defined an optimal control problem corresponding to the original inverse problem, and then by using an approximate optimal control problem, we have proved that the sequence of solutions to this approximate optimal control problem will converge to the solution of our original inverse problem. Furthermore, the fractional Crank–Nicolson scheme and a matrix optimization algorithm are utilized to derive approximation results, ensuring the convergence of the proposed numerical method. Finally, an example is presented to illustrate and validate the theoretical findings.

Alexandria Engineering JournalVol. 121
Prince Sattam Bin Abdulaziz University (SA), Indian Statistical Institute (IN), Indian Institute of Technology Mandi (IN)
Prince Sattam bin Abdulaziz University
Openalex Percentile: Top 13%
Numerical methods in inverse problems
3.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.