BDU IR

ITERATIVE METHODS FOR SPARSE LINEAR EQUATIONS

Show simple item record

dc.contributor.author YIRGU, DEMEKE
dc.date.accessioned 2017-08-03T10:05:09Z
dc.date.available 2017-08-03T10:05:09Z
dc.date.issued 2017-08-03
dc.identifier.uri http://hdl.handle.net/123456789/7557
dc.description A Dissertation submitted in partial fulfillment of the require - ments for the Degree of Master of Science in "MATHEMATICS" en_US
dc.description.abstract n this Dissertation, iterative methods for sparse linear equations are prese nted. The problem considered here is of the form: Ax = b, where A is nxn real non singular matrix and x, b E Iffi.n. To solve this Jacobi, Gauss Seidel, and Conjugate Gradient Method as an iterative methods are used. Engineers',Accountants' ... in applications require solutions of large sparse linear systems (n = thousands to millions or more). This Dissertation is used to solve system with storage proportional number of nonzero elements. en_US
dc.subject Mathematics en_US
dc.title ITERATIVE METHODS FOR SPARSE LINEAR EQUATIONS en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record