Recycling Bi-Lanczos Algorithms: BiCG, CGS, and BiCGSTAB

dc.contributor.authorAhuja, Kapilen
dc.contributor.committeechairde Sturler, Ericen
dc.contributor.committeememberGugercin, Serkanen
dc.contributor.committeememberBorggaard, Jeffrey T.en
dc.contributor.committeememberBeattie, Christopher A.en
dc.contributor.departmentMathematicsen
dc.date.accessioned2014-03-14T20:44:11Zen
dc.date.adate2009-09-21en
dc.date.available2014-03-14T20:44:11Zen
dc.date.issued2009-08-13en
dc.date.rdate2009-09-21en
dc.date.sdate2009-08-25en
dc.description.abstractEngineering problems frequently require solving a sequence of dual linear systems. This paper introduces recycling BiCG, that recycles the Krylov subspace from one pair of linear systems to the next pair. Augmented bi-Lanczos algorithm and modified two-term recurrence are developed for using the recycle space. Recycle space is built from the approximate invariant subspace corresponding to eigenvalues close to the origin. Recycling approach is extended to the CGS and the BiCGSTAB algorithms. Experiments on a convection-diffusion problem give promising results.en
dc.description.degreeMaster of Scienceen
dc.identifier.otheretd-08252009-161256en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-08252009-161256/en
dc.identifier.urihttp://hdl.handle.net/10919/34765en
dc.publisherVirginia Techen
dc.relation.haspartAhuja_K_T_2009.pdfen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectKrylov subspace recyclingen
dc.subjectPetrov-Galerkin formulationen
dc.subjectbi-Lanczos methoden
dc.titleRecycling Bi-Lanczos Algorithms: BiCG, CGS, and BiCGSTABen
dc.typeThesisen
thesis.degree.disciplineMathematicsen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Ahuja_K_T_2009.pdf
Size:
363.21 KB
Format:
Adobe Portable Document Format

Collections