Numerical methods for evolutionary reaction-diffusion problems with nonlinear reaction terms

Authors:
J. C. Jorge;B. Bujanda
Affiliations:
Departamento de Matemática e Informática, Universidad Pública de Navarra, Edificio Los Acebos, Campus Arrosadía s/n, Pamplona 31006, Spain;Departamento de Matemática e Informática, Universidad Pública de Navarra, Edificio Los Acebos, Campus Arrosadía s/n, Pamplona 31006, Spain
Venue:
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on boundary and interior layers - computational and asymptotic methods (BAIL 2002)
Year:
2004

Citing 5
Cited 1

A uniformly convergent finite difference scheme for a singularly perturbed semilinear equation

SIAM Journal on Numerical Analysis
On the non-existence of &egr;-uniform finite difference methods on uniform meshes for semilinear two-point boundary value problems

Mathematics of Computation
A fractional step method on a special mesh for the resolution multidimensional evolutionary convection-diffusion problems

Applied Numerical Mathematics
Stability results for fractional step discretizations of time dependent coefficient evolutionary problems

Applied Numerical Mathematics
Numerical Methods for Evolutionary Convection-Diffusion Problems with Nonlinear Reaction Terms

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers

Stability results for linearly implicit fractional step discretizations of non-linear time dependent parabolic problems

Applied Numerical Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have developed new methods to integrate efficiently reaction-diffusion parabolic problems with non-linear reaction terms. In order to obtain uniform and unconditional convergence, such methods combine the advantages of alternating direction methods, the additive Runge-Kutta methods designed by Cooper and Sayfy for nonlinear Stiff problems as well as the use of Shishkin meshes in the singularly perturbed case. The resulting algorithms are only linearly implicit and they have the same order of computational complexity, per time step, that any explicit method. We show some numerical experiences which illustrate the good properties of our schemes predicted by the theoretical results.