×
×

# Solutions for Chapter 6-9: Rational Zero Theorem

## Full solutions for Algebra 2, Student Edition (MERRILL ALGEBRA 2) | 1st Edition

ISBN: 9780078738302

Solutions for Chapter 6-9: Rational Zero Theorem

Solutions for Chapter 6-9
4 5 0 419 Reviews
22
5
##### ISBN: 9780078738302

Since 52 problems in chapter 6-9: Rational Zero Theorem have been answered, more than 53530 students have viewed full step-by-step solutions from this chapter. Chapter 6-9: Rational Zero Theorem includes 52 full step-by-step solutions. This textbook survival guide was created for the textbook: Algebra 2, Student Edition (MERRILL ALGEBRA 2), edition: 1. Algebra 2, Student Edition (MERRILL ALGEBRA 2) was written by and is associated to the ISBN: 9780078738302. This expansive textbook survival guide covers the following chapters and their solutions.

Key Math Terms and definitions covered in this textbook
• Associative Law (AB)C = A(BC).

Parentheses can be removed to leave ABC.

• Augmented matrix [A b].

Ax = b is solvable when b is in the column space of A; then [A b] has the same rank as A. Elimination on [A b] keeps equations correct.

• Column space C (A) =

space of all combinations of the columns of A.

• Complex conjugate

z = a - ib for any complex number z = a + ib. Then zz = Iz12.

• Condition number

cond(A) = c(A) = IIAIlIIA-III = amaxlamin. In Ax = b, the relative change Ilox III Ilx II is less than cond(A) times the relative change Ilob III lib II· Condition numbers measure the sensitivity of the output to change in the input.

• Elimination matrix = Elementary matrix Eij.

The identity matrix with an extra -eij in the i, j entry (i #- j). Then Eij A subtracts eij times row j of A from row i.

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

Use AT for complex A.

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

• Identity matrix I (or In).

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

• Indefinite matrix.

A symmetric matrix with eigenvalues of both signs (+ and - ).

• Kronecker product (tensor product) A ® B.

Blocks aij B, eigenvalues Ap(A)Aq(B).

• Lucas numbers

Ln = 2,J, 3, 4, ... satisfy Ln = L n- l +Ln- 2 = A1 +A~, with AI, A2 = (1 ± -/5)/2 from the Fibonacci matrix U~]' Compare Lo = 2 with Fo = O.

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

• Pivot.

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

• Pseudoinverse A+ (Moore-Penrose inverse).

The n by m matrix that "inverts" A from column space back to row space, with N(A+) = N(AT). A+ A and AA+ are the projection matrices onto the row space and column space. Rank(A +) = rank(A).

• Singular matrix A.

A square matrix that has no inverse: det(A) = o.

• Spectral Theorem A = QAQT.

Real symmetric A has real A'S and orthonormal q's.

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

Spectral radius = max of IAi I.

×