> > > Chapter 9

Solutions for Chapter 9: Contemporary Abstract Algebra 8th Edition

Full solutions for Contemporary Abstract Algebra | 8th Edition

ISBN: 9781133599708

Solutions for Chapter 9

Solutions for Chapter 9
4 5 0 373 Reviews
10
0
ISBN: 9781133599708

This expansive textbook survival guide covers the following chapters and their solutions. Since 79 problems in chapter 9 have been answered, more than 14369 students have viewed full step-by-step solutions from this chapter. Chapter 9 includes 79 full step-by-step solutions. This textbook survival guide was created for the textbook: Contemporary Abstract Algebra , edition: 8th. Contemporary Abstract Algebra was written by Sieva Kozinsky and is associated to the ISBN: 9781133599708.

Key Math Terms and definitions covered in this textbook
• Circulant matrix C.

Constant diagonals wrap around as in cyclic shift S. Every circulant is Col + CIS + ... + Cn_lSn - l . Cx = convolution c * x. Eigenvectors in F.

• Commuting matrices AB = BA.

If diagonalizable, they share n eigenvectors.

• Covariance matrix:E.

When random variables Xi have mean = average value = 0, their covariances "'£ ij are the averages of XiX j. With means Xi, the matrix :E = mean of (x - x) (x - x) T is positive (semi)definite; :E is diagonal if the Xi are independent.

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

• Exponential eAt = I + At + (At)2 12! + ...

has derivative AeAt; eAt u(O) solves u' = Au.

• Fast Fourier Transform (FFT).

A factorization of the Fourier matrix Fn into e = log2 n matrices Si times a permutation. Each Si needs only nl2 multiplications, so Fnx and Fn-1c can be computed with ne/2 multiplications. Revolutionary.

• Gauss-Jordan method.

Invert A by row operations on [A I] to reach [I A-I].

• Hilbert matrix hilb(n).

Entries HU = 1/(i + j -1) = Jd X i- 1 xj-1dx. Positive definite but extremely small Amin and large condition number: H is ill-conditioned.

• Hypercube matrix pl.

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

• Krylov subspace Kj(A, b).

The subspace spanned by b, Ab, ... , Aj-Ib. Numerical methods approximate A -I b by x j with residual b - Ax j in this subspace. A good basis for K j requires only multiplication by A at each step.

• lA-II = l/lAI and IATI = IAI.

The big formula for det(A) has a sum of n! terms, the cofactor formula uses determinants of size n - 1, volume of box = I det( A) I.

• Multiplier eij.

The pivot row j is multiplied by eij and subtracted from row i to eliminate the i, j entry: eij = (entry to eliminate) / (jth pivot).

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

• Pivot.

The diagonal entry (first nonzero) at the time when a row is used in elimination.

• Projection p = a(aTblaTa) onto the line through a.

P = aaT laTa has rank l.

• Schur complement S, D - C A -} B.

Appears in block elimination on [~ g ].

• Standard basis for Rn.

Columns of n by n identity matrix (written i ,j ,k in R3).

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

• Vector space V.

Set of vectors such that all combinations cv + d w remain within V. Eight required rules are given in Section 3.1 for scalars c, d and vectors v, w.

×

I don't want to reset my password

Need help? Contact support

Need an Account? Is not associated with an account
We're here to help