Solve Frobenius Method Homework: x(1-x)y''+2(1-2x)y'-2y=0

In summary, the conversation is about solving a problem using Frobenius method and finding the roots of an indicial equation. The person has tried using iterations to express a_k in terms of a_0, but there is no closed form expression for that product.
  • #1
Telemachus
835
30

Homework Statement


Hi. Well, I need some help with this problem. I have to solve

[tex]x(1-x)y''+2(1-2x)y'-2y=0[/tex] (1)

Using Frobenius method around zero. So proposing [tex]y=\Sigma_{n=0}^\infty a_n x^{n+\alpha}[/tex], differentiating and replacing in (1):

[tex]x(1-x)y''+2(1-2x)y'-2y=[/tex]

[tex]=\Sigma_{n=0}^\infty a_n(n+\alpha)(n+\alpha-1)x^{n+\alpha-1}- \Sigma_{n=0}^\infty a_n(n+\alpha)(n+\alpha-1)x^{m+\alpha} + 2 \Sigma_{n=0}^\infty a_n(n+\alpha)x^{n+\alpha-1} -4 \Sigma_{n=0}^\infty a_n(n+\alpha)x^{n+\alpha}-2 \Sigma_{n=0}^\infty a_n n^{n+\alpha}=0[/tex]

Regrouping and working a little bit this becomes:

[tex]a_0\alpha(\alpha+1)+\Sigma_{n=1}^\infty a_n(n+\alpha)(n+\alpha+1)x^{n+\alpha-1}- \Sigma_{n=0}^\infty a_n [(n+\alpha)^2+2]x^{n+\alpha}[/tex]
I think this is fine, because the indicial equation I get gives the same roots from the other method: [tex]\alpha(\alpha-1)+p_0\alpha+q_0=0[/tex]

Then [tex]\alpha_1=0,\alpha_2=-1[/tex]

So I have:
[tex]a_0\alpha(\alpha+1)+\Sigma_{n=0}^\infty a_{n+1}(n+\alpha+1)(n+\alpha+2)x^{n+\alpha}- \Sigma_{n=0}^\infty a_n [(n+\alpha)^2+2]x^{n+\alpha}[/tex]

And then [tex]a_{n+1}(n+\alpha+1)(n+\alpha+2)-a_n[(n+\alpha)^2+2]=0]
So for [tex]\alpha_1=0[/tex]

[tex]a_{n+1}=\frac{a_n[n^2+2]}{(n+1)(n+2)}[/tex]

The thing is I've tried some iterations but I can't get a expression for [tex]a_k[/tex] in terms of [tex]a_0[/tex]. How should I do this?
 
Physics news on Phys.org
  • #2
[tex] a_k = a_0 \left(\frac{a_k}{a_{k-1}} \cdot \frac{a_{k-1}}{a_{k-2}} \cdots \frac{a_2}{a_1} \cdot \frac{a_1}{a_0} \right) = \frac{(k-1)^2+2}{k(k+1)} \cdot \frac{ (k-2)^2+2}{(k-1)(k-2)} \cdots \frac{ 1^2+2}{2\cdot 3} \cdot \frac{0^2+2}{1\cdot 2} = a_0 \frac{ \prod_{m=0}^{k-1} m^2+2 }{k! (k+1)! } [/tex]. There is no closed form expression for that product, so that's the best you can get.
 
  • #3
Haha thank you verymuch :)

Maybe I've made some mistake
 

FAQ: Solve Frobenius Method Homework: x(1-x)y''+2(1-2x)y'-2y=0

What is the Frobenius method?

The Frobenius method is a technique used to solve second-order linear differential equations with variable coefficients. It involves assuming a series solution and using a recurrence relation to find the coefficients of the series.

How do you apply the Frobenius method to solve a differential equation?

To apply the Frobenius method, we first rewrite the differential equation in standard form, where the highest derivative term has a coefficient of 1. Then, we assume a series solution of the form y(x) = Σn=0 ∞ an(x-x0)n, where x0 is an arbitrary point. Finally, we substitute the series into the differential equation and solve for the coefficients using a recurrence relation.

What is the process for solving "x(1-x)y''+2(1-2x)y'-2y=0" using the Frobenius method?

To solve this differential equation using the Frobenius method, we first rewrite it in standard form as y'' + (2-3x)/x y' - 2/y = 0. Then, we assume a series solution y(x) = Σn=0 ∞ anxn and substitute it into the differential equation. After solving for the coefficients using a recurrence relation, we can rewrite the series solution in the form of a power series and find the values of x for which the series converges.

What is the recurrence relation used in the Frobenius method?

The recurrence relation used in the Frobenius method is an equation that relates the coefficients of the series solution to each other. It is usually obtained by substituting the series solution into the differential equation and solving for the coefficients one by one.

What are the limitations of the Frobenius method?

The Frobenius method can only be used to solve linear differential equations with variable coefficients. It may also fail to produce a solution if the series solution does not converge or if the recurrence relation has no solution. Additionally, the method may lead to complex-valued solutions, which may not be physically meaningful in certain situations.

Back
Top