scholarly journals Fast Adomian decomposition method for the Cauchy problem of the time-fractional reaction diffusion equation

2016 ◽  
Vol 8 (2) ◽  
pp. 168781401662989 ◽  
Author(s):  
Xiang-Chao Shi ◽  
Lan-Lan Huang ◽  
Yi Zeng
2012 ◽  
Vol 67 (6-7) ◽  
pp. 355-362 ◽  
Author(s):  
Salman Nourazar ◽  
Akbar Nazari-Golshan ◽  
Ahmet Yıldırım ◽  
Maryam Nourazar

The physical science importance of the Cauchy problem of the reaction-diffusion equation appears in the modelling of a wide variety of nonlinear systems in physics, chemistry, ecology, biology, and engineering. A hybrid of Fourier transform and Adomian decomposition method (FTADM) is developed for solving the nonlinear non-homogeneous partial differential equations of the Cauchy problem of reaction-diffusion. The results of the FTADM and the ADM are compared with the exact solution. The comparison reveals that for the same components of the recursive sequences, the errors associated with the FTADM are much lesser than those of the ADM. We show that as time increases the results of the FTADM approaches 1 with only six recursive terms. This is in agreement with the physical property of the density-dependent nonlinear diffusion of the Cauchy problem which is also in agreement with the exact solution. The monotonic and very rapid convergence of the results of the FTADM towards the exact solution is shown to be much faster than that of the ADM


2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Chunye Gong ◽  
Weimin Bao ◽  
Guojian Tang ◽  
Yuewen Jiang ◽  
Jie Liu

The computational complexity of one-dimensional time fractional reaction-diffusion equation isO(N2M)compared withO(NM)for classical integer reaction-diffusion equation. Parallel computing is used to overcome this challenge. Domain decomposition method (DDM) embodies large potential for parallelization of the numerical solution for fractional equations and serves as a basis for distributed, parallel computations. A domain decomposition algorithm for time fractional reaction-diffusion equation with implicit finite difference method is proposed. The domain decomposition algorithm keeps the same parallelism but needs much fewer iterations, compared with Jacobi iteration in each time step. Numerical experiments are used to verify the efficiency of the obtained algorithm.


2004 ◽  
Vol 4 (3) ◽  
Author(s):  
Shoshana Kamin ◽  
Philip Rosenau

AbstractIn this work we prove that for some class of initial data the solution of the Cauchy problemuu(0; x) = uapproaches the travelling solution, spreading either to the right or to the left, or two travelling waves moving in opposite directions.


Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 353
Author(s):  
Rubén Caballero ◽  
Alexandre N. Carvalho ◽  
Pedro Marín-Rubio ◽  
José Valero

In this paper, we study the structure of the global attractor for the multivalued semiflow generated by a nonlocal reaction-diffusion equation in which we cannot guarantee the uniqueness of the Cauchy problem. First, we analyse the existence and properties of stationary points, showing that the problem undergoes the same cascade of bifurcations as in the Chafee-Infante equation. Second, we study the stability of the fixed points and establish that the semiflow is a dynamic gradient. We prove that the attractor consists of the stationary points and their heteroclinic connections and analyse some of the possible connections.


Sign in / Sign up

Export Citation Format

Share Document