Smoothing schemes for reaction-diffusion systems with nonsmooth data

被引:63
|
作者
Khaliq, A. Q. M. [2 ]
Martin-Vaquero, J. [3 ]
Wade, B. A. [1 ]
Yousuf, M. [4 ]
机构
[1] Univ Wisconsin, Dept Math Sci, Milwaukee, WI 53201 USA
[2] Middle Tennessee State Univ, Dept Math Sci, Murfreesboro, TN 37132 USA
[3] Univ Salamanca, ETS Ingn Ind, Bejar 37700, Spain
[4] King Fahd Univ Petr & Minerals, Dept Math Sci, Dhahran 31261, Saudi Arabia
关键词
Pade scheme; Parabolic problem; Nonsmooth data; Allen-Cahn equation; Robertson equation; FITTING BDF ALGORITHMS; PARABOLIC PROBLEMS; TIME; EQUATIONS; STABILITY; PDES;
D O I
10.1016/j.cam.2008.01.017
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Cox and Matthews [S.M. Cox, P.C. Matthews, Exponential time differencing for stiff systems. J. Comput. Phys. 176 (2002) 430-455] developed a class of Exponential Time Differencing Runge-Kutta schemes (ETDRK) for nonlinear parabolic equations: Kassam and Trefethen [A.K. Kassam, Ll. N. Trefethen. Fouth-order time stepping for stiff pdes, SIAM J. Sci. Comput. 26 (2005) 1214-1233] have shown that these schemes can suffer from numerical instability and they proposed a modified form of the fourth-order (ETDRK4) scheme. They use complex contour integration to implement these schemes in a way that avoids inaccuracies when inverting matrix polynomials. but this approach creates new difficulties in choosing and evaluating the contour for larger problems. Neither treatment addresses problems with nonsmooth data, where spurious oscillations can swamp the numerical approximations if one does not treat the problem carefully. Such problems with irregular initial data or mismatched initial and boundary conditions are important in various applications, including computational chemistry and financial engineering. We introduce a new version of the fourth-order Cox-Matthews, Kassam-Trefethen ETDRK4 scheme designed to eliminate the remaining computational difficulties. This new scheme utilizes an exponential time differencing Runge-Kutta ETDRK scheme using a diagonal Pade approximation of matrix exponential functions, while to deal with the problem of nonsmooth data we use several steps of an ETDRK scheme using sub-diagonal Pade formula. The new algorithm improves computational efficiency with respect to evaluation of the high degree polynomial functions of matrices, having an advantage of splitting the matrix polynomial inversion problem into sum of linear problems that can be solved in parallel. In this approach it is only required that several backward Euler linear problems be solved, in serial or parallel. Numerical experiments are described to support the new scheme. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:374 / 386
页数:13
相关论文
共 50 条