×
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 1.1: Introduction to Linear Algebra 5th Edition

Introduction to Linear Algebra | 5th Edition | ISBN: 9780201658590 | Authors: Lee W. Johnson, R. Dean Riess, Jimmy T. Arnold

Full solutions for Introduction to Linear Algebra | 5th Edition

ISBN: 9780201658590

Introduction to Linear Algebra | 5th Edition | ISBN: 9780201658590 | Authors: Lee W. Johnson, R. Dean Riess, Jimmy T. Arnold

Solutions for Chapter 1.1

Solutions for Chapter 1.1
4 5 0 283 Reviews
21
5
Textbook: Introduction to Linear Algebra
Edition: 5
Author: Lee W. Johnson, R. Dean Riess, Jimmy T. Arnold
ISBN: 9780201658590

This expansive textbook survival guide covers the following chapters and their solutions. Since 42 problems in chapter 1.1 have been answered, more than 6827 students have viewed full step-by-step solutions from this chapter. Introduction to Linear Algebra was written by and is associated to the ISBN: 9780201658590. This textbook survival guide was created for the textbook: Introduction to Linear Algebra , edition: 5. Chapter 1.1 includes 42 full step-by-step solutions.

Key Math Terms and definitions covered in this textbook
  • Adjacency matrix of a graph.

    Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected). Adjacency matrix of a graph. Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected).

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

  • Commuting matrices AB = BA.

    If diagonalizable, they share n eigenvectors.

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

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

  • Hessenberg matrix H.

    Triangular matrix with one extra nonzero adjacent diagonal.

  • Iterative method.

    A sequence of steps intended to approach the desired solution.

  • Kronecker product (tensor product) A ® B.

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

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

  • Length II x II.

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

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

  • Outer product uv T

    = column times row = rank one matrix.

  • Pivot columns of A.

    Columns that contain pivots after row reduction. These are not combinations of earlier columns. The pivot columns are a basis for the column space.

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

  • Random matrix rand(n) or randn(n).

    MATLAB creates a matrix with random entries, uniformly distributed on [0 1] for rand and standard normal distribution for randn.

  • Rotation matrix

    R = [~ CS ] rotates the plane by () and R- 1 = RT rotates back by -(). Eigenvalues are eiO and e-iO , eigenvectors are (1, ±i). c, s = cos (), sin ().

  • Singular matrix A.

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

  • Special solutions to As = O.

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

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

×
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