Error analysis of arbitrarily high-order stepping schemes for fractional integro-differential equations with weakly singular kernels

Abstract: We propose high-order computational schemes for solving nonlinear fractional integro-differential equations (FIDEs) that are commonly used to model systems with memory or long-term behavior. From the known structure of the smooth solution, we show that the solutions of such FIDEs are equivalent to those of Volterra integral equations (VIEs). The fractional integral appearing in the integral form of the resulting VIE is then split into a history term and a local term. Subsequently, we develop an efficient strategy that utilizes a combination of a kernel compression scheme and an integral deferred correction (IDC) scheme to obtain a high-order solution. The kernel compression scheme reduces the costs in approximating the history term, while the IDC scheme approximates VIEs on short intervals to obtain the local information. Error analysis demonstrates high-order accuracy of the proposed schemes, and numerical examples illustrate their effectiveness, particularly for nonlinear FIDEs. The results suggest that the proposed scheme provides accurate solutions even for large time steps, making it a valuable tool for researchers and engineers working on systems with memory or long-term behavior.

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: Error analysis of arbitrarily high-order stepping schemes for fractional integro-differential equations with weakly singular kernels ; volume:13 ; number:1 ; year:2024 ; extent:12 ; Nonlinear engineering ; 13, Heft 1 (2024) (gesamt 12)

Contributors, Places and Time

• Creator: Al-Shara’, Safwan ; Awawdeh, Fadi ; Rawashdeh, Edris ; Alsayyed, Omar ; Alshorman, Rafat

Further information

• DOI: 10.1515/nleng-2024-0020
• URN: urn:nbn:de:101:1-2408101812176.531828229372
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 28.02.2026, 8:58 PM CET