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

Solutions for Chapter 2: Linear Equations and Inequalities in One Variable

Beginning Algebra | 11th Edition | ISBN: 9780321673480 | Authors: Margaret L. Lial John Hornsby, Terry McGinnis

Full solutions for Beginning Algebra | 11th Edition

ISBN: 9780321673480

Beginning Algebra | 11th Edition | ISBN: 9780321673480 | Authors: Margaret L. Lial John Hornsby, Terry McGinnis

Solutions for Chapter 2: Linear Equations and Inequalities in One Variable

Solutions for Chapter 2
4 5 0 348 Reviews
15
0
Textbook: Beginning Algebra
Edition: 11
Author: Margaret L. Lial John Hornsby, Terry McGinnis
ISBN: 9780321673480

Chapter 2: Linear Equations and Inequalities in One Variable includes 82 full step-by-step solutions. This expansive textbook survival guide covers the following chapters and their solutions. This textbook survival guide was created for the textbook: Beginning Algebra, edition: 11. Beginning Algebra was written by and is associated to the ISBN: 9780321673480. Since 82 problems in chapter 2: Linear Equations and Inequalities in One Variable have been answered, more than 39769 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.

  • Change of basis matrix M.

    The old basis vectors v j are combinations L mij Wi of the new basis vectors. The coordinates of CI VI + ... + cnvn = dl wI + ... + dn Wn are related by d = M c. (For n = 2 set VI = mll WI +m21 W2, V2 = m12WI +m22w2.)

  • Cholesky factorization

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

  • Cofactor Cij.

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

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

  • Cross product u xv in R3:

    Vector perpendicular to u and v, length Ilullllvlll sin el = area of parallelogram, u x v = "determinant" of [i j k; UI U2 U3; VI V2 V3].

  • Elimination.

    A sequence of row operations that reduces A to an upper triangular U or to the reduced form R = rref(A). Then A = LU with multipliers eO in L, or P A = L U with row exchanges in P, or E A = R with an invertible E.

  • Fourier matrix F.

    Entries Fjk = e21Cijk/n give orthogonal columns FT F = nI. Then y = Fe is the (inverse) Discrete Fourier Transform Y j = L cke21Cijk/n.

  • Gauss-Jordan method.

    Invert A by row operations on [A I] to reach [I A-I].

  • Linear combination cv + d w or L C jV j.

    Vector addition and scalar multiplication.

  • Linearly dependent VI, ... , Vn.

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

  • Multiplicities AM and G M.

    The algebraic multiplicity A M of A is the number of times A appears as a root of det(A - AI) = O. The geometric multiplicity GM is the number of independent eigenvectors for A (= dimension of the eigenspace).

  • Orthogonal matrix Q.

    Square matrix with orthonormal columns, so QT = Q-l. Preserves length and angles, IIQxll = IIxll and (QX)T(Qy) = xTy. AlllAI = 1, with orthogonal eigenvectors. Examples: Rotation, reflection, permutation.

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

    Column vectors by convention.

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

  • Singular Value Decomposition

    (SVD) A = U:E VT = (orthogonal) ( diag)( orthogonal) First r columns of U and V are orthonormal bases of C (A) and C (AT), AVi = O'iUi with singular value O'i > O. Last columns are orthonormal bases of nullspaces.

  • Solvable system Ax = b.

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

  • Stiffness matrix

    If x gives the movements of the nodes, K x gives the internal forces. K = ATe A where C has spring constants from Hooke's Law and Ax = stretching.

  • Subspace S of V.

    Any vector space inside V, including V and Z = {zero vector only}.

  • Toeplitz matrix.

    Constant down each diagonal = time-invariant (shift-invariant) filter.

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