 Chapter 1.1: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.2: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.3: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.4: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.5: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.6: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.7: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.8: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.9: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.10: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.11: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.12: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.13: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.14: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.15: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.16: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.17: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.18: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.19: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.20: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.21: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.22: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.23: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.24: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.25: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.26: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.27: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.28: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.29: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.30: Find general solutions of the differential equations in 1 through 3...
 Chapter 1.31: Each of the differential equations in 31 through 36 is of two diffe...
 Chapter 1.32: Each of the differential equations in 31 through 36 is of two diffe...
 Chapter 1.33: Each of the differential equations in 31 through 36 is of two diffe...
 Chapter 1.34: Each of the differential equations in 31 through 36 is of two diffe...
 Chapter 1.35: Each of the differential equations in 31 through 36 is of two diffe...
 Chapter 1.36: Each of the differential equations in 31 through 36 is of two diffe...
Solutions for Chapter Chapter 1: FirstOrder Differential Equations
Full solutions for Differential Equations and Boundary Value Problems: Computing and Modeling  5th Edition
ISBN: 9780321796981
Solutions for Chapter Chapter 1: FirstOrder Differential Equations
Get Full SolutionsChapter Chapter 1: FirstOrder Differential Equations includes 36 full stepbystep solutions. This expansive textbook survival guide covers the following chapters and their solutions. This textbook survival guide was created for the textbook: Differential Equations and Boundary Value Problems: Computing and Modeling, edition: 5. Differential Equations and Boundary Value Problems: Computing and Modeling was written by and is associated to the ISBN: 9780321796981. Since 36 problems in chapter Chapter 1: FirstOrder Differential Equations have been answered, more than 15583 students have viewed full stepbystep solutions from this chapter.

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.

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

Column picture of Ax = b.
The vector b becomes a combination of the columns of A. The system is solvable only when b is in the column space C (A).

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

Determinant IAI = det(A).
Defined by det I = 1, sign reversal for row exchange, and linearity in each row. Then IAI = 0 when A is singular. Also IABI = IAIIBI and

Diagonalizable matrix A.
Must have n independent eigenvectors (in the columns of S; automatic with n different eigenvalues). Then SI AS = A = eigenvalue matrix.

Elimination matrix = Elementary matrix Eij.
The identity matrix with an extra eij in the i, j entry (i # j). Then Eij A subtracts eij times row j of A from row i.

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

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.

Linear combination cv + d w or L C jV j.
Vector addition and scalar multiplication.

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

Projection matrix P onto subspace S.
Projection p = P b is the closest point to b in S, error e = b  Pb is perpendicularto S. p 2 = P = pT, eigenvalues are 1 or 0, eigenvectors are in S or S...L. If columns of A = basis for S then P = A (AT A) 1 AT.

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.

Reflection matrix (Householder) Q = I 2uuT.
Unit vector u is reflected to Qu = u. All x intheplanemirroruTx = o have Qx = x. Notice QT = Q1 = Q.

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

Semidefinite matrix A.
(Positive) semidefinite: all x T Ax > 0, all A > 0; A = any RT R.

Special solutions to As = O.
One free variable is Si = 1, other free variables = o.

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

Tridiagonal matrix T: tij = 0 if Ii  j I > 1.
T 1 has rank 1 above and below diagonal.