×
×

# Solutions for Chapter 11.2: Greens Functions for Wave and Heat Equations

## Full solutions for Applied Partial Differential Equations with Fourier Series and Boundary Value Problems | 5th Edition

ISBN: 9780321797056

Solutions for Chapter 11.2: Greens Functions for Wave and Heat Equations

Solutions for Chapter 11.2
4 5 0 308 Reviews
10
3
##### ISBN: 9780321797056

Applied Partial Differential Equations with Fourier Series and Boundary Value Problems was written by and is associated to the ISBN: 9780321797056. This textbook survival guide was created for the textbook: Applied Partial Differential Equations with Fourier Series and Boundary Value Problems, edition: 5. This expansive textbook survival guide covers the following chapters and their solutions. Chapter 11.2: Greens Functions for Wave and Heat Equations includes 15 full step-by-step solutions. Since 15 problems in chapter 11.2: Greens Functions for Wave and Heat Equations have been answered, more than 8080 students have viewed full step-by-step solutions from this chapter.

Key Math Terms and definitions covered in this textbook
• Basis for V.

Independent vectors VI, ... , v d whose linear combinations give each vector in V as v = CIVI + ... + CdVd. V has many bases, each basis gives unique c's. A vector space has many bases!

• Cofactor Cij.

Remove row i and column j; multiply the determinant by (-I)i + j •

• Cramer's Rule for Ax = b.

B j has b replacing column j of A; x j = det B j I det A

• 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

• Diagonal matrix D.

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

• Dimension of vector space

dim(V) = number of vectors in any basis for V.

• Gauss-Jordan method.

Invert A by row operations on [A I] to reach [I A-I].

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

• Hilbert matrix hilb(n).

Entries HU = 1/(i + j -1) = Jd X i- 1 xj-1dx. Positive definite but extremely small Amin and large condition number: H is ill-conditioned.

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

• Kronecker product (tensor product) A ® B.

Blocks aij B, eigenvalues Ap(A)Aq(B).

• Left inverse A+.

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

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

• Rank one matrix A = uvT f=. O.

Column and row spaces = lines cu and cv.

• Right inverse A+.

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

• Rotation matrix

R = [~ CS ] rotates the plane by () and R- 1 = RT rotates back by -(). Eigenvalues are eiO and e-iO , 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!

• Triangle inequality II u + v II < II u II + II v II.

For matrix norms II A + B II < II A II + II B II·

• Wavelets Wjk(t).

Stretch and shift the time axis to create Wjk(t) = woo(2j t - k).

×