← Back to Math 055

6.3 Solutions About Singular Points: Class Notes

6.3a

A singular point for the equation a2(x)y″+a1(x)y′+a0(x)y=0 (*) is a point x=x0 such that a2(x0)=0. For our work with solving differential equations, we will only consider x0=0. Standard form for (*) is y″+P(x)y′+Q(x)y=0. Multiplying by x2 (or by (x−x0)2 if x0≠0) yields x2y″+x2P(x)y′+x2Q(x)y=0. By relabeling p(x)=xP(x), q(x)=x2Q(x), we get x2y″+xp(x)y′+q(x)y=0.

Definition

x=x0 is a regular singular point if p(x)=(x−x0)P(x) and q(x)=(x−x0)2Q(x) are analytic at x=x0 and an irregular singular point if either p(x) or q(x) is not analytic at x=x0.

Example

Determine the singular points of the given differential equation. Classify each singular point as regular or irregular.

(x2−9)2y″+(x+3)y′+2y=0

Solution

The leading coefficient (x2−9)2 is zero at x=3 and x=−3, so x=3,−3 are singular points.

Divide by (x2−9)2=(x+3)2(x−3)2 to get standard form:

y″+1(x+3)(x−3)2y′+2(x+3)2(x−3)2y=0

P(x)=1(x+3)(x−3)2,Q(x)=2(x+3)2(x−3)2

x=−3:

(x−(−3))P(x)=(x+3)P(x)=1(x−3)2,(x+3)2Q(x)=2(x−3)2

Both are analytic at x=−3 (their denominators are not zero there), so

Answer: x=−3 is a regular singular point.

x=3:

(x−3)P(x)=1(x+3)(x−3)

This is not analytic at x=3 (its denominator is zero there), so

Answer: x=3 is an irregular singular point.

Theorem: (Frobenius’ Theorem)

If x=x0 is a regular singular point of (*), then there is at least one solution of the form y=(x−x0)r∑n=0∞cn(x−x0)n =∑n=0∞cn(x−x0)n+r, where the number r is a constant to be determined.

For us, x0=0, so the form is

Frobenius form

y=∑n=0∞cnxn+r

The number r can be an integer or a fraction. We use this form for equations with terms like xy″ or x2y″.

6.3b

Example

x=0 is a regular singular point of the given differential equation. Show that the indicial roots of the singularity do not differ by an integer. Use the method of Frobenius to obtain two linearly independent solutions about x=0. Form the general solution on (0,∞).

2xy″+5y′+xy=0

Solution

The solutions can include fractional powers, such as c0x+c1x3/2+⋯. Write y, y′, and y″ in Frobenius form:

y=∑n=0∞cnxn+r ⇒ y′=∑n=0∞(n+r)cnxn+r−1,y″=∑n=0∞(n+r)(n+r−1)cnxn+r−2

Tip: The starting value for the index does not change with this method: every series starts at n=0.

Substitute. Multiplying by 2x and by x raises the exponents:

∑n=0∞2(n+r)(n+r−1)cnxn+r−1+∑n=0∞5(n+r)cnxn+r−1+∑n=0∞cnxn+r+1=0

Let k=n in the first two series and k=n+2 in the third, so every exponent is xk+r−1:

∑k=0∞[2(k+r)(k+r−1)+5(k+r)]ckxk+r−1+∑k=2∞ck−2xk+r−1=0

Factor out k+r: (k+r)(2k+2r−2+5)=(k+r)(2k+2r+3)

∑k=0∞(k+r)(2k+2r+3)ckxk+r−1+∑k=2∞ck−2xk+r−1=0

Write out the k=0 and k=1 terms of the first series:

r(2r+3)c0xr−1+(r+1)(2r+5)c1xr+∑k=2∞[(k+r)(2k+2r+3)ck+ck−2]xk+r−1=0

Each coefficient is zero. The term with the smallest power, xr−1, gives r(2r+3)c0=0. The first coefficient c0 is not zero, so

r(2r+3)=0(indicial equation)

r=0, −32(indicial roots)

The roots differ by 32, which is not an integer. The xr term gives (r+1)(2r+5)c1=0. For these roots (r+1)(2r+5)≠0, so c1=0.

From the remaining series, (k+r)(2k+2r+3)ck+ck−2=0. Solve for ck:

Recurrence relation

ck=−1(k+r)(2k+2r+3)ck−2,k=2,3,4,…

r=0: ck=−1k(2k+3)ck−2 (k=2,3,4,…)

k=2:c2=−12(7)c0=−114c0k=3:c3=(…)c1=0k=4:c4=−144c2=1616c0

r=−32: ck=−1(k−32)(2k)ck−2=−1(2k−3)kck−2

k=2:c2=−12c0k=3:c3=(…)c1=0k=4:c4=−120c2=140c0

Each root gives a solution with its own c0; call it C1=c0 for r=0 and C2=c0 for r=−32. The general solution is

y=C1(1−114x2+1616x4+⋯)+C2x−3/2(1−12x2+140x4+⋯)

The factor x−3/2 is the xr from the Frobenius form.

Two linearly independent solutions:

Answer: y1=1−114x2+1616x4+⋯,y2=x−3/2(1−12x2+140x4+⋯)

6.3c

The equation r(2r+3)=0 is an indicial equation and can be generalized as follows:

x=0 is a regular singular point of x2y″+xp(x)y′+q(x)y=0 if p and q are analytic at x=0. That is,

p(x)=a0+a1x+⋯,q(x)=b0+b1x+⋯

Substitute the Frobenius series:

∑n=0∞(n+r)(n+r−1)cnxn+r+(a0+a1x+⋯)∑n=0∞(n+r)cnxn+r+(b0+b1x+⋯)∑n=0∞cnxn+r=0

We want the term with the smallest power on x. That is xr, from n=0:

r(r−1)c0xr+a0rc0xr+b0c0xr=0

Divide by c0xr:

r(r−1)+a0r+b0=0(indicial equation)

where a0 is the constant of p(x) and b0 is the constant of q(x).

Example: the indicial equation from the general form

Consider 2xy″+5y′+xy=0. Multiply by x2 to put it in the form x2y″+xp(x)y′+q(x)y=0:

x2y″+52xy′+12x2y=0

p(x)=52,q(x)=12x2⇒a0=52,b0=0

r(r−1)+52r+0=0

2r(r−1)+5r=0

2r2+3r=0

r(2r+3)=0

Answer: r=0, −32

6.3d

Example

Use the method of Frobenius to obtain two linearly independent solutions about the regular singular point x=0.

9x2y″+9x2y′+2y=0

Solution

Indicial roots. Divide by 9:

x2y″+x2y′+29y=0

Matching xp(x)y′ and q(x)y:

p(x)=x ⇒ a0=0,q(x)=29 ⇒ b0=29

Indicial equation:

r(r−1)+0r+29=0

9r2−9r+2=0

(3r−1)(3r−2)=0

r=13, 23(these don’t differ by an integer)

Back to the equation. Substitute y=∑n=0∞cnxn+r:

9x2y″+9x2y′+2y=0

∑n=0∞9(n+r)(n+r−1)cnxn+r+∑n=0∞9(n+r)cnxn+r+1+∑n=0∞2cnxn+r=0

Exponents: let k=n in the first and third series and k=n+1 in the second:

∑k=0∞[9(k+r)(k+r−1)+2]ckxk+r+∑k=1∞9(k+r−1)ck−1xk+r=0

Indices: the k=0 term gives [9r(r−1)+2]c0=0, so r=13, 23, the same roots as above. For k≥1:

(9(k+r)(k+r−1)+2)ck+9(k+r−1)ck−1=0

Recurrence relation

ck=−9(k+r−1)9(k+r)(k+r−1)+2ck−1,k=1,2,3,…

r=13: ck=−3k−2k(3k−1)ck−1

k=1:c1=−12c0k=2:c2=15c0

r=23: ck=−3k−1k(3k+1)ck−1

k=1:c1=−12c0k=2:c2=528c0

With C1=c0 for the first root and C2=c0 for the second:

y=C1x1/3(1−12x+15x2+⋯)+C2x2/3(1−12x+528x2+⋯)

Answer: y1=x1/3(1−12x+15x2+⋯),y2=x2/3(1−12x+528x2+⋯)

6.3e

If r1 and r2 differ by an integer–that is, if r2−r1∈ℤ–we can use r1 to find y1 and then reduction of order to find y2.

Example

x=0 is a regular singular point of the given differential equation. Show that the indicial roots of the singularity differ by an integer. Use the method of Frobenius to obtain at least one series solution about x=0. Use reduction of order and a CAS to find a second solution. Form the general solution on (0,∞).

y″+3xy′−2y=0

Solution

Indicial roots. Multiply by x2:

x2y″+3xy′−2x2y=0

p(x)=3,q(x)=−2x2⇒a0=3,b0=0

r(r−1)+3r=0

r2+2r=0⇒r=−2, 0

The roots differ by 2, an integer.

Substitute y=∑n=0∞cnxn+r into the original equation:

∑n=0∞(n+r)(n+r−1)cnxn+r−2+∑n=0∞3(n+r)cnxn+r−2−∑n=0∞2cnxn+r=0

Combine the first two series, using

(n+r)(n+r−1)+3(n+r)=(n+r)(n+r+2)

and let k=n there and k=n+2 in the third:

∑k=0∞(k+r)(k+r+2)ckxk+r−2−∑k=2∞2ck−2xk+r−2=0

The k=0 and k=1 terms:

r(r+2)c0=0 ⇒ r=0, −2,(r+1)(r+3)c1=0 ⇒ c1=0

For k≥2:

(k+r)(k+r+2)ck−2ck−2=0,k=2,3,4,…

Recurrence relation

ck=2(k+r)(k+r+2)ck−2

r=0: ck=2k(k+2)ck−2

k=2:c2=14c0k=3:c3=215c1=0k=4:c4=148c0

r=−2: ck=2k(k−2)ck−2. At k=2 the denominator k(k−2) is zero, so this root does not give a second series solution.

From r=0 (with c0=1):

y1=1+14x2+148x4+⋯

This is the “at least one” power series solution from Frobenius’ Theorem.

Recall: reduction of order

For y″+P(x)y′+Q(x)y=0 with a known solution y1:

y2=y1∫e−∫P(x)dxy12dx

Here P(x)=3x:

e−∫P(x)dx=e−∫3xdx=e−3ln⁡x=eln⁡x−3=1x3

Tip: Move the −3 into the exponent of x (a property of logarithms), so that eln⁡u=u applies.

y2=y1∫1x3(1+14x2+148x4+⋯)2dx

Use a CAS such as WolframAlpha.com. As a series, the integrand is 1x3−12x+7x48+⋯, and

∫(1x3−12x+7x48)dx=7x296−12x2−ln⁡x2

(WolframAlpha writes ln⁡x as log(x).) So

y2=y1(796x2−12x2−12ln⁡x+⋯),y1=1+14x2+148x4+⋯

Answer: y=c1y1+c2y2