Backward error and condition number of linear systems of equations
Contents
Backward error and condition number of linear systems of equations#
We consider the linear system of equations \(Ay = b\) with \(A\in\mathbb{R}^{n\times n}\) and \(b\in\mathbb{R}^n\). We assume that \(A\) is nonsingular.
Backward error#
For this linear system of equations the definition of the backward error is given as
The backward error can be explicitly computed. The result goes back to Rigal and Gaches (1961). We do not show the full derivation here.
The beauty of this result is that it only has computable quantities. The expression \(r := b - A\tilde{y}\) is called the residual of the linear system. It measures how close the left- and right-hand side are. Residual expressions are typical in backward error results.
Condition Number#
To derive a precise expression for the condition number of the linear system we need a little helper Lemma
Lemma#
Let \(\|\cdot\|\) be a submultiplicative matrix norm and \(X\in\mathbb{R}^{n\times n}\). Then \(\|X\| < 1\) implies that \(I - X\) is invertible, \((I-X)^{-1} = \sum_{i=0}^{\infty}X^i\) and \(\|(I-X)^{-1}\| \leq \frac{1}{1-\|X\|}\).
Proof
We consider the partial sums
By norm equivalence and submultiplicativity we have for each matrix element \((S_n)_{\ell, t}\) that
for some \(C> 0\).
Hence, every component of \(S_n\) is absolutely convergent and therefore the sum \(S_n\) converges with \(X^{n}\rightarrow 0\) as \(n\rightarrow\infty\).
For the inverse we have
and by taking limits, with \(S := \sum_{i=0}^{\infty}X^{i}\), we have that
It follows that \((I-X)\) is nonsingular with \((I-X)^{-1} = S\). The estimate
follows from
We can now estimate the condition number of the linear system of equations \(Ay=b\). Let \(\Delta A\) and \(\Delta b\) be perturbations in \(A\) and \(b\), and let \(\Delta y \) satisfy
Collecting terms and using that \(Ay = b\) results in
Assuming that \(\Delta A\) is sufficiently small so that \(\|A^{-1}\Delta A\| < 1\) we can apply the previous lemma and obtain
where in the last equation we have used that \(\|b\| = \|Ay\| \leq \|A\|\cdot\|y\|\).
By ignoring higher order terms in \(\|\Delta A\|\) we obtain
The left-hand side is the relative output perturbation. The right-hand side is the product of \(\|A^{-1}\|\cdot \|A\|\) and the relative input perturbation \(\left(\frac{\|\Delta A\|}{\|A\|} + \frac{\|\Delta b\|}{\|b\|}\right)\). Hence, we have \(\kappa_{rel}(A) = \|A^{-1}\|\|A\|\) being the condition number of the linear system. This argument is not completely precise since one still needs to show that there actually exists a perturbation so that the left-hand side and right-hand side have equality. But we leave this technical detail here out.
Note: Since we also allow perturbations in \(b\) we should formally write \(\kappa_{rel}(A, b)\) as condition number. But we see that the condition number only depends on \(A\) and not on \(b\). Therefore, one simply writes \(\kappa_{rel}(A)\).
Going back to our earlier equation we hence have the precise estimate that
which relates the relative forward error and the relative backward error in the linear system.
The condition number \(\kappa_{rel}(A)\) has an important interpretation. It measures how far away from being singular a linear system is. More precisely,
We are not going to prove this result here. Later in the term we will derive tools that make the relationship between condition number and distance to singularity immediately obvious.