Implicit-explicit time integration of nonlinear fractional differential equations

Efficient long-time integration of nonlinear fractional differential equations is significantly challenging due to the integro-differential nature of the fractional operators. In addition, the inherent non-smoothness introduced by the inverse power-law kernels deteriorates the accuracy and efficienc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied numerical mathematics 2020-10, Vol.156, p.555-583
Hauptverfasser: Zhou, Yongtao, Suzuki, Jorge L., Zhang, Chengjian, Zayernouri, Mohsen
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Efficient long-time integration of nonlinear fractional differential equations is significantly challenging due to the integro-differential nature of the fractional operators. In addition, the inherent non-smoothness introduced by the inverse power-law kernels deteriorates the accuracy and efficiency of many existing numerical methods. We develop two efficient first- and second-order implicit-explicit (IMEX) methods for accurate time-integration of stiff/nonlinear fractional differential equations with fractional order α∈(0,1] and prove their convergence and linear stability properties. The developed methods are based on a linear multi-step fractional Adams-Moulton method (FAMM), followed by the extrapolation of the nonlinear force terms. In order to handle the singularities nearby the initial time, we employ Lubich-like corrections to the resulting fractional operators. The obtained linear stability regions of the developed IMEX methods are larger than existing IMEX methods in the literature. Furthermore, the size of the stability regions increase with the decrease of fractional order values, which is suitable for stiff problems. We also rewrite the resulting IMEX methods in the language of nonlinear Toeplitz systems, where we employ a fast inversion scheme to achieve a computational complexity of O(Nlog⁡N), where N denotes the number of time-steps. Our computational results demonstrate that the developed schemes can achieve global first- and second-order accuracy for highly-oscillatory stiff/nonlinear problems with singularities.
ISSN:0168-9274
1873-5460
DOI:10.1016/j.apnum.2020.04.006