RELIABLE ITERATIVE METHODS FOR SOLVING 1D, 2D AND 3D FISHER’S EQUATION
Authors: Salih Othman Mahdi , AL-Jawary Majeed 
Published: January 2021

In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (HPM), or any assumptions to deal with the nonlinear term. The obtained solutions are in recursive sequence forms which can be used to achieve the closed or approximate form of the solutions. Also, the fixed point theorem was presented to assess the convergence of the proposed methods. Several examples of 1D, 2D and 3D problems are solved either analytically or numerically, where the efficiency of the numerical solution has been verified by evaluating the absolute error and the maximum error remainder to show the accuracy and efficiency of the proposed methods. The results reveal that the proposed iterative methods are effective, reliable, time saver and applicable for solving the problems and can be proposed to solve other nonlinear problems. All the iterative process in this work implemented in MATHEMATICA®12.
ABSTRAK: Kajian ini berkenaan tiga kaedah berulang boleh percaya diberikan dan dilaksanakan bagi menyelesaikan 1D, 2D dan 3D persamaan Fisher. Kaedah Daftardar-Jafari (DJM), kaedah Temimi-Ansari (TAM) dan kaedah pengecutan Banach (BCM) digunakan bagi mendapatkan penyelesaian numerik dan tepat bagi persamaan Fisher. Kaedah berulang boleh percaya di kategorikan dengan pelbagai faedah, seperti bebas daripada terbitan, mengatasi masalah-masalah yang timbul apabila sempadan polinomial bagi mengurus kata tak linear dalam kaedah penguraian Adomian (ADM), tidak memerlukan kiraan pekali Lagrange sebagai kaedah berulang Variasi (VIM) dan tidak perlu bagi membuat homotopi sebagaimana dalam kaedah gangguan Homotopi (HPM), atau mana-mana anggapan bagi mengurus kata tak linear. Penyelesaian yang didapati dalam bentuk urutan berulang di mana ianya boleh digunakan bagi mencapai penyelesaian tepat atau hampiran. Juga, teorem titik tetap dibentangkan bagi menaksir kaedah bentuk hampiran. Pelbagai contoh seperti masalah 1D, 2D dan 3D diselesaikan samada secara analitik atau numerik, di mana kecekapan penyelesaian numerik telah ditentu sahkan dengan menilai ralat mutlak dan baki ralat maksimum (MER) bagi menentukan ketepatan dan kecekapan kaedah yang dicadangkan. Dapatan kajian menunjukkan kaedah berulang yang dicadangkan adalah berkesan, boleh percaya, jimat masa dan boleh guna bagi menyelesaikan masalah dan boleh dicadangkan menyelesaikan masalah tak linear lain. Semua proses berulang dalam kerja ini menggunakan MATHEMATICA®12.