MEGSOR iterative method for the triangle element solution of 2D Poisson equations | Zendy

Jumat Sulaiman | Zendy; Mohammad Khatim Hasan | Zendy; Mohamed Othman | Zendy; Samsul Ariffin Abdul Karim | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

MEGSOR iterative method for the triangle element solution of 2D Poisson equations

Author(s) -

Jumat Sulaiman,

Mohammad Khatim Hasan,

Mohamed Othman,

Samsul Ariffin Abdul Karim

Publication year - 2010

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2010.04.041

Subject(s) - iterative method , computer science , block (permutation group theory) , algorithm , poisson distribution , point (geometry) , mathematical optimization , successive over relaxation , mathematics , local convergence , statistics , geometry

In previous studies of finite difference approaches, the 4 Point-Modified Explicit Group (MEG) iterative method with or without a weighted parameter, ω, has been pointed out to be much faster as compared to the existing four point block iterative methods. The main characteristic of the MEG iterative method is to reduce computational complexity compared to the full-sweep or half-sweep methods. Due to the effectiveness of this method, the primary goal of this paper is to demonstrate the use of the 4 Point- Modified Explicit Group (MEG) iterative method together with a weighted parameter, namely 4 Point-MEGSOR. The effectiveness of this method has been shown via results of numerical experiments, which are recorded and analyzed, show that that the 4 Point-MEGSOR iterative scheme is superior as compared with the existing four point block schemes

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research