Frobenius method and Euler equations

Click For Summary

Homework Help Overview

The discussion revolves around finding a particular solution to the second-order homogeneous linear differential equation \( x^2y'' + xy' - y = 0 \), which is identified as an Euler equation. The original poster attempts to use the Frobenius method and perform a power series expansion, noting that \( x = 0 \) is a regular singular point.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the application of the Frobenius method, focusing on the need to determine the value of \( \sigma \) from the indicial equation. There is an exploration of how to derive a recurrence relation for the coefficients \( a_n \) in the power series expansion.

Discussion Status

Some participants have provided guidance on the importance of solving for \( \sigma \) and have identified the indicial equation. There is a recognition of the need to find an expression for \( a_n \), with ongoing exploration of the implications of the derived equations.

Contextual Notes

The original poster expresses confusion regarding the application of the Frobenius method to Euler equations and notes a lack of terms involving \( a_{n-1} \) in their derived expression, which is a point of concern in their approach.

Pablo815
Messages
3
Reaction score
0
Hi,

I'm having trouble with this one.

Homework Statement



Find a particular solution of the second-order homogeneous lineal differential equation

x^2y'' + xy' - y = 0

taking in account that x = 0 is a regular singular point and performing a power series expansion.

Homework Equations



x^2y'' + xy' - y = 0

The Attempt at a Solution



I see that the equation given is an Euler equation, but the question asks for a power series solution, so i tried with the Frobenius method. Assuming there is at least one solution with the form y = x^\sigma\sum{a_nx^n}.

First, I divide the whole differential equation by x^2. Then I substitute the expression above so I get

\sum{(n+\sigma)(n+\sigma-1)a_nx^{n+\sigma-2}} + \frac{1}{x}\sum{(n+\sigma)a_nx^{n+\sigma-1}}-\frac{1}{x^2}\sum{a_nx^{n+\sigma}}

And now, dividing by x^{\sigma-2}, I get

\sum{((n+\sigma)(n+\sigma-1)+(n+\sigma) - 1})a_nx^n

Now I don't know how to find the recurrence relation I'm looking for in order to find the form of a_n. In all the examples I've been able to find, in the last expression one always finds terms of a_{n-1}, for example, but here I don't know how to continue.

Did I do something wrong? I tried to follow the steps given in my textbook. I'm confused because I believe the equation given fits the requeriments needed in order to the Frobenius method to be applicable, but this happens to me every time I try to solve an Euler equation using it.

Thank you very much in advance.
 
Physics news on Phys.org
You have overlooked an important step. You haven't solved for \sigma. A general power series can start at any power of n but if that power is larger than 0, we can always factor out a power of x, x^{\sigma} so that our sum does start with a non-zero a_n term. Taking the very first term, the n= 0 term, we get the "indicial equation" to solve for \sigma. What must \sigma b in order that a_0\ne 0?
 
HallsofIvy said:
You have overlooked an important step. You haven't solved for \sigma. A general power series can start at any power of n but if that power is larger than 0, we can always factor out a power of x, x^{\sigma} so that our sum does start with a non-zero a_n term. Taking the very first term, the n= 0 term, we get the "indicial equation" to solve for \sigma. What must \sigma b in order that a_0\ne 0?

So the indicial equation is

\sigma^2 - 1 = 0

For which I get \sigma = \pm 1

So one of the solutions would have the form y = x\sum{a_nx^n}. But I still don't know how to find an appropriate expression for a_n.
 
Pablo815 said:
So the indicial equation is

\sigma^2 - 1 = 0

For which I get \sigma = \pm 1

So one of the solutions would have the form y = x\sum{a_nx^n}. But I still don't know how to find an appropriate expression for a_n.

For ##n \geq 1## you need
((n+\sigma)(n+\sigma-1)+(n+\sigma) - 1)a_n = 0
What does this tell you?
 
  • Like
Likes   Reactions: 1 person
Ray Vickson said:
For ##n \geq 1## you need
((n+\sigma)(n+\sigma-1)+(n+\sigma) - 1)a_n = 0
What does this tell you?

Oh, I think I see it. For n>1 the left term is not going to vanish, so, would it be a_n = 0 for all n>1?
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
Replies
8
Views
2K
Replies
13
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K