×
×

Solutions for Chapter 3: Polynomial Functions

Full solutions for College Algebra | 9th Edition

ISBN: 9781133963028

Solutions for Chapter 3: Polynomial Functions

Solutions for Chapter 3
4 5 0 415 Reviews
26
0
ISBN: 9781133963028

Chapter 3: Polynomial Functions includes 634 full step-by-step solutions. Since 634 problems in chapter 3: Polynomial Functions have been answered, more than 35869 students have viewed full step-by-step solutions from this chapter. This expansive textbook survival guide covers the following chapters and their solutions. This textbook survival guide was created for the textbook: College Algebra, edition: 9. College Algebra was written by and is associated to the ISBN: 9781133963028.

Key Math Terms and definitions covered in this textbook
• Cholesky factorization

A = CTC = (L.J]))(L.J]))T for positive definite A.

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

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

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

• Hankel matrix H.

Constant along each antidiagonal; hij depends on i + j.

• Hermitian matrix A H = AT = A.

Complex analog a j i = aU of a symmetric matrix.

• Identity matrix I (or In).

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

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

• Left nullspace N (AT).

Nullspace of AT = "left nullspace" of A because y T A = OT.

• Length II x II.

Square root of x T x (Pythagoras in n dimensions).

• Multiplication Ax

= Xl (column 1) + ... + xn(column n) = combination of columns.

• Network.

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

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

• Rank r (A)

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

• Row picture of Ax = b.

Each equation gives a plane in Rn; the planes intersect at x.

• Saddle point of I(x}, ... ,xn ).

A point where the first derivatives of I are zero and the second derivative matrix (a2 II aXi ax j = Hessian matrix) is indefinite.

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

• Special solutions to As = O.

One free variable is Si = 1, other free variables = o.