Edinburgh Research Explorer

Iterative refinement techniques for solving block linear systems of equations

Research output: Contribution to journalArticle

Related Edinburgh Organisations

Open Access permissions

Open

Documents

Original languageEnglish
Pages (from-to)220-229
Number of pages10
JournalApplied Numerical Mathematics
Volume67
DOIs
Publication statusPublished - May 2013

Abstract

We study the numerical properties of classical iterative refinement (IR) and k-fold iterative refinement (RIR) for computing the solution of a nonsingular linear system of equations Ax = b with A partitioned into blocks using floating point arithmetic. We assume that all computations are performed in the working (fixed) precision. We prove that the numerical quality of RIR is superior to that of IR.

Download statistics

No data available

ID: 528809