 9.6.1: For 19, use the variationofparameters technique to find a particu...
 9.6.2: For 19, use the variationofparameters technique to find a particu...
 9.6.3: For 19, use the variationofparameters technique to find a particu...
 9.6.4: For 19, use the variationofparameters technique to find a particu...
 9.6.5: For 19, use the variationofparameters technique to find a particu...
 9.6.6: For 19, use the variationofparameters technique to find a particu...
 9.6.7: For 19, use the variationofparameters technique to find a particu...
 9.6.8: For 19, use the variationofparameters technique to find a particu...
 9.6.9: For 19, use the variationofparameters technique to find a particu...
 9.6.10: Let X(t) be a fundamental matrix for the system x = A(t)x(t), where...
 9.6.11: Let X(t) be a fundamental matrix for the system x = A(t)x(t), where...
Solutions for Chapter 9.6: VariationofParameters for Linear Systems
Full solutions for Differential Equations  4th Edition
ISBN: 9780321964670
Solutions for Chapter 9.6: VariationofParameters for Linear Systems
Get Full SolutionsThis textbook survival guide was created for the textbook: Differential Equations, edition: 4. Differential Equations was written by and is associated to the ISBN: 9780321964670. Since 11 problems in chapter 9.6: VariationofParameters for Linear Systems have been answered, more than 19942 students have viewed full stepbystep solutions from this chapter. Chapter 9.6: VariationofParameters for Linear Systems includes 11 full stepbystep solutions. This expansive textbook survival guide covers the following chapters and their solutions.

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

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

Companion matrix.
Put CI, ... ,Cn in row n and put n  1 ones just above the main diagonal. Then det(A  AI) = ±(CI + c2A + C3A 2 + .•. + cnA nl  An).

Conjugate Gradient Method.
A sequence of steps (end of Chapter 9) to solve positive definite Ax = b by minimizing !x T Ax  x Tb over growing Krylov subspaces.

Eigenvalue A and eigenvector x.
Ax = AX with x#O so det(A  AI) = o.

Ellipse (or ellipsoid) x T Ax = 1.
A must be positive definite; the axes of the ellipse are eigenvectors of A, with lengths 1/.JI. (For IIx II = 1 the vectors y = Ax lie on the ellipse IIA1 yll2 = Y T(AAT)1 Y = 1 displayed by eigshow; axis lengths ad

Fibonacci numbers
0,1,1,2,3,5, ... satisfy Fn = Fnl + Fn 2 = (A7 A~)I()q A2). Growth rate Al = (1 + .J5) 12 is the largest eigenvalue of the Fibonacci matrix [ } A].

Four Fundamental Subspaces C (A), N (A), C (AT), N (AT).
Use AT for complex A.

Full row rank r = m.
Independent rows, at least one solution to Ax = b, column space is all of Rm. Full rank means full column rank or full row rank.

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.

Graph G.
Set of n nodes connected pairwise by m edges. A complete graph has all n(n  1)/2 edges between nodes. A tree has only n  1 edges and no closed loops.

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 .

Orthonormal vectors q 1 , ... , q n·
Dot products are q T q j = 0 if i =1= j and q T q i = 1. The matrix Q with these orthonormal columns has Q T Q = I. If m = n then Q T = Q 1 and q 1 ' ... , q n is an orthonormal basis for Rn : every v = L (v T q j )q j •

Partial pivoting.
In each column, choose the largest available pivot to control roundoff; all multipliers have leij I < 1. See condition number.

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.

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

Schur complement S, D  C A } B.
Appears in block elimination on [~ g ].

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

Solvable system Ax = b.
The right side b is in the column space of A.