Investigation of Triangle Element Analysis for the Solutions of 2D Poisson Equations via AOR method
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2015, Vol 11, Issue 2
Abstract
In earlier studies of iterative approaches, the accelerated over relaxation (AOR) method has been pointed out to be much faster as compared to the existing successive over re- laxation (SOR) and Gauss Seidel (GS) methods. Due to the effectiveness of this method, the foremost goal of this paper is to demonstrate the use of the AOR method together with triangle element solutions based on the Galerkin scheme method. The effectiveness of this method has been shown via results of numerical experiments, which are logged and examined. The findings show that the AOR method is superior as compared with the existing SOR and GS methods.
Authors and Affiliations
Mohd Kamalrulzaman
Keywords
Related Articles
- EP ID EP651583
- DOI 10.24297/jam.v11i2.1287
- Views 109
- Downloads 0
Green's Relations in Rings and Completely Simple Rings
In this paper we prove that which of Green's relations $\mathcal{L,R,H}$ and $\mathcal{D}$ in rings preserve the minimality of quasi-ideal. By this it is possible to show the structure of the classes generated by the abo...
HPM for Solving the Time-fractional Coupled Burgers Equations
In this paper, the homotopy perturbation method is implemented to derive the explicit approximate solutions for the time-fractional coupled Burger's equations. The including fractional derivative is in the Caputo sense....
Some common fixed point results of three self-mappings in cone metric spaces
The aim of this paper is to present coincidence point and common fixed point results for three self mappings satisfying generalized contractive conditions. The results presented in this paper generalize and extend...
Solving Some Kinds of Third Order Partial Differential Equations of Degree Four with Three Independent Variables
In this paper, we find a solution for some kinds of nonlinear third order partial differential equations of homogeneous degree with three independent variables .
Geodetic Connected Domination Number of a graph
A pair x, y of vertices in a nontrivial connected graph is said to geodominate a vertex v of G if either v {x,y} or v lies an x - y geodesic of G. A set S of vertices of G is a geodetic set if every vertex of G is...