Section 3.8

Inverses of Sums and Sensitivity

[8/100%]
Show
LaTeX
Problem 3.8.1

Recall the Sherman–Morrison formula: if An×n\mathbf{A}_{n \times n} is nonsingular and c→\overrightarrow {c}, d→\overrightarrow {d} are n×1n \times 1 columns such that 1+d→TA−1c→≠01+\overrightarrow {d}^{T}\mathbf{A}^{-1}\overrightarrow {c} \neq 0, then the sum A+c→d→T\mathbf{A}+\overrightarrow {c}\overrightarrow {d}^{T} is nonsingular, and

(A+c→d→T)−1=A−1−A−1c→d→TA−11+d→TA−1c→. (\mathbf{A}+\overrightarrow {c}\overrightarrow {d}^{T})^{-1} = \mathbf{A}^{-1} - \frac{\mathbf{A}^{-1}\overrightarrow {c}\overrightarrow {d}^{T}\mathbf{A}^{-1}}{1+\overrightarrow {d}^{T}\mathbf{A}^{-1}\overrightarrow {c}}.

Suppose you are given that

A=[20−1−111−101]andA−1=[10101−1102]. \mathbf{A} = \begin{bmatrix} 2 & 0 & -1 \\ -1 & 1 & 1 \\ -1 & 0 & 1 \end{bmatrix} \qquad \text{and} \qquad \mathbf{A}^{-1} = \begin{bmatrix} 1 & 0 & 1 \\ 0 & 1 & -1 \\ 1 & 0 & 2 \end{bmatrix}.
?
(a)

Use the Sherman--Morrison formula to determine the inverse of the matrix B\mathbf{B} that is obtained by changing the (3,2)(3,2)-entry in A\mathbf{A} from 00 to 22.

(b)

Let C\mathbf{C} be the matrix that agrees with A\mathbf{A} except that c32=2c_{32}=2 and c33=2c_{33}=2. Use the Sherman--Morrison formula to find C−1\mathbf{C}^{-1}.

Problem 3.8.2

Suppose A\mathbf{A} and B\mathbf{B} are nonsingular matrices in which B\mathbf{B} is obtained from A\mathbf{A} by replacing A∗j\mathbf{A}_{*j} with another column b→\overrightarrow {b}. Use the Sherman--Morrison formula to derive the fact that

B−1=A−1−(A−1b→−e→j)[A−1]j∗[A−1]j∗b→. \mathbf{B}^{-1} = \mathbf{A}^{-1} - \frac{(\mathbf{A}^{-1}\overrightarrow {b}-\overrightarrow {e}_{j})[\mathbf{A}^{-1}]_{j*}}{[\mathbf{A}^{-1}]_{j*}\overrightarrow {b}}.
?
Problem 3.8.3

Suppose the coefficient matrix of a nonsingular system Ax→=b→\mathbf{A}\overrightarrow {x} = \overrightarrow {b} is updated to produce another nonsingular system (A+c→d→T)z→=b→(\mathbf{A}+\overrightarrow {c}\overrightarrow {d}^{T})\overrightarrow {z} = \overrightarrow {b}, where b→,c→,d→∈Rn×1\overrightarrow {b}, \overrightarrow {c}, \overrightarrow {d} \in \mathbb {R}^{n \times 1}, and let y→\overrightarrow {y} be the solution of Ay→=c→\mathbf{A}\overrightarrow {y} = \overrightarrow {c}. Show that

z→=x→−y→d→Tx→1+d→Ty→. \overrightarrow {z} = \overrightarrow {x} - \frac{\overrightarrow {y}\overrightarrow {d}^{T}\overrightarrow {x}}{1+\overrightarrow {d}^{T}\overrightarrow {y}}.
?
Problem 3.8.4
?
(a)

Use the Sherman--Morrison formula to prove that if A\mathbf{A} is nonsingular, then A+αe→ie→jT\mathbf{A}+\alpha \overrightarrow {e}_{i}\overrightarrow {e}_{j}^{T} is nonsingular for a sufficiently small α\alpha.

(b)

Use part (a) to prove that I+E\mathbf{I}+\mathbf{E} is nonsingular when all ϵij\epsilon_{ij}'s are sufficiently small in magnitude. This is an alternative to using the Neumann series argument.

Problem 3.8.5

For given matrices A\mathbf{A} and B\mathbf{B}, where A\mathbf{A} is nonsingular, explain why A+ϵB\mathbf{A}+\epsilon \mathbf{B} is also nonsingular when the real number ϵ\epsilon is constrained to a sufficiently small interval about the origin. In other words, prove that small perturbations of nonsingular matrices are also nonsingular.

?
Problem 3.8.6

Derive the Sherman--Morrison--Woodbury formula: if An×n\mathbf{A}_{n \times n} is nonsingular and C\mathbf{C}, D\mathbf{D} are n×kn \times k such that (I+DTA−1C)−1(\mathbf{I}+\mathbf{D}^{T}\mathbf{A}^{-1}\mathbf{C})^{-1} exists, then

(A+CDT)−1=A−1−A−1C(I+DTA−1C)−1DTA−1. (\mathbf{A}+\mathbf{C}\mathbf{D}^{T})^{-1} = \mathbf{A}^{-1} - \mathbf{A}^{-1}\mathbf{C}(\mathbf{I}+\mathbf{D}^{T}\mathbf{A}^{-1}\mathbf{C})^{-1}\mathbf{D}^{T}\mathbf{A}^{-1}.
?
Remark.
?

Recall exercise 3.7.11 (the Schur-complement block-inverse formulas), and consider the product (IC0I)(ACDT−I)(I0DTI)\begin{pmatrix} \mathbf{I} & \mathbf{C} \\ \mathbf{0} & \mathbf{I} \end{pmatrix}\begin{pmatrix} \mathbf{A} & \mathbf{C} \\ \mathbf{D}^{T} & -\mathbf{I} \end{pmatrix}\begin{pmatrix} \mathbf{I} & \mathbf{0} \\ \mathbf{D}^{T} & \mathbf{I} \end{pmatrix}.

Problem 3.8.7

Recall the norm ∥A∥=max⁡i∑j∣aij∣\left\| \mathbf{A}\right\| = \max_{i}\sum_{j}\left|a_{ij}\right| (the maximum absolute row sum), and the associated condition number κ(A)=∥A∥∥A−1∥\kappa (\mathbf{A}) = \left\| \mathbf{A}\right\| \left\| \mathbf{A}^{-1}\right\| of a nonsingular matrix A\mathbf{A}, which gauges how ill-conditioned A\mathbf{A} is (larger κ\kappa means more ill-conditioned).

Using the norm above, rank the following matrices according to their degree of ill-conditioning:

A=[1000−1000100−100−100−100300],B=[18−1−9−711111718],C=[122−4201−45−45−9481]. \mathbf{A} = \begin{bmatrix} 100 & 0 & -100 \\ 0 & 100 & -100 \\ -100 & -100 & 300 \end{bmatrix}, \qquad \mathbf{B} = \begin{bmatrix} 1 & 8 & -1 \\ -9 & -71 & 11 \\ 1 & 17 & 18 \end{bmatrix}, \qquad \mathbf{C} = \begin{bmatrix} 1 & 22 & -42 \\ 0 & 1 & -45 \\ -45 & -948 & 1 \end{bmatrix}.
?
Problem 3.8.8

Suppose that the entries in A(t)\mathbf{A}(t), x→(t)\overrightarrow {x}(t), and b→(t)\overrightarrow {b}(t) are differentiable functions of a real variable tt such that A(t)x→(t)=b→(t)\mathbf{A}(t)\overrightarrow {x}(t) = \overrightarrow {b}(t).

?
(a)

Assuming that A(t)−1\mathbf{A}(t)^{-1} exists, explain why

dA(t)−1dt=−A(t)−1A′(t)A(t)−1. \frac{d\mathbf{A}(t)^{-1}}{dt} = -\mathbf{A}(t)^{-1}\mathbf{A}'(t)\mathbf{A}(t)^{-1}.
(b)

Derive the equation

x→′(t)=A(t)−1b→′(t)−A(t)−1A′(t)x→(t). \overrightarrow {x}'(t) = \mathbf{A}(t)^{-1}\overrightarrow {b}'(t) - \mathbf{A}(t)^{-1}\mathbf{A}'(t)\overrightarrow {x}(t).

This shows that A−1\mathbf{A}^{-1} magnifies both the change in A\mathbf{A} and the change in b→\overrightarrow {b}, and thus it confirms the observation derived from (3.8.8) saying that the sensitivity of a nonsingular system to small perturbations is directly related to the magnitude of the entries in A−1\mathbf{A}^{-1}.