×

×

# Solutions for Chapter 6.4: Operation Preserving Maps

## Full solutions for A Transition to Advanced Mathematics | 7th Edition

ISBN: 9780495562023

Solutions for Chapter 6.4: Operation Preserving Maps

Solutions for Chapter 6.4
4 5 0 350 Reviews
28
5
##### ISBN: 9780495562023

This expansive textbook survival guide covers the following chapters and their solutions. Chapter 6.4: Operation Preserving Maps includes 22 full step-by-step solutions. A Transition to Advanced Mathematics was written by and is associated to the ISBN: 9780495562023. Since 22 problems in chapter 6.4: Operation Preserving Maps have been answered, more than 27177 students have viewed full step-by-step solutions from this chapter. This textbook survival guide was created for the textbook: A Transition to Advanced Mathematics, edition: 7.

Key Math Terms and definitions covered in this textbook
• 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).

• 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.

• Cayley-Hamilton Theorem.

peA) = det(A - AI) has peA) = zero matrix.

• Cramer's Rule for Ax = b.

B j has b replacing column j of A; x j = det B j I det A

• Diagonalizable matrix A.

Must have n independent eigenvectors (in the columns of S; automatic with n different eigenvalues). Then S-I AS = A = eigenvalue matrix.

• Dot product = Inner product x T y = XI Y 1 + ... + Xn Yn.

Complex dot product is x T Y . Perpendicular vectors have x T y = O. (AB)ij = (row i of A)T(column j of B).

• Echelon matrix U.

The first nonzero entry (the pivot) in each row comes in a later column than the pivot in the previous row. All zero rows come last.

• Fourier matrix F.

Entries Fjk = e21Cijk/n give orthogonal columns FT F = nI. Then y = Fe is the (inverse) Discrete Fourier Transform Y j = L cke21Cijk/n.

• 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!).

• Hypercube matrix pl.

Row n + 1 counts corners, edges, faces, ... of a cube in Rn.

• Identity matrix I (or In).

Diagonal entries = 1, off-diagonal 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.

• Linear combination cv + d w or L C jV j.

• Minimal polynomial of A.

The lowest degree polynomial with meA) = zero matrix. This is peA) = det(A - AI) if no eigenvalues are repeated; always meA) divides peA).

• Norm

IIA II. The ".e 2 norm" of A is the maximum ratio II Ax II/l1x II = O"max· Then II Ax II < IIAllllxll and IIABII < IIAIIIIBII and IIA + BII < IIAII + IIBII. Frobenius norm IIAII} = L La~. The.e 1 and.e oo norms are largest column and row sums of laij I.

• Normal equation AT Ax = ATb.

Gives the least squares solution to Ax = b if A has full rank n (independent columns). The equation says that (columns of A)·(b - Ax) = o.

• Orthogonal subspaces.

Every v in V is orthogonal to every w in W.

• Partial pivoting.

In each column, choose the largest available pivot to control roundoff; all multipliers have leij I < 1. See condition number.

• Skew-symmetric matrix K.

The transpose is -K, since Kij = -Kji. Eigenvalues are pure imaginary, eigenvectors are orthogonal, eKt is an orthogonal matrix.

• Stiffness matrix

If x gives the movements of the nodes, K x gives the internal forces. K = ATe A where C has spring constants from Hooke's Law and Ax = stretching.