×
×

# Solutions for Chapter 4.1: Polynomial Functions and Models

## Full solutions for Precalculus Enhanced with Graphing Utilities | 6th Edition

ISBN: 9780132854351

Solutions for Chapter 4.1: Polynomial Functions and Models

Solutions for Chapter 4.1
4 5 0 363 Reviews
13
1
##### ISBN: 9780132854351

This textbook survival guide was created for the textbook: Precalculus Enhanced with Graphing Utilities, edition: 6. This expansive textbook survival guide covers the following chapters and their solutions. Chapter 4.1: Polynomial Functions and Models includes 117 full step-by-step solutions. Since 117 problems in chapter 4.1: Polynomial Functions and Models have been answered, more than 55881 students have viewed full step-by-step solutions from this chapter. Precalculus Enhanced with Graphing Utilities was written by and is associated to the ISBN: 9780132854351.

Key Math Terms and definitions covered in this textbook
• Back substitution.

Upper triangular systems are solved in reverse order Xn to Xl.

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

• Eigenvalue A and eigenvector x.

Ax = AX with x#-O so det(A - AI) = o.

• Factorization

A = L U. If elimination takes A to U without row exchanges, then the lower triangular L with multipliers eij (and eii = 1) brings U back to A.

• Iterative method.

A sequence of steps intended to approach the desired solution.

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

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

• Left inverse A+.

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

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

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

• Nullspace matrix N.

The columns of N are the n - r special solutions to As = O.

• Particular solution x p.

Any solution to Ax = b; often x p has free variables = o.

• Positive definite matrix A.

Symmetric matrix with positive eigenvalues and positive pivots. Definition: x T Ax > 0 unless x = O. Then A = LDLT with diag(D» O.

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

P = aaT laTa has rank l.

• Row space C (AT) = all combinations of rows of A.

Column vectors by convention.

• Schwarz inequality

Iv·wl < IIvll IIwll.Then IvTAwl2 < (vT Av)(wT Aw) for pos def A.

• Solvable system Ax = b.

The right side b is in the column space of A.

• Spectral Theorem A = QAQT.

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

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

×