×
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.3: QUALITATIVE TECHNIQUE: SLOPE FIELDS

Differential Equations 00 | 4th Edition | ISBN: 9780495561989 | Authors: Paul (Paul Blanchard) Blanchard, Robert L. Devaney, Glen R. Hall

Full solutions for Differential Equations 00 | 4th Edition

ISBN: 9780495561989

Differential Equations 00 | 4th Edition | ISBN: 9780495561989 | Authors: Paul (Paul Blanchard) Blanchard, Robert L. Devaney, Glen R. Hall

Solutions for Chapter 1.3: QUALITATIVE TECHNIQUE: SLOPE FIELDS

This textbook survival guide was created for the textbook: Differential Equations 00, edition: 4. Since 22 problems in chapter 1.3: QUALITATIVE TECHNIQUE: SLOPE FIELDS have been answered, more than 16322 students have viewed full step-by-step solutions from this chapter. This expansive textbook survival guide covers the following chapters and their solutions. Differential Equations 00 was written by and is associated to the ISBN: 9780495561989. Chapter 1.3: QUALITATIVE TECHNIQUE: SLOPE FIELDS includes 22 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).

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

  • Back substitution.

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

  • Diagonal matrix D.

    dij = 0 if i #- j. Block-diagonal: zero outside square blocks Du.

  • Diagonalization

    A = S-1 AS. A = eigenvalue matrix and S = eigenvector matrix of A. A must have n independent eigenvectors to make S invertible. All Ak = SA k S-I.

  • Eigenvalue A and eigenvector x.

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

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

  • Free columns of A.

    Columns without pivots; these are combinations of earlier columns.

  • Identity matrix I (or In).

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

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

  • Linearly dependent VI, ... , Vn.

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

  • Matrix multiplication AB.

    The i, j entry of AB is (row i of A)ยท(column j of B) = L aikbkj. By columns: Column j of AB = A times column j of B. By rows: row i of A multiplies B. Columns times rows: AB = sum of (column k)(row k). All these equivalent definitions come from the rule that A B times x equals A times B x .

  • Pascal matrix

    Ps = pascal(n) = the symmetric matrix with binomial entries (i1~;2). Ps = PL Pu all contain Pascal's triangle with det = 1 (see Pascal in the index).

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

  • Row picture of Ax = b.

    Each equation gives a plane in Rn; the planes intersect at x.

  • Schur complement S, D - C A -} B.

    Appears in block elimination on [~ g ].

  • Similar matrices A and B.

    Every B = M-I AM has the same eigenvalues as A.

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

  • Trace of A

    = sum of diagonal entries = sum of eigenvalues of A. Tr AB = Tr BA.

  • Vector addition.

    v + w = (VI + WI, ... , Vn + Wn ) = diagonal of parallelogram.

×
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