Easy ODE to solve using frobenius method help?

  • Context: Graduate 
  • Thread starter Thread starter razoribbon
  • Start date Start date
  • Tags Tags
    Frobenius Method Ode
Click For Summary

Discussion Overview

The discussion revolves around solving a second-order ordinary differential equation (ODE) using the Frobenius method. Participants explore the steps involved in applying this method to the equation and clarify its application in the context of series solutions.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant presents the ODE and requests assistance with the Frobenius method steps.
  • Another participant outlines a series of steps to solve the homogeneous equation and suggests finding an indicial equation.
  • A participant questions whether the Frobenius method is solely for asymptotic solutions, implying a misunderstanding of its purpose.
  • Another participant clarifies that the Frobenius method is indeed about finding series solutions at regular singular points.
  • A later reply provides a detailed substitution of series into the original equation and simplifies it, questioning if the only solution is c = 0.
  • One participant confirms the correctness of the previous steps and notes that the indicial equation has a double root at c = 0, suggesting further reading on double roots in the Frobenius method.

Areas of Agreement / Disagreement

There is some agreement on the steps involved in applying the Frobenius method, but there is also a disagreement regarding its interpretation and application, particularly concerning asymptotic solutions versus series solutions.

Contextual Notes

The discussion includes assumptions about the nature of the solutions and the conditions under which the Frobenius method is applicable. The implications of the double root in the indicial equation are also noted but not fully resolved.

razoribbon
Messages
2
Reaction score
0
I can't seem to figure this one out:

y'' + (1/x)*y' -c*y = -c*y0

where c is just a constant.

if someone could please go through the steps of the frobenius method, i would really appreciate it!

thanks.
 
Physics news on Phys.org
Step 1: Since the constant solution, y= cy0 for all x, is clearly a solution you can solve the homogeneous equation y''+ (1/x)y'- cy= 0 and add cy0.

Step 2: Multiply that equation by x to get xy''+ y'- cxy= 0.

Step 3: Write
[tex]y= \sum_{n=0}^\infty a_nx^{n+c}[/itex]<br /> differentiate term by term to find y' and y'' and substitute into that equation.<br /> <br /> Step 4: Look just at the terms having lowest power of x. That should be a quadratic equation in c times a<sub>0</sub>. Assume that [itex]a_0\ne 0[/itex] so that the coefficient must be 0 and solve that "indicial equation" for two values of c.<br /> <br /> Step 5: Put each of those values of c into your equation in turn to find two independent solutions to the homogeneous equation. Setting each coefficient of x to a power to 0, you will get a recursive equation for a<sub>n</sub>.[/tex]
 
i thought frobenius method was to look at the asymptotic solutions? halls what explained was simply how find a series solution?
 
thank you for such a clear response!

these are my steps:
[tex] y = \sum_{n=0}^{\infty} a_{n}x^{n + c}[/tex]
[tex] \frac{dy}{dx} = \sum_{n=0}^\infty (n + c)a_{n}x^{n + c -1}[/tex]
[tex] \frac{d^{2}y}{dx^{2}} = \sum_{n=0}^{\infty} (n + c)(n + c -1)a_{n}x^{n + c - 2}[/tex]

now i substitute them into the original equation multiplied by x:

[tex] \sum_{n=0}^{\infty} (n + c)(n + c -1)a_{n}x^{n + c -1} + (n + c)a_{n}x^{n + c -1} - {\alpha}a_{n}x^{n + c + 1} = 0[/tex]

the first two terms have the same power of x, so the equation can be simplified:

[tex] \sum_{n=0}^{\infty} (n + c)^{2}a_{n}x^{n + c - 1} - {\alpha}a_{n}x^{n + c + 1} = 0[/tex]

does this mean that the only solution is c = 0? have i done the right things so far?

thanks for your help!
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
6K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 5 ·
Replies
5
Views
16K