 4.4.1: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.2: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.3: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.4: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.5: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.6: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.7: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.8: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.9: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.10: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.11: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.12: 112 are about orthogonal vectors and orthogonal matrices.
 4.4.13: 1325 are about the GramSchmidt process and A = QR.
 4.4.14: 1325 are about the GramSchmidt process and A = QR.
 4.4.15: 1325 are about the GramSchmidt process and A = QR.
 4.4.16: 1325 are about the GramSchmidt process and A = QR.
 4.4.17: 1325 are about the GramSchmidt process and A = QR.
 4.4.18: 1325 are about the GramSchmidt process and A = QR.
 4.4.19: 1325 are about the GramSchmidt process and A = QR.
 4.4.20: 1325 are about the GramSchmidt process and A = QR.
 4.4.21: 1325 are about the GramSchmidt process and A = QR.
 4.4.22: 1325 are about the GramSchmidt process and A = QR.
 4.4.23: 1325 are about the GramSchmidt process and A = QR.
 4.4.24: 1325 are about the GramSchmidt process and A = QR.
 4.4.25: 1325 are about the GramSchmidt process and A = QR.
 4.4.26: 2629 use the QR code in equations (1112). It executes GramSchmidt.
 4.4.27: 2629 use the QR code in equations (1112). It executes GramSchmidt.
 4.4.28: 2629 use the QR code in equations (1112). It executes GramSchmidt.
 4.4.29: 2629 use the QR code in equations (1112). It executes GramSchmidt.
 4.4.30: 3035 involve orthogonal matrices that are special.
 4.4.31: 3035 involve orthogonal matrices that are special.
 4.4.32: 3035 involve orthogonal matrices that are special.
 4.4.33: 3035 involve orthogonal matrices that are special.
 4.4.34: 3035 involve orthogonal matrices that are special.
 4.4.35: 3035 involve orthogonal matrices that are special.
 4.4.36: If A is m by n with rank n, qr(A) produces a square Q and zeros bel...
 4.4.37: We know that P = QQT is the projection onto the column space of Q(m...
Solutions for Chapter 4.4: Orthogonal Bases and GramSchmidt
Full solutions for Introduction to Linear Algebra  4th Edition
ISBN: 9780980232714
Solutions for Chapter 4.4: Orthogonal Bases and GramSchmidt
Get Full SolutionsThis textbook survival guide was created for the textbook: Introduction to Linear Algebra, edition: 4. Chapter 4.4: Orthogonal Bases and GramSchmidt includes 37 full stepbystep solutions. This expansive textbook survival guide covers the following chapters and their solutions. Introduction to Linear Algebra was written by and is associated to the ISBN: 9780980232714. Since 37 problems in chapter 4.4: Orthogonal Bases and GramSchmidt have been answered, more than 8145 students have viewed full stepbystep solutions from this chapter.

Adjacency matrix of a graph.
Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected). Adjacency matrix of a graph. Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected).

Back substitution.
Upper triangular systems are solved in reverse order Xn to Xl.

Big formula for n by n determinants.
Det(A) is a sum of n! terms. For each term: Multiply one entry from each row and column of A: rows in order 1, ... , nand column order given by a permutation P. Each of the n! P 's has a + or  sign.

Cofactor Cij.
Remove row i and column j; multiply the determinant by (I)i + j •

Complex conjugate
z = a  ib for any complex number z = a + ib. Then zz = Iz12.

Condition number
cond(A) = c(A) = IIAIlIIAIII = amaxlamin. In Ax = b, the relative change Ilox III Ilx II is less than cond(A) times the relative change Ilob III lib II· Condition numbers measure the sensitivity of the output to change in the input.

Diagonal matrix D.
dij = 0 if i # j. Blockdiagonal: zero outside square blocks Du.

Diagonalization
A = S1 AS. A = eigenvalue matrix and S = eigenvector matrix of A. A must have n independent eigenvectors to make S invertible. All Ak = SA k SI.

Free variable Xi.
Column i has no pivot in elimination. We can give the n  r free variables any values, then Ax = b determines the r pivot variables (if solvable!).

GramSchmidt orthogonalization A = QR.
Independent columns in A, orthonormal columns in Q. Each column q j of Q is a combination of the first j columns of A (and conversely, so R is upper triangular). Convention: diag(R) > o.

Identity matrix I (or In).
Diagonal entries = 1, offdiagonal entries = 0.

Jordan form 1 = M 1 AM.
If A has s independent eigenvectors, its "generalized" eigenvector matrix M gives 1 = diag(lt, ... , 1s). The block his Akh +Nk where Nk has 1 's on diagonall. Each block has one eigenvalue Ak and one eigenvector.

Kirchhoff's Laws.
Current Law: net current (in minus out) is zero at each node. Voltage Law: Potential differences (voltage drops) add to zero around any closed loop.

Network.
A directed graph that has constants Cl, ... , Cm associated with the edges.

Normal matrix.
If N NT = NT N, then N has orthonormal (complex) eigenvectors.

Outer product uv T
= column times row = rank one matrix.

Simplex method for linear programming.
The minimum cost vector x * is found by moving from comer to lower cost comer along the edges of the feasible set (where the constraints Ax = b and x > 0 are satisfied). Minimum cost at a comer!

Singular Value Decomposition
(SVD) A = U:E VT = (orthogonal) ( diag)( orthogonal) First r columns of U and V are orthonormal bases of C (A) and C (AT), AVi = O'iUi with singular value O'i > O. Last columns are orthonormal bases of nullspaces.

Special solutions to As = O.
One free variable is Si = 1, other free variables = o.

Transpose matrix AT.
Entries AL = Ajj. AT is n by In, AT A is square, symmetric, positive semidefinite. The transposes of AB and AI are BT AT and (AT)I.