跳到主要内容

東京大学 情報理工学系研究科 コンピュータ科学専攻 2019年2月実施 問題4

Author

kainoj, shuncleopasfang

Description

Consider an nn dimensional linear system Ax=bAx = b, where AA, xx, and bb are an nn dimensional real coefficient matrix, an nn dimensional real vector of unknowns, and an nn dimensional real given vector, respectively. Assume that AA is not singular and b0b \neq 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 AA.

(2) Suppose that x~0\widetilde{x} \neq 0 is an approximate solution of the linear system. Using the residual r=bAx~r = b - A\widetilde{x} and x~\widetilde{x}, find a rank 11 matrix EE which satisfies (A+E)x~=b(A+E)\widetilde{x} = b exactly.

(3) Consider the effect of inaccuracy δA\delta A of AA. Namely, the linear system becomes

(A+δA)(x+δx)=b,(A + \delta A)(x + \delta x) = b,

where δx\delta x is the effect on the solution vector xx. Assume that A+δAA + \delta A is not singular. In addition, δA\delta A has nothing to do with EE in the question (2). By evaluating δx\delta x, prove that the relative inaccuracy of xx is related to that of AA by the inequality:

δxx+δxcond2(A)δAA,\frac{\|\delta x\|}{\| x+\delta x \|} \leq \text{cond}_2(A) \frac{\|\delta A \|}{\| A \|},

where cond2(A)\text{cond}_2(A) is the condition number of AA.

(4) Prove that for any nn dimensional real singular matrix BB, the relation

AB1A1\| A-B \| \geq \frac{1}{\| A^{-1} \|}

is always satisfied. You may use the following fact: when an nn dimensional real matrix CC is singular, there is a non-zero real vector yy such that Cy=0Cy = 0.

Kai

(1)

Condition number κ(A)\kappa(A) of AA is:

κ(A)=AA1 \kappa(A) = \|A\| \: \|A^{-1}\|

where \|\cdot \| denotes a norm of a matrix:

A=maxxRNAxx=maxx:x=1Ax \|A\| = \max_{x\in \mathbb{R^N}} \frac{\|Ax\|}{\|x\|} = \max_{x: \|x\|=1} \|Ax\|

(2)

We know Ax=bAx = b and let r=bAx^r = b- A\hat{x}:

(A+E)x^=bAx^+Ex^=bEx^=bAx^Ex^=r\begin{aligned} (A+E)\hat{x} &= b \\ A\hat{x} + E\hat{x} &= b \\ E\hat{x} &= b - A\hat{x} \\ E\hat{x} &= r \end{aligned}

The matrix E=rx^x^x^E = \frac{\mathbf{r} \hat{x}^\top}{\hat{x}^\top \hat{x}} can be formed by taking the outer product of the vector r\mathbf{r} and the transpose of the vector x^\hat{x} (x^\hat{x}^\top), and then dividing each element of the outer product by the scalar x^x^\hat{x}^\top \hat{x}. Here, x^x^\hat{x}^\top \hat{x} is the inner product of the vector x^\hat{x} with itself, representing the squared norm (sum of squares) of x^\hat{x}.

The matrix E=rx^x^x^E = \frac{\mathbf{r} \hat{x}^\top}{\hat{x}^\top \hat{x}} is a rank-1 matrix, and this can be explained simply as follows:

  1. Outer product property: The matrix rx^\mathbf{r} \hat{x}^\top is the outer product of two vectors, resulting in a matrix. An outer product matrix inherently has a rank of 1 because it can be expressed as the linear combination of the two generating vectors (r\mathbf{r} and x^\hat{x}).

  2. Scalar division: Dividing each element of the matrix by the scalar x^x^\hat{x}^\top \hat{x} (a single number) does not change the rank of the matrix, as scalar multiplication or division only scales the elements without affecting the linear dependencies.

Therefore, EE is a rank-1 matrix because it is derived from the outer product of two vectors.

(3)

(A+δA)(x+δx)=bAx+A(δx)+δA(x+δx)=b\begin{aligned} (A+ \delta A)(x+ \delta x) = b \\ Ax + A(\delta x) + \delta A(x+ \delta x) = b \end{aligned}

Substituting Ax=bAx = b:

A(δx)+δA(x+δx)=0A(δx)=δA(x+δx)δx=A1(δA)(x+δx)\begin{aligned} A(\delta x) + \delta A(x+ \delta x) &= 0 \\ - A(\delta x) &= \delta A(x+ \delta x) \\ -\delta x &= A^{-1} (\delta A)(x+ \delta x) \end{aligned}

because matrix AA is not singular, so inverse A1A^{-1} exist. Now, take the norm both sides. We are assuming that A+σAA + \sigma A is not singular, so it has inverse and thus a norm:

δx=A1[δA(x+δx)]A1δA(x+δx)A1δAx+δx\begin{aligned} \|\delta x \| &= \| A^{-1} \: [\delta A(x+ \delta x) ]\| \\ &\leq \| A^{-1} \| \: \| \delta A(x+ \delta x) \| \\ &\leq \| A^{-1} \| \: \| \delta A \| \: \| x + \delta x \| \end{aligned}
δxx+δxA1δA=A1A1A1δA=κ(A)δAA\begin{aligned} \frac{\|\delta x \|}{ \| x + \delta x \| } &\leq \| A^{-1} \| \: \| \delta A \| \\ &= \| A^{-1} \| \: \frac{\| A^{1} \| }{\| A^{1} \|} \| \delta A \| \\ &= \kappa(A) \frac{\|\delta A\|}{\|A\|} \end{aligned}

(4)

When an nn dimensional real matrix C is singular, there is a non-zero, real vector yy such that Cy=0Cy = 0. In particular, we can choose a unit vector y=yyy' = \frac{y}{\|y\|}.

Let xnullspace(B)x \in nullspace(B) be a unit vector i.e. Bx=0Bx = 0 and x=1\|x\| = 1.

AB=ABx(AB)x=AxBx=Ax\begin{aligned} \|A-B\| &= \|A-B\| \: \|x\| \\ &\geq \| (A-B)x \| \\ &= \|Ax - Bx\| \\ &= \|Ax\| \end{aligned}

On the other hand:

1=x=A1(Ax)A1AxAx1A1\begin{aligned} 1 = \|x\| = \| A^{-1} \:(Ax) \| &\leq \| A^{-1} \| \: \|Ax\| \\ \|Ax\| &\geq \frac{1}{\|A^{-1}\|} \end{aligned}

More on condition numbers: https://blogs.mathworks.com/cleve/2017/07/17/what-is-the-condition-number-of-a-matrix/.