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 114
- Downloads 0
PROPERTIES OF FUZZY DITANCE ON FUZZY SET
In this paper we introduce the definition of fuzzy distance space on fuzzy set then we study and discuss several properties of this space after some illustrative examples are given . Furthermore we introduce the de...
REGIONAL GRADIENT STRATEGIC SENSORS CHARACTERIZATIONS
In the present paper, the characterizations of regional gradient strategic sensors notions have been given for different cases of regional gradient observability. The results obtained are applied to two dimensional linea...
Tripled coincidence points for weakly compatible and its variants in fuzzy metric spaces
In this paper, we will introduce the concept of weakly commuting and variants of weakly commuting mappings (R-weakly commuting, R-weakly commuting of type (Af), type (Ag), type (P) mappings) for triplet in fuzzy metric s...
Transient behavior of / /1 [ ] M G X Queueing Model With State Dependent Arrival, Balking and Bernoulli Vacation
This paper analyzes single server queueing system wherein the arrival units are in batches following compound Poisson process with varying arrival rates for different states. The arrival rates differ for different s...
A way to compute a greatest common divisor in the Galois field (GF (2^n ))
This paper presents how the steps that used to determine a multiplicative inverse by method based on the Euclidean algorithm, can be used to find a greatest common divisor for polynomials in the Galois field (2^n ).