 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: FirstOrder Differential Equations
 Chapter 2.1: Linear Differential Equations; Method of Integrating Factors
 Chapter 2.2: Separable Differential Equations
 Chapter 2.3: Modeling with FirstOrder Differential Equations
 Chapter 2.4: Differences Between Linear and Nonlinear Differential Equations
 Chapter 2.5: Autonomous Differential Equations and Population Dynamics
 Chapter 2.6: Exact Differential Equations and Integrating Factors
 Chapter 2.7: Numerical Approximations: Eulers Method
 Chapter 2.8: The Existence and Uniqueness Theorem
 Chapter 2.9: FirstOrder Difference Equations
 Chapter 3.1: Homogeneous Differential 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 Periodic Vibrations
 Chapter 4.1: General Theory of nth Order
 Chapter 4.2: Homogeneous Differential 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: Matrices
 Chapter 7.3: Systems of Linear Algebraic Equations; Linear Independence, Eigenvalues, Eigenvectors
 Chapter 7.4: Basic Theory of Systems of FirstOrder Linear Equations
 Chapter 7.5: Homogeneous Linear Systems with Constant Coefficients
 Chapter 7.6: ComplexValued 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: Systems of FirstOrder Equations
 Chapter 8.6: More on Errors; Stability
 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: Predator  Prey 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 11th Edition  Solutions by Chapter
Full solutions for Elementary Differential Equations and Boundary Value Problems  11th Edition
ISBN: 9781119256007
Elementary Differential Equations and Boundary Value Problems  11th Edition  Solutions by Chapter
Get Full SolutionsThis expansive textbook survival guide covers the following chapters: 75. This textbook survival guide was created for the textbook: Elementary Differential Equations and Boundary Value Problems, edition: 11. Elementary Differential Equations and Boundary Value Problems was written by Patricia and is associated to the ISBN: 9781119256007. The full stepbystep solution to problem in Elementary Differential Equations and Boundary Value Problems were answered by Patricia, our top Math solution expert on 03/13/18, 08:17PM. Since problems from 75 chapters in Elementary Differential Equations and Boundary Value Problems have been answered, more than 4167 students have viewed full stepbystep answer.

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

Circulant matrix C.
Constant diagonals wrap around as in cyclic shift S. Every circulant is Col + CIS + ... + Cn_lSn  l . Cx = convolution c * x. Eigenvectors in F.

Free variable Xi.
Column i has no pivot in elimination. We can give the n  r free variables any values, then Ax = b determines the r pivot variables (if solvable!).

Hessenberg matrix H.
Triangular matrix with one extra nonzero adjacent diagonal.

Identity matrix I (or In).
Diagonal entries = 1, offdiagonal entries = 0.

lAII = l/lAI and IATI = IAI.
The big formula for det(A) has a sum of n! terms, the cofactor formula uses determinants of size n  1, volume of box = I det( A) I.

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.

Markov matrix M.
All mij > 0 and each column sum is 1. Largest eigenvalue A = 1. If mij > 0, the columns of Mk approach the steady state eigenvector M s = s > 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 .

Nilpotent matrix N.
Some power of N is the zero matrix, N k = o. The only eigenvalue is A = 0 (repeated n times). Examples: triangular matrices with zero diagonal.

Permutation matrix P.
There are n! orders of 1, ... , n. The n! P 's have the rows of I in those orders. P A puts the rows of A in the same order. P is even or odd (det P = 1 or 1) based on the number of row exchanges to reach I.

Plane (or hyperplane) in Rn.
Vectors x with aT x = O. Plane is perpendicular to a =1= O.

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.

Pseudoinverse A+ (MoorePenrose inverse).
The n by m matrix that "inverts" A from column space back to row space, with N(A+) = N(AT). A+ A and AA+ are the projection matrices onto the row space and column space. Rank(A +) = rank(A).

Right inverse A+.
If A has full row rank m, then A+ = AT(AAT)l has AA+ = 1m.

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

Spectral Theorem A = QAQT.
Real symmetric A has real A'S and orthonormal q's.

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

Wavelets Wjk(t).
Stretch and shift the time axis to create Wjk(t) = woo(2j t  k).
I don't want to reset my password
Need help? Contact support
Having trouble accessing your account? Let us help you, contact support at +1(510) 9441054 or support@studysoup.com
Forgot password? Reset it here