Comparison of TAGE and SOR Methods for Variable Mesh Arithmetic Average Discretization for Non-linear Two Point Boundary Value Problems with Mixed Boundary Conditions
We discuss the comparison of two parameter alternating group explicit (TAGE) and successive over relaxation (SOR) iteration methods for an efficient third order variable mesh arithmetic average discretization for two point boundary value problems with mixed boundary conditions. We also discuss the application of Newton-TAGE algorithm for the non-linear system whose Jacobian is tri-diagonal. In all cases, we use only three grid points on a non-uniform mesh. The error analysis of the TAGE method is briefly discussed. The proposed TAGE and Newton-TAGE iteration methods are explicit in nature and coupled compactly, hence they are suitable for use on parallel computers. The effect of the proposed algorithms on non-uniform mesh is demonstrated by solving two test problems.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.