<p>We investigate a specific category of perturbed sweeping processes characterized by a fractional Caputo-type derivative in Hilbert spaces, conveyed by <Equation ID="Equ75"> <MediaObject ID="MO1"> <ImageObject Color="BlackWhite" FileRef="MediaObjects/40590_2025_756_Equ75_HTML.png" Format="PNG" Height="50" Rendition="HTML" Resolution="300" Type="Linedraw" Width="973" /> </MediaObject> </Equation>Our study presents results on existence and uniqueness. More specifically, we utilize a method founded on rigorous reasoning to demonstrate the existence of the fractional sweeping process. This approach continues to draw on the fundamental principles of J. J. Moreau’s catching-up algorithm. In this context, we design a modified catching-up algorithm suited to the fractional framework, facilitating the generation of a sequence of approximate solutions. These theoretical results are supported by numerical simulations. For the numerical solution of our problem, we begin by presenting the method used. Then, we implement the algorithm introduced in the proof of the existence and uniqueness result to obtain approximate solutions to the studied problem.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Perturbed Caputo fractional Moreau’s sweeping process: existence, uniqueness, and numerical simulations

  • M. I. El Bahi,
  • Z. Faiz,
  • H. Benaissa,
  • J. Vanterler da C. Sousa,
  • K. Hilal

摘要

We investigate a specific category of perturbed sweeping processes characterized by a fractional Caputo-type derivative in Hilbert spaces, conveyed by Our study presents results on existence and uniqueness. More specifically, we utilize a method founded on rigorous reasoning to demonstrate the existence of the fractional sweeping process. This approach continues to draw on the fundamental principles of J. J. Moreau’s catching-up algorithm. In this context, we design a modified catching-up algorithm suited to the fractional framework, facilitating the generation of a sequence of approximate solutions. These theoretical results are supported by numerical simulations. For the numerical solution of our problem, we begin by presenting the method used. Then, we implement the algorithm introduced in the proof of the existence and uniqueness result to obtain approximate solutions to the studied problem.