dc.contributor.advisor |
Moufawad, Sophie |
dc.contributor.author |
Al Hajj, Youmna Abbas |
dc.date.accessioned |
2021-09-12T03:35:55Z |
dc.date.available |
2021-09-12T03:35:55Z |
dc.date.issued |
9/12/2021 |
dc.date.submitted |
9/11/2021 |
dc.identifier.uri |
http://hdl.handle.net/10938/23002 |
dc.description.abstract |
We are interested in solving sparse systems of linear equations Ax=b with Krylov subspace methods. A new approach for reducing communication in Krylov subspace methods was introduced that consists of enlarging the Krylov subspace by a maximum of t vectors per iteration, based on a domain decomposition of the graph of A. We think of the solution as belonging to the enlarged Krylov subspace which is a superset of the Krylov subspace. Several enlarged conjugate gradient versions that converge faster than CG in terms of iterations were introduced, such as MSDO-CG and SRE-CG2 and SRE-CG. In this thesis we introduce a variant of SRE-CG2: flexible SRE-CG2 and test its effectiveness in terms of iterations and time for convergence as compared to SRE-CG2. |
dc.language.iso |
en |
dc.subject |
Linear algebra |
dc.subject |
Iterative methods |
dc.subject |
Krylov subspace methods |
dc.title |
On the Enlarged Krylov Subspace Method: SRE-CG2 |
dc.type |
Thesis |
dc.contributor.department |
Department of Mathematics |
dc.contributor.faculty |
Faculty of Arts and Sciences |
dc.contributor.institution |
American University of Beirut |
dc.contributor.commembers |
Nassif, Nabil |
dc.contributor.commembers |
Sabra, Ahmad |
dc.contributor.commembers |
Mourad, Bassam |
dc.contributor.degree |
MS |
dc.contributor.AUBidnumber |
202021699 |