×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide

Solutions for Chapter 5.6: Series Solutions Near a Regular Singular Point, Part II

Full solutions for Elementary Differential Equations and Boundary Value Problems | 9th Edition

ISBN: 9780470383346

Solutions for Chapter 5.6: Series Solutions Near a Regular Singular Point, Part II

Solutions for Chapter 5.6
4 5 0 321 Reviews
22
3
Textbook: Elementary Differential Equations and Boundary Value Problems
Edition: 9
Author: Boyce, Richard C. DiPrima
ISBN: 9780470383346

Chapter 5.6: Series Solutions Near a Regular Singular Point, Part II includes 21 full step-by-step solutions. This textbook survival guide was created for the textbook: Elementary Differential Equations and Boundary Value Problems, edition: 9. Elementary Differential Equations and Boundary Value Problems was written by and is associated to the ISBN: 9780470383346. Since 21 problems in chapter 5.6: Series Solutions Near a Regular Singular Point, Part II have been answered, more than 13261 students have viewed full step-by-step solutions from this chapter. This expansive textbook survival guide covers the following chapters and their solutions.

Key Math Terms and definitions covered in this textbook
  • Cofactor Cij.

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

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

  • Cramer's Rule for Ax = b.

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

  • Elimination.

    A sequence of row operations that reduces A to an upper triangular U or to the reduced form R = rref(A). Then A = LU with multipliers eO in L, or P A = L U with row exchanges in P, or E A = R with an invertible E.

  • Fundamental Theorem.

    The nullspace N (A) and row space C (AT) are orthogonal complements in Rn(perpendicular from Ax = 0 with dimensions rand n - r). Applied to AT, the column space C(A) is the orthogonal complement of N(AT) in Rm.

  • Gauss-Jordan method.

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

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

  • Linearly dependent VI, ... , Vn.

    A combination other than all Ci = 0 gives L Ci Vi = O.

  • Normal matrix.

    If N NT = NT N, then N has orthonormal (complex) eigenvectors.

  • Plane (or hyperplane) in Rn.

    Vectors x with aT x = O. Plane is perpendicular to a =1= O.

  • Polar decomposition A = Q H.

    Orthogonal Q times positive (semi)definite H.

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

    Column and row spaces = lines cu and cv.

  • Rank r (A)

    = number of pivots = dimension of column space = dimension of row space.

  • Singular matrix A.

    A square matrix that has no inverse: det(A) = o.

  • Spanning set.

    Combinations of VI, ... ,Vm fill the space. The columns of A span C (A)!

  • Standard basis for Rn.

    Columns of n by n identity matrix (written i ,j ,k in R3).

  • Subspace S of V.

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

  • Toeplitz matrix.

    Constant down each diagonal = time-invariant (shift-invariant) filter.

  • Tridiagonal matrix T: tij = 0 if Ii - j I > 1.

    T- 1 has rank 1 above and below diagonal.

×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide
×
Reset your password