Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/882
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAzizu, S.-
dc.date.accessioned2016-11-02T15:11:51Z-
dc.date.available2016-11-02T15:11:51Z-
dc.date.issued2015-
dc.identifier.urihttp://hdl.handle.net/123456789/882-
dc.descriptionMASTER OF SCIENCE IN MATHEMATICSen_US
dc.description.abstractAn assessment of acceleration schemes in the solution of systems of linear equations has been studied. The iterative methods:Jacobi, Gauss-Seidel and SOR methods were incorporated into the acceleration scheme (Chebyshev extrapolation, Residual smoothing, Accelerated gradient and Richardson Extrapolation)to speed up their convergence. The Conjugate gradient methods of GMRES,BICGSTAB and QMR were also assessed. The research focused on Banded systems, Tridiagonal systems and Dense Symmetric positive definite systems of linear equations for numerical experiments. The experiments were based on the following performance criteria: convergence, number of iterations, speed of convergence and relative residual of each method. Matlab version 7.0.1 was used for the computation of the resulting algorithms. Assessment of the numerical results showed that the accelerated schemes improved the performance of Jacobi, Gauss-Seidel and SOR methods. The Chebyshev and Richardson acceleration methods converged faster than the conjugate gradient methods of GMRES, MINRES, QMR and BICGSTAB in general.en_US
dc.language.isoenen_US
dc.titleASSESSMENT OF SOME ACCELERATION SCHEMES IN THE SOLUTION OF SYSTEMS OF LINEAR EQUATIONSen_US
dc.typeThesisen_US
Appears in Collections:Faculty of Mathematical Sciences

Files in This Item:
File Description SizeFormat 
ASSESSMENT OF SOME ACCELERATION SCHEMES IN THE SOLUTION OF SYSTEMS OF LINEAR EQUATIONS.pdf1.34 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.