×
Log in to StudySoup
Get Full Access to Mathematics Education - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Mathematics Education - Textbook Survival Guide

Solutions for Chapter 9.1: Geometry

A Survey of Mathematics with Applications | 9th Edition | ISBN:  9780321759665 | Authors: Allen R. Angel, Christine D. Abbott, Dennis C. Runde

Full solutions for A Survey of Mathematics with Applications | 9th Edition

ISBN: 9780321759665

A Survey of Mathematics with Applications | 9th Edition | ISBN:  9780321759665 | Authors: Allen R. Angel, Christine D. Abbott, Dennis C. Runde

Solutions for Chapter 9.1: Geometry

Solutions for Chapter 9.1
4 5 0 288 Reviews
17
5
Textbook: A Survey of Mathematics with Applications
Edition: 9
Author: Allen R. Angel, Christine D. Abbott, Dennis C. Runde
ISBN: 9780321759665

Chapter 9.1: Geometry includes 115 full step-by-step solutions. Since 115 problems in chapter 9.1: Geometry have been answered, more than 71098 students have viewed full step-by-step solutions from this chapter. This textbook survival guide was created for the textbook: A Survey of Mathematics with Applications, edition: 9. This expansive textbook survival guide covers the following chapters and their solutions. A Survey of Mathematics with Applications was written by and is associated to the ISBN: 9780321759665.

Key Math Terms and definitions covered in this textbook
  • Cofactor Cij.

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

  • Column space C (A) =

    space of all combinations of the columns of A.

  • Complete solution x = x p + Xn to Ax = b.

    (Particular x p) + (x n in nullspace).

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

  • Ellipse (or ellipsoid) x T Ax = 1.

    A must be positive definite; the axes of the ellipse are eigenvectors of A, with lengths 1/.JI. (For IIx II = 1 the vectors y = Ax lie on the ellipse IIA-1 yll2 = Y T(AAT)-1 Y = 1 displayed by eigshow; axis lengths ad

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

  • Four Fundamental Subspaces C (A), N (A), C (AT), N (AT).

    Use AT for complex A.

  • Full column rank r = n.

    Independent columns, N(A) = {O}, no free variables.

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

  • Identity matrix I (or In).

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

  • Inverse matrix A-I.

    Square matrix with A-I A = I and AA-l = I. No inverse if det A = 0 and rank(A) < n and Ax = 0 for a nonzero vector x. The inverses of AB and AT are B-1 A-I and (A-I)T. Cofactor formula (A-l)ij = Cji! detA.

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

  • Left inverse A+.

    If A has full column rank n, then A+ = (AT A)-I AT has A+ A = In.

  • Matrix multiplication AB.

    The i, j entry of AB is (row i of A)·(column j of B) = L aikbkj. By columns: Column j of AB = A times column j of B. By rows: row i of A multiplies B. Columns times rows: AB = sum of (column k)(row k). All these equivalent definitions come from the rule that A B times x equals A times B x .

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

  • Permutation matrix P.

    There are n! orders of 1, ... , n. The n! P 's have the rows of I in those orders. P A puts the rows of A in the same order. P is even or odd (det P = 1 or -1) based on the number of row exchanges to reach I.

  • Pivot.

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

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

  • Trace of A

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

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