Linearly Independent Solutions[help please]

Click For Summary
SUMMARY

The discussion focuses on finding two linearly independent solutions for the differential equation xy'' + y = 0, specifically for x > 0. The participant initially attempts to use a power series approach, expressing the solution as a summation of a_n x^n. However, they learn that due to the singular point at x = 0, they cannot express both independent solutions as power series. Instead, the Frobenius method is recommended, leading to the conclusion that one solution will involve a logarithmic term, specifically ln(x) times the first solution.

PREREQUISITES
  • Understanding of differential equations, particularly second-order linear equations.
  • Familiarity with power series and their convergence.
  • Knowledge of the Frobenius method for solving differential equations.
  • Concept of singular points in differential equations.
NEXT STEPS
  • Study the Frobenius method in detail, including its application to singular points.
  • Learn about the indicial equation and its significance in determining solutions.
  • Explore logarithmic solutions in differential equations and their implications.
  • Practice solving second-order linear differential equations with singular points.
USEFUL FOR

Students of advanced engineering mathematics, particularly those studying differential equations, as well as educators and tutors looking to deepen their understanding of power series solutions and singular points.

jezznar
Messages
3
Reaction score
0
1. Homework Statement
Find two linearly independent solutions valid for x>0

xy''+y=02. Homework Equations
well first of all, all the solutions that i get to see in the forums is interms of the euler formula.. but in the course that I am taking(advanced engineering mathematics), it is expressed using a power formula... can anyone please teach me how to do this?..3. The Attempt at a Solution

y = Summation of (a_n)(x^n) n=0 -> infinity
y'' = Summation of (n)(n-1)(a_n)(x^[n-2]) n=0 -> infinity // so yeah just differentiation

*substituting it to the equation

= [ Summation of (n)(n-1)(a_n)(x^[n-1]) n=0 -> infinity ] + [Summation of (a_n)(x^n) n=0 -> infinity]

*shifting the y equation to achieve same degree of x
= [ Summation of (n)(n-1)(a_n)(x^[n-1]) n=0 -> infinity ] + [Summation of (a_[n-1] )(x^[n-1]) n=1 -> infinity]

*getting the recurrence releationship


a_2k = [-1]^k a_1 / 2k! [2k-1]!


a_[2k+1] =[-1]^k a_1 / [2k+1]![2k]!

*now substituting it to a power series formula

y= a_0 + [ SUmmation of [a_2k] x^2k k=1 -> infinity ] + a_1 x + [ Summation of a_[2k+1] x^[2k+1] k=1 -> infinity ] +...

*now after that I really don't know how to obtain the two linearly independent solutions.. can someone enlighten me?.. did I even do this right? =[

any help will be very much appreciated...
 
Last edited:
Physics news on Phys.org
Well, actually you can't get this "in terms of Euler's formula" if you are thinking of the formulas for solving "Euler type" equations because this is not. If the coefficient of y" were x2 then it would be.

I'm afraid you aren't going to like the answer! x=0 is a singular point because the coefficient of y" becomes 0. Generally, speaking you CANNOT write both independent solutions as power series.

You can use Frobenious' method: write
[tex]y(x)= \sum_{n=0}^{\infty} a_n x^{n+ c}[/tex]
where c is a constant which may not be positive or even an integer.
Now we get
[tex]y"= \sum_{n=0}^{\infty} (n+c)(n+c-1)a_n x^{n+c-1}[/tex]
and the equation becomes
[tex]y"+ y= \sum_{n=0}^{\infty} (n+c)(n+c-1)a_n x^{n+c-1}+ \sum_{n=0}^{\infty} a_n x^{n+ c}= 0[/itex]<br /> If we look for the lowest possible power of x, we see that taking n=0 in each sum gives x<sup>c-1</sup> in the first sum and x<sup>c</sup> in the second. So the lowest possible power of x is x<sup>c-1</sup> and its coefficient is c(c-1)a<sub>0</sub>. Since the sum itself is 0, all coefficients of powers of x must be 0 so we have c(c-1)a<sub>0</sub>= 0. Now there is an "ambiguity" in this: we could reduce c by an integer while absorbing that constant in n and get different coefficients giving the same sum. We avoid that ambiguity by requireing that the sum actually start with n= 0- that is, that a<sub>0</sub> is not 0. Since c(c-1)a<sub>0</sub>= 0, we have the "indicial equation", c(c-1)= 0 so either c= 0 or c= 1. Taking c= 0, of course, is just a regular power series solution.<br /> <br /> Now for the part you won't like! Frobenius' theory shows that when the solutions of the indicial equation differ by an integer, the other solution cannot be written as a power series in that way. What does happen is that the second indpendent solution must be ln(x) times the first![/tex]
 
Last edited by a moderator:
i see... hmmmm... now i get why I can't solve for anything... I guess I need to start all over again and restudy these type of problems and plugin "indicial equations."

Thank you very much hallsofivy!

//edit:
oh my, I think I'm starting to get this. :) thank you very much! I'll try to post my solution when I get back from school.. thankiez again :)
 
Last edited:

Similar threads

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