SOLVING SYSTEM OF LINEAR.EQUATIONS USING THE CONJUGATE GRADIENT METHOD

SOLOMON, WOLDU

dc.contributor.author	SOLOMON, WOLDU
dc.date.accessioned	2017-08-29T05:20:41Z
dc.date.available	2017-08-29T05:20:41Z
dc.date.issued	2017-08-29
dc.identifier.uri	http://hdl.handle.net/123456789/7857
dc.description	A Dissertation Submitted in partial fulfillment of the requirements for the Degree of Master of Science in Mathematics	en_US
dc.description.abstract	The Conjugate Gradient Method is the most important iterative method for solving symmetric and positive definite systems of linear equations. In this report the conjugate direction that drives the iteration towards the solution and the derivation of the formula of the conjugate gradient method is introduced and explained. Relatively, preconditioning of this method for those ill-conditioned systems of equations will be discussed. And also the convergence of conjugate gradient will be compared with some other iterative methods like Gauss Seidel, Jacobi, and SOR. Finally implementation of conjugate gradient method for any normal system of linear equations will be discussed.	en_US
dc.subject	Mathematics	en_US
dc.title	SOLVING SYSTEM OF LINEAR.EQUATIONS USING THE CONJUGATE GRADIENT METHOD	en_US
dc.type	Thesis	en_US