Chapter 2: Q23Q (page 93)
Suppose \(CA = {I_n}\)(the \(n \times n\) identity matrix). Show that the equation \(Ax = 0\) has only the trivial solution. Explain why Acannot have more columns than rows.
Amust have at least as many rows as columns because each pivot is in a different row.
Over 30 million students worldwide already upgrade their learning with Vaia!
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(A = \left( {\begin{aligned}{*{20}{c}}{\bf{2}}&{ - {\bf{3}}}\\{ - {\bf{4}}}&{\bf{6}}\end{aligned}} \right)\) and \(B = \left( {\begin{aligned}{*{20}{c}}{\bf{8}}&{\bf{4}}\\{\bf{5}}&{\bf{5}}\end{aligned}} \right)\) and \(C = \left( {\begin{aligned}{*{20}{c}}{\bf{5}}&{ - {\bf{2}}}\\{\bf{3}}&{\bf{1}}\end{aligned}} \right)\). Verfiy that \(AB = AC\) and yet \(B \ne C\).
[M] For block operations, it may be necessary to access or enter submatrices of a large matrix. Describe the functions or commands of your matrix program that accomplish the following tasks. Suppose A is a \(20 \times 30\) matrix.
[Note: It may not be necessary to specify the zero blocks in B.]
Describe in words what happens when you compute \({A^{\bf{5}}}\), \({A^{{\bf{10}}}}\), \({A^{{\bf{20}}}}\), and \({A^{{\bf{30}}}}\) for \(A = \left( {\begin{aligned}{*{20}{c}}{1/6}&{1/2}&{1/3}\\{1/2}&{1/4}&{1/4}\\{1/3}&{1/4}&{5/12}\end{aligned}} \right)\).
When a deep space probe launched, corrections may be necessary to place the probe on a precisely calculated trajectory. Radio elementary provides a stream of vectors, \({{\bf{x}}_{\bf{1}}},....,{{\bf{x}}_k}\), giving information at different times about how the probe’s position compares with its planned trajectory. Let \({X_k}\) be the matrix \(\left[ {{x_{\bf{1}}}.....{x_k}} \right]\). The matrix \({G_k} = {X_k}X_k^T\) is computed as the radar data are analyzed. When \({x_{k + {\bf{1}}}}\) arrives, a new \({G_{k + {\bf{1}}}}\) must be computed. Since the data vector arrive at high speed, the computational burden could be serve. But partitioned matrix multiplication helps tremendously. Compute the column-row expansions of \({G_k}\) and \({G_{k + {\bf{1}}}}\) and describe what must be computed in order to update \({G_k}\) to \({G_{k + {\bf{1}}}}\).
Explain why the columns of an \(n \times n\) matrix Aspan \({\mathbb{R}^{\bf{n}}}\) when
Ais invertible. (Hint:Review Theorem 4 in Section 1.4.)
What do you think about this solution?
We value your feedback to improve our textbook solutions.
