Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide

Solutions for Chapter 11: Similarity

Full solutions for Discovering Geometry: An Investigative Approach | 4th Edition

ISBN: 9781559538824

Solutions for Chapter 11: Similarity

Solutions for Chapter 11
4 5 0 292 Reviews
Textbook: Discovering Geometry: An Investigative Approach
Edition: 4
Author: Michael Serra
ISBN: 9781559538824

This expansive textbook survival guide covers the following chapters and their solutions. Discovering Geometry: An Investigative Approach was written by and is associated to the ISBN: 9781559538824. This textbook survival guide was created for the textbook: Discovering Geometry: An Investigative Approach, edition: 4. Since 22 problems in chapter 11: Similarity have been answered, more than 21714 students have viewed full step-by-step solutions from this chapter. Chapter 11: Similarity includes 22 full step-by-step solutions.

Key Math Terms and definitions covered in this textbook
  • Cayley-Hamilton Theorem.

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

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

  • Fibonacci numbers

    0,1,1,2,3,5, ... satisfy Fn = Fn-l + Fn- 2 = (A7 -A~)I()q -A2). Growth rate Al = (1 + .J5) 12 is the largest eigenvalue of the Fibonacci matrix [ } A].

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

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

  • Hessenberg matrix H.

    Triangular matrix with one extra nonzero adjacent diagonal.

  • Identity matrix I (or In).

    Diagonal entries = 1, off-diagonal entries = 0.

  • Iterative method.

    A sequence of steps intended to approach the desired solution.

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

  • Multiplicities AM and G M.

    The algebraic multiplicity A M of A is the number of times A appears as a root of det(A - AI) = O. The geometric multiplicity GM is the number of independent eigenvectors for A (= dimension of the eigenspace).

  • Network.

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

  • Polar decomposition A = Q H.

    Orthogonal Q times positive (semi)definite H.

  • Rank r (A)

    = number of pivots = dimension of column space = dimension of row space.

  • Skew-symmetric matrix K.

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

  • Spanning set.

    Combinations of VI, ... ,Vm fill the space. The columns of A span C (A)!

  • Spectrum of A = the set of eigenvalues {A I, ... , An}.

    Spectral radius = max of IAi I.

  • Symmetric factorizations A = LDLT and A = QAQT.

    Signs in A = signs in D.

  • Trace of A

    = sum of diagonal entries = sum of eigenvalues of A. Tr AB = Tr BA.

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

Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide
Reset your password