 Chapter 1.1: Some Basic Mathematical Models; Direction Fields
 Chapter 1.2: Solutions of Some Differential Equations
 Chapter 1.3: Classification of Differential Equations
 Chapter 10.1: TwoPoint Boundary Value Problems
 Chapter 10.2: Fourier Series
 Chapter 10.3: The Fourier Convergence Theorem
 Chapter 10.4: Even and Odd Functions
 Chapter 10.5: Separation of Variables; Heat Conduction in a Rod
 Chapter 10.6: Other Heat Conduction Problems
 Chapter 10.7: The Wave Equation: Vibrations of an Elastic String
 Chapter 10.8: Laplaces Equation
 Chapter 11.1: The Occurrence of TwoPoint Boundary Value Problems
 Chapter 11.2: SturmLiouville Boundary Value Problems
 Chapter 11.3: Nonhomogeneous Boundary Value Problems
 Chapter 11.4: Singular SturmLiouville Problems
 Chapter 11.5: Further Remarks on the Method of Separation of Variables: A Bessel Series Expansion
 Chapter 11.6: Series of Orthogonal Functions: Mean Convergence
 Chapter 2: First Order Difference Equations
 Chapter 2.1: Linear Equations; Method of Integrating Factors
 Chapter 2.2: Separable Equations
 Chapter 2.3: Modeling with First Order Equations
 Chapter 2.4: Differences Between Linear and Nonlinear Equations
 Chapter 2.5: Autonomous Equations and Population Dynamics
 Chapter 2.6: Exact Equations and Integrating Factors
 Chapter 2.7: Numerical Approximations: Eulers Method
 Chapter 2.8: The Existence and Uniqueness Theorem
 Chapter 2.9: First Order Difference Equations
 Chapter 3.1: Homogeneous Equations with Constant Coefficients
 Chapter 3.2: Solutions of Linear Homogeneous Equations; the Wronskian
 Chapter 3.3: Complex Roots of the Characteristic Equation
 Chapter 3.4: Repeated Roots; Reduction of Order
 Chapter 3.5: Nonhomogeneous Equations; Method of Undetermined Coefficients
 Chapter 3.6: Variation of Parameters
 Chapter 3.7: Mechanical and Electrical Vibrations
 Chapter 3.8: Forced Vibrations
 Chapter 4.1: General Theory of nth Order Linear Equations
 Chapter 4.2: Homogeneous Equations with Constant Coefficients
 Chapter 4.3: The Method of Undetermined Coefficients
 Chapter 4.4: The Method of Variation of Parameters
 Chapter 5.1: Review of Power Series
 Chapter 5.2: Series Solutions Near an Ordinary Point, Part I
 Chapter 5.3: Series Solutions Near an Ordinary Point, Part II
 Chapter 5.4: Euler Equations; Regular Singular Points
 Chapter 5.5: Series Solutions Near a Regular Singular Point, Part I
 Chapter 5.6: Series Solutions Near a Regular Singular Point, Part II
 Chapter 5.7: Bessels Equation
 Chapter 6.1: Definition of the Laplace Transform
 Chapter 6.2: Solution of Initial Value Problems
 Chapter 6.3: Step Functions
 Chapter 6.4: Differential Equations with Discontinuous Forcing Functions
 Chapter 6.5: Impulse Functions
 Chapter 6.6: The Convolution Integral
 Chapter 7.1: Introduction
 Chapter 7.2: Review of Matrices
 Chapter 7.3: Systems of Linear Algebraic Equations; Linear Independence, Eigenvalues, Eigenvectors
 Chapter 7.4: Basic Theory of Systems of First Order Linear Equations
 Chapter 7.5: Homogeneous Linear Systems with Constant Coefficients
 Chapter 7.6: Complex Eigenvalues
 Chapter 7.7: Fundamental Matrices
 Chapter 7.8: Repeated Eigenvalues
 Chapter 7.9: Nonhomogeneous Linear Systems
 Chapter 8.1: The Euler or Tangent Line Method
 Chapter 8.2: Improvements on the Euler Method
 Chapter 8.3: The RungeKutta Method
 Chapter 8.4: Multistep Methods
 Chapter 8.5: More on Errors; Stability
 Chapter 8.6: Systems of First Order Equations
 Chapter 9.1: The Phase Plane: Linear Systems
 Chapter 9.2: Autonomous Systems and Stability
 Chapter 9.3: Locally Linear Systems
 Chapter 9.4: Competing Species
 Chapter 9.5: PredatorPrey Equations
 Chapter 9.6: Liapunovs Second Method
 Chapter 9.7: Periodic Solutions and Limit Cycles
 Chapter 9.8: Chaos and Strange Attractors: The Lorenz Equations
Elementary Differential Equations and Boundary Value Problems 9th Edition  Solutions by Chapter
Full solutions for Elementary Differential Equations and Boundary Value Problems  9th Edition
ISBN: 9780470383346
Elementary Differential Equations and Boundary Value Problems  9th Edition  Solutions by Chapter
Get Full SolutionsSince problems from 75 chapters in Elementary Differential Equations and Boundary Value Problems have been answered, more than 8319 students have viewed full stepbystep answer. Elementary Differential Equations and Boundary Value Problems was written by and is associated to the ISBN: 9780470383346. This textbook survival guide was created for the textbook: Elementary Differential Equations and Boundary Value Problems, edition: 9. This expansive textbook survival guide covers the following chapters: 75. The full stepbystep solution to problem in Elementary Differential Equations and Boundary Value Problems were answered by , our top Math solution expert on 03/13/18, 08:22PM.

Associative Law (AB)C = A(BC).
Parentheses can be removed to leave ABC.

CayleyHamilton Theorem.
peA) = det(A  AI) has peA) = zero matrix.

Characteristic equation det(A  AI) = O.
The n roots are the eigenvalues of A.

Column space C (A) =
space of all combinations of the columns of A.

Commuting matrices AB = BA.
If diagonalizable, they share n eigenvectors.

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.

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

Left inverse A+.
If A has full column rank n, then A+ = (AT A)I AT has A+ A = In.

Left nullspace N (AT).
Nullspace of AT = "left nullspace" of A because y T A = OT.

Linearly dependent VI, ... , Vn.
A combination other than all Ci = 0 gives L Ci Vi = O.

Orthogonal subspaces.
Every v in V is orthogonal to every w in W.

Rank one matrix A = uvT f=. O.
Column and row spaces = lines cu and cv.

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

Schwarz inequality
Iv·wl < IIvll IIwll.Then IvTAwl2 < (vT Av)(wT Aw) for pos def 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!

Skewsymmetric matrix K.
The transpose is K, since Kij = Kji. Eigenvalues are pure imaginary, eigenvectors are orthogonal, eKt is an orthogonal matrix.

Spectrum of A = the set of eigenvalues {A I, ... , An}.
Spectral radius = max of IAi I.

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

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

Vandermonde matrix V.
V c = b gives coefficients of p(x) = Co + ... + Cn_IXn 1 with P(Xi) = bi. Vij = (Xi)jI and det V = product of (Xk  Xi) for k > i.