Newton explicit decoupled group solution for two-dimensional nonlinear porous medium equation problems

This paper presents a Newton Explicit Decoupled Group method based on a half-sweep implicit finite difference scheme as an efficient solution method for two-dimensional nonlinear porous medium equation problems. The mathematical problem is subjected to the initial and Dirichlet’s boundary conditions...

Full description

Bibliographic Details
Main Authors: Chew, Jackel Vui Lung, Jumat Sulaiman, Andang Sunarto, Fatihah Anas Muhiddin
Format: Conference or Workshop Item
Language:English
English
Published: Springer 2022
Subjects:
Online Access:https://eprints.ums.edu.my/id/eprint/33408/3/Newton%20explicit%20decoupled%20group%20solution%20for%20two-dimensional%20nonlinear%20porous%20medium%20equation%20problems.pdf
https://eprints.ums.edu.my/id/eprint/33408/1/Newton%20explicit%20decoupled%20group%20solution%20for%20two-dimensional%20nonlinear%20porous%20medium%20equation%20problems%20_ABSTRACT.pdf
Description
Summary:This paper presents a Newton Explicit Decoupled Group method based on a half-sweep implicit finite difference scheme as an efficient solution method for two-dimensional nonlinear porous medium equation problems. The mathematical problem is subjected to the initial and Dirichlet’s boundary conditions. This paper used the half-sweep technique to derive the implicit finite difference scheme to discretize the considered differential equation. The stability of the two-dimensional half-sweep finite difference approximation is analyzed. Newton method is applied to form the system of the linearized equation before the solution is approximated using the proposed Explicit Decoupled Group method. The proposed method is tested on several problems. The obtained numerical result is compared with the numerical result from the existing method from the same family of Newton-Explicit Group and the classical Newton-Gauss–Seidel method. The efficiency of the proposed method is determined based on the number of iterations and computation time. Computational complexity analysis is also reported.