<p>This article considers a class of nonlinear spatial fractional backward diffusion problems. Implicit integration factor (IIF) format is a highly competitive approach for solving nonlinear diffusion systems, which has considerable stability and robustness. Therefore, we extend it to solve the nonlinear backward diffusion system, which is called the backward implicit integration factor (BIIF) method. The stability and error analysis of BIIF are introduced. In order to improve the computational efficiency of implementing BIIF, we propose the ARA-BG fast solving algorithm, which combines the adaptive restarting shift-invert Arnoldi (ARA) algorithm and the BiCGSTAB (BG) algorithm. Numerical experiments show that the BIIF method can achieve more stable and ideal accuracy compared to the Crank-Nicolson method, and also verify that the proposed ARA-BG algorithm is the most competitive among all tested algorithms in terms of CPU.</p>

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

A fast backward implicit integration factor scheme for nonlinear spatial fractional backward diffusion problems

  • Huanyan Jian,
  • Ping Xiong,
  • Xiaomei Qu,
  • Tao Liu,
  • Wenrong Tan

摘要

This article considers a class of nonlinear spatial fractional backward diffusion problems. Implicit integration factor (IIF) format is a highly competitive approach for solving nonlinear diffusion systems, which has considerable stability and robustness. Therefore, we extend it to solve the nonlinear backward diffusion system, which is called the backward implicit integration factor (BIIF) method. The stability and error analysis of BIIF are introduced. In order to improve the computational efficiency of implementing BIIF, we propose the ARA-BG fast solving algorithm, which combines the adaptive restarting shift-invert Arnoldi (ARA) algorithm and the BiCGSTAB (BG) algorithm. Numerical experiments show that the BIIF method can achieve more stable and ideal accuracy compared to the Crank-Nicolson method, and also verify that the proposed ARA-BG algorithm is the most competitive among all tested algorithms in terms of CPU.