Saad A. Manaa
Saad A. Manaa
Saad A. Manaa
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
An Approximate Solution to The Newell-Whitehead Equation by …From eq. (21) and eq. (22), the iterates are determined by the following recursive way:u0= u0(x)(24)−1−1un= L ( ∆un−1+ un−1)− L ( An−1),n ≥ 1.The decomposition method provides a reliable technique that requires less work ifcompared with traditional techniques.4. Application and Numerical ResultsTo give a clear overview of the methodology, the following example will bediscussed. All the results are calculated by using the MATLAB 7.4 software.Consider the Newell-Whitehead equation [11]∂u= ∆u+ u(1− u∂twith the initial conditions2)(0..5( 2a) x)( −0.5(2a) x)a c1e − c2eu ( x,0)= −(25)(0.5( 2a) x)( −0.5(2a) x)b ( c e + c e + 1)And exact Solutionu(x,t)= −ab1( c e1c1e(0.5( 2a) x)2(0..5( 2a) x)+ c2e− c2e( −0.5(2a) x)( −0.5(2a) x)+ c3e( −3 / 2) a tSubstitution the initial condition eq. (25) into eq. (24) and using eq. (23) tocalculate the Adomian polynomials, yields the following recursive relation)(23)u0= −ab( cce(0..5( 2a) x)1(0.5( 2a) x)1eWe will takeseries are given by:− c e+ c( −0.5(2a) x)2( −0.5(2a) x)2e+ 1)(26). The first few terms of the decomposition(27)175