Consider an n dimensional linear system Ax=b, where A, x, and b are an n dimensional real coefficient matrix, an n dimensional real vector of unknowns, and an n dimensional real given vector, respectively.
Assume that A is not singular and b=0.
The vector norm and the matrix norm used in this problem are the 2-norm and the matrix norm corresponding to the 2-norm, respectively.
Answer the following questions.
(1) Answer the definition of the condition number of A.
(2) Suppose that x=0 is an approximate solution of the linear system.
Using the residual r=b−Ax and x, find a rank 1 matrix E which satisfies (A+E)x=b exactly.
(3) Consider the effect of inaccuracy δA of A. Namely, the linear system becomes
(A+δA)(x+δx)=b,
where δx is the effect on the solution vector x.
Assume that A+δA is not singular.
In addition, δA has nothing to do with E in the question (2).
By evaluating δx, prove that the relative inaccuracy of x is related to that of A by the inequality:
∥x+δx∥∥δx∥≤cond2(A)∥A∥∥δA∥,
where cond2(A) is the condition number of A.
(4) Prove that for any n dimensional real singular matrix B, the relation
∥A−B∥≥∥A−1∥1
is always satisfied. You may use the following fact: when an n dimensional real matrix C is singular, there is a non-zero real vector y such that Cy=0.
The numerator rx^T is the outer product of two vectors; every column is a scalar multiple of r. The denominator x^Tx^=∥x^∥22 is a nonzero scalar, so dividing by it does not change the rank. Moreover,
Ex^=x^Tx^rx^Tx^=r.
Thus E has rank 1 when r=0 and satisfies (A+E)x^=b. If r=0 and n≥2, one may instead take E=uvT with u,v=0 and vTx^=0. For n=1 and r=0, no rank-1 solution exists; E=0 is the only choice.
When an n dimensional real matrix C is singular, there is a non-zero, real vector y such that Cy=0.
In particular, we can choose a unit vector y′=∥y∥y.
Let x∈nullspace(B) be a unit vector i.e. Bx=0 and ∥x∥=1.