## Abstract

An efficient numerical scheme is developed to solve a linearized time fractional KdV equation on unbounded spatial domains. First, the exact absorbing boundary conditions (ABCs) are derived which reduces the pure initial value problem into an equivalent initial boundary value problem on a finite interval that contains the compact support of the initial data and the inhomogeneous term. Second, the stability of the reduced initial-boundary value problem is studied in detail. Third, an efficient unconditionally stable finite difference scheme is constructed to solve the initial-boundary value problem where the nonlocal fractional derivative is evaluated via a sum-ofexponentials approximation for the convolution kernel. As compared with the direct method, the resulting algorithm reduces the storage requirement from O(MN) to O(M log^{d} N) and the overall computational cost from O(MN^{2}) to O(MN log^{d} N) with M the total number of spatial grid points and N the total number of time steps. Here d = 1 if the final time T is much greater than 1 and d = 2 if T ≈ 1. Numerical examples are given to demonstrate the performance of the proposed numerical method.

Original language | English (US) |
---|---|

Pages (from-to) | 693-719 |

Number of pages | 27 |

Journal | Mathematics of Computation |

Volume | 87 |

Issue number | 310 |

DOIs | |

State | Published - 2018 |

## All Science Journal Classification (ASJC) codes

- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics