A new class of semi-implicit methods with linear complexity for nonlinear fractional differential equations

From MaRDI portal
Publication:4683936

DOI10.1137/18M1168169zbMATH Open1404.65105arXiv1808.02170OpenAlexW2963688266WikidataQ129222675 ScholiaQ129222675MaRDI QIDQ4683936FDOQ4683936


Authors: Fanhai Zeng, I. Turner, Kevin Burrage, George Em Karniadakis Edit this on Wikidata


Publication date: 26 September 2018

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: We propose a new class of semi-implicit methods for solving nonlinear fractional differential equations and study their stability. Several versions of our new schemes are proved to be unconditionally stable by choosing suitable parameters. Subsequently, we develop an efficient strategy to calculate the discrete convolution for the approximation of the fractional operator in the semi-implicit method and we derive an error bound of the fast convolution. The memory requirement and computational cost of the present semi-implicit methods with a fast convolution are about O(NlognT) and O(NnTlognT), respectively, where N is a suitable positive integer and nT is the final number of time steps. Numerical simulations, including the solution of a system of two nonlinear fractional diffusion equations with different fractional orders in two-dimensions, are presented to verify the effectiveness of the semi-implicit methods.


Full work available at URL: https://arxiv.org/abs/1808.02170




Recommendations




Cites Work


Cited In (20)





This page was built for publication: A new class of semi-implicit methods with linear complexity for nonlinear fractional differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4683936)