Show simple item record

dc.contributor.authorGraves-Morris, Peter R.*
dc.date.accessioned2009-10-21T10:52:46Z
dc.date.available2009-10-21T10:52:46Z
dc.date.issued2002
dc.identifier.citationGraves-Morris, P.R. (2002). The Breakdowns of BiCGStab. Numerical Algorithms. Vol. 29, No. 1-3, pp. 97-105.en
dc.identifier.urihttp://hdl.handle.net/10454/3726
dc.descriptionNoen
dc.description.abstractThe effects of the three principal possible exact breakdowns which may occur using BiCGStab are discussed. BiCGStab is used to solve large sparse linear systems of equations, such as arise from the discretisation of PDEs. These PDEs often involve a parameter, say . We investigate here how the numerical error grows as breakdown is approached by letting tend to a critical value, say c, at which the breakdown is numerically exact. We found empirically in our examples that loss of numerical accuracy due stabilisation breakdown and Lanczos breakdown was discontinuous with respect to variation of around c. By contrast, the loss of numerical accuracy near a critical value c for pivot breakdown is roughly proportional to |¿c|¿1.en
dc.language.isoenen
dc.relation.isreferencedbyhttp://dx.doi.org/10.1023/A:1014864007293en
dc.subjectBiCGStaben
dc.subjectBiCGen
dc.subjectLanczosen
dc.subjectPivot breakdownen
dc.subjectLanczos breakdownen
dc.subjectLTPMen
dc.titleThe Breakdowns of BiCGStab.en
dc.status.refereedYesen
dc.typeArticleen
dc.type.versionNo full-text available in the repositoryen


This item appears in the following Collection(s)

Show simple item record