(M) Let \(A = \left( {\begin{aligned}{*{20}{r}}{ - 6}&3&{ - 27}&{ - 33}&{ - 13}\\6&{ - 5}&{25}&{28}&{14}\\8&{ - 6}&{34}&{38}&{18}\\{12}&{ - 10}&{50}&{41}&{23}\\{14}&{ - 21}&{49}&{29}&{33}\end{aligned}} \right)\). Construct

a matrix \(N\) whose columns form a basis for \({\rm{Nul}}A\), and

construct a matrix \(R\) whose rows form a basis for \({\rm{Row}}A\) (see

Section 4.6 for details). Perform a matrix computation with

\(N\)and \(R\) that illustrates a fact from Theorem 3.

Short Answer

Expert verified

The matrices are \(N = \left( {\begin{aligned}{*{20}{r}}{ - 5}&{0.33}\\{ - 1}&{1.33}\\1&0\\0&{ - 0.33}\\1&1\end{aligned}} \right),R = \left( {\begin{aligned}{*{20}{r}}1&0&5&0&{\frac{{ - 1}}{3}}\\0&1&0&1&{\frac{{ - 4}}{3}}\\0&0&0&1&{\frac{1}{3}}\end{aligned}} \right)\), and the required product is \(R \cdot N = \left( {\begin{aligned}{*{20}{r}}0&0\\0&0\\0&0\\0&0\\0&0\end{aligned}} \right)\) which shows that \(R\) is orthogonal to \(N\).

Step by step solution

01

Basis of a vector space

A linearly independent set that spans the whole space is called the basis of a space. There is more than one basis for a vector space.

02

Construction of the matrices \(R\)and \(N\)

Given that

\(A = \left( {\begin{aligned}{*{20}{r}}{ - 6}&3&{ - 27}&{ - 33}&{ - 13}\\6&{ - 5}&{25}&{28}&{14}\\8&{ - 6}&{34}&{38}&{18}\\{12}&{ - 10}&{50}&{41}&{23}\\{14}&{ - 21}&{49}&{29}&{33}\end{aligned}} \right)\)

Hence, by using MATLAB, construct the required matrix.

Enter the matrix

>> A=(-6 3 -27 -33 -13;6 -5 25 28 14; 8 -6 34 38 18 ; 12 -10 50 41 23 ; 14 -21 49 29 33);

Function to compute the Null basis:

(function N = nulbasis (A)

(R, pivcol) = rref(A, sqrt(eps));

(m, n) = size (A) ;

r = length(pivcol); freecol = l:n;

freecol(pivcol) = ();

N = zeros(n, n-r);

N (freecol, : ) = eye(n-r); N(pivcol, : ) = -R(l:r, freecol);

Compute the Null basis:

>> N = nulbasis(A)

We find that:

\(N = \left( {\begin{aligned}{*{20}{r}}{ - 5}&{0.33}\\{ - 1}&{1.33}\\1&0\\0&{ - 0.33}\\1&1\end{aligned}} \right)\)

Determine the row-reduce echelon form of the given matrix to find \(R\).

>> rref(A)

\(\left( {\begin{aligned}{*{20}{r}}1&0&5&0&{ - 0.33}\\0&1&1&0&{ - 1.33}\\0&0&0&1&{0.33}\\0&0&0&0&0\\0&0&0&0&0\end{aligned}} \right)\)

Thus,

\(R = \left( {\begin{aligned}{*{20}{r}}1&0&5&0&{\frac{{ - 1}}{3}}\\0&1&0&1&{\frac{{ - 4}}{3}}\\0&0&0&1&{\frac{1}{3}}\end{aligned}} \right)\)

Compute the Product R and N:

>> R*N

Thus,

\(R \cdot N = \left( {\begin{aligned}{*{20}{r}}0&0\\0&0\\0&0\\0&0\\0&0\end{aligned}} \right)\)

Hence, \(R\) is orthogonal to \(N\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Show that if an \(n \times n\) matrix satisfies \(\left( {U{\bf{x}}} \right) \cdot \left( {U{\bf{y}}} \right) = {\bf{x}} \cdot {\bf{y}}\) for all x and y in \({\mathbb{R}^n}\), then \(U\) is an orthogonal matrix.

In Exercises 13 and 14, the columns of Q were obtained by applying the Gram-Schmidt process to the columns of A. Find an upper triangular matrix R such that \(A = QR\). Check your work.

13. \(A = \left( {\begin{aligned}{{}{}}5&9\\1&7\\{ - 3}&{ - 5}\\1&5\end{aligned}} \right),{\rm{ }}Q = \left( {\begin{aligned}{{}{}}{\frac{5}{6}}&{ - \frac{1}{6}}\\{\frac{1}{6}}&{\frac{5}{6}}\\{ - \frac{3}{6}}&{\frac{1}{6}}\\{\frac{1}{6}}&{\frac{3}{6}}\end{aligned}} \right)\)

Let \(\left\{ {{{\bf{v}}_1}, \ldots ,{{\bf{v}}_p}} \right\}\) be an orthonormal set. Verify the following equality by induction, beginning with \(p = 2\). If \({\bf{x}} = {c_1}{{\bf{v}}_1} + \ldots + {c_p}{{\bf{v}}_p}\), then

\({\left\| {\bf{x}} \right\|^2} = {\left| {{c_1}} \right|^2} + {\left| {{c_2}} \right|^2} + \ldots + {\left| {{c_p}} \right|^2}\)

Exercises 13 and 14, the columns of \(Q\) were obtained by applying the Gram Schmidt process to the columns of \(A\). Find anupper triangular matrix \(R\) such that \(A = QR\). Check your work.

14.\(A = \left( {\begin{aligned}{{}{r}}{ - 2}&3\\5&7\\2&{ - 2}\\4&6\end{aligned}} \right)\), \(Q = \left( {\begin{aligned}{{}{r}}{\frac{{ - 2}}{7}}&{\frac{5}{7}}\\{\frac{5}{7}}&{\frac{2}{7}}\\{\frac{2}{7}}&{\frac{{ - 4}}{7}}\\{\frac{4}{7}}&{\frac{2}{7}}\end{aligned}} \right)\)

For a matrix program, the Gram–Schmidt process worksbetter with orthonormal vectors. Starting with \({x_1},......,{x_p}\) asin Theorem 11, let \(A = \left\{ {{x_1},......,{x_p}} \right\}\) . Suppose \(Q\) is an\(n \times k\)matrix whose columns form an orthonormal basis for

the subspace \({W_k}\) spanned by the first \(k\) columns of A. Thenfor \(x\) in \({\mathbb{R}^n}\), \(Q{Q^T}x\) is the orthogonal projection of x onto \({W_k}\) (Theorem 10 in Section 6.3). If \({x_{k + 1}}\) is the next column of \(A\),then equation (2) in the proof of Theorem 11 becomes

\({v_{k + 1}} = {x_{k + 1}} - Q\left( {{Q^T}T {x_{k + 1}}} \right)\)

(The parentheses above reduce the number of arithmeticoperations.) Let \({u_{k + 1}} = \frac{{{v_{k + 1}}}}{{\left\| {{v_{k + 1}}} \right\|}}\). The new \(Q\) for thenext step is \(\left( {\begin{aligned}{{}{}}Q&{{u_{k + 1}}}\end{aligned}} \right)\). Use this procedure to compute the\(QR\)factorization of the matrix in Exercise 24. Write thekeystrokes or commands you use.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free