×
Get Full Access to Math - Textbook Survival Guide
Get Full Access to Math - Textbook Survival Guide

×

# Solutions for Chapter 11-1: Inverse Variation

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

ISBN: 9780078738227

Solutions for Chapter 11-1: Inverse Variation

Solutions for Chapter 11-1
4 5 0 248 Reviews
17
0
##### ISBN: 9780078738227

Algebra 1, Student Edition (MERRILL ALGEBRA 1) was written by and is associated to the ISBN: 9780078738227. This expansive textbook survival guide covers the following chapters and their solutions. Chapter 11-1: Inverse Variation includes 60 full step-by-step solutions. This textbook survival guide was created for the textbook: Algebra 1, Student Edition (MERRILL ALGEBRA 1) , edition: 1. Since 60 problems in chapter 11-1: Inverse Variation have been answered, more than 37477 students have viewed full step-by-step solutions from this chapter.

Key Math Terms and definitions covered in this textbook
• Affine transformation

Tv = Av + Vo = linear transformation plus shift.

• Basis for V.

Independent vectors VI, ... , v d whose linear combinations give each vector in V as v = CIVI + ... + CdVd. V has many bases, each basis gives unique c's. A vector space has many bases!

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

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

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

• Dimension of vector space

dim(V) = number of vectors in any basis for V.

• Distributive Law

A(B + C) = AB + AC. Add then multiply, or mUltiply then add.

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

• Full column rank r = n.

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

• Independent vectors VI, .. " vk.

No combination cl VI + ... + qVk = zero vector unless all ci = O. If the v's are the columns of A, the only solution to Ax = 0 is x = o.

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

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

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

• Least squares solution X.

The vector x that minimizes the error lie 112 solves AT Ax = ATb. Then e = b - Ax is orthogonal to all columns of A.

• Linearly dependent VI, ... , Vn.

A combination other than all Ci = 0 gives L Ci Vi = O.

• Partial pivoting.

In each column, choose the largest available pivot to control roundoff; all multipliers have leij I < 1. See condition number.

• Reduced row echelon form R = rref(A).

Pivots = 1; zeros above and below pivots; the r nonzero rows of R give a basis for the row space of A.

• Special solutions to As = O.

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

• Spectral Theorem A = QAQT.

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

• Symmetric matrix A.

The transpose is AT = A, and aU = a ji. A-I is also symmetric.

• Transpose matrix AT.

Entries AL = Ajj. AT is n by In, AT A is square, symmetric, positive semidefinite. The transposes of AB and A-I are BT AT and (AT)-I.