Series solutions - higher order differential equations, Programming Languages

Assignment Help:

The idea of this section is not to do anything new along with a series solution problem.  Instead this is here to exemplify that moving in a higher order differential equation does not actually change the process outside of making this a little longer.

Back into the Series Solution section we only looked at 2nd order differential equations therefore we're going to do a quick illustration here involving a 3rd order differential equation thus we can ensure and say that we've done at least one illustration with an order larger than 2.

Example1: Determine the series solution around x0 = 0 for the following differential equation.

y''' + x2 y' + xy = 0

Recall that we can only find a series solution about x0 = 0 if that point is an ordinary point, or say as, if the coefficient of the highest derivative term is not zero on x0  = 0.  It is clearly the case now thus let's start with the form of the solutions and also the derivatives which we'll require for this solution.

408_SERIES SOLUTIONS.png

Plugging in the differential equation provides,

1500_SERIES SOLUTIONS1.png

This time, move all the coefficients in the series and do suitable shifts hence all the series are in terms of xn.

2143_SERIES SOLUTIONS2.png

Subsequently, let's notice that we can create the second series at n = 1 as that term will be zero. Therefore let's do that and after that we can combine the second and third terms to find,

700_SERIES SOLUTIONS3.png

Therefore, we got a simple simplification into the new series that will assist with some additional simplification. The new second series can currently be started at n = 0 and after that combined with the first series to find,

2218_SERIES SOLUTIONS4.png

We can here set the coefficients equivalent to find a fairly simply recurrence relation.

(n + 3)(n + 2)(n + 1)an+3 + nan-1 = 0,                 n = 0,1,2,...

Solving the recurrence relation provides,

an+3 = (-nan-1)/((n +1) (n + 2) (n + 3)),                                      n = 0,1,2,...

Now we require starting plugging into values of n and it will be one of the major areas where we can notice a somewhat important increase in the amount of work needed when moving in a higher order differential equation.

n = 0: a3 = 0

n = 1: a4 = -a0/(2x 3x 4)

n = 2: a5 = -2a1/(3x 4 x 5)

n = 3: a6 = -3a2/(4 x 5 x 6)

n = 4: a7 = -4a3/(5 x 6 x 7)

n = 5: a8 = -5a4/( 6 x 7 x 8) = 5 a0/(2x 3x 4 x 5 x6 x 7 x 8)

n = 6: a9 = -6a5/( 7 x 8 x 9) = (2 x 6 x a1)/(3x 4 x 5 x6 x 7 x 8 x 9)

n = 7: a10 = -7a6/(8 x 9 x 10) = (3 x 7 x a2)/(4 x 5 x6 x 7 x 8 x 9 x 10)

n = 8: a11 = -8a7/(9 x 10 x 11) = 0

n = 9: a12 = -9a8/(10 x 11 x 12) = (-(5 x 9 x a0))/(2 x 3 x 4 x 5 x6 x 7 x 8 x 9 x 10 x 11 x 12)

n = 10: a13 = -10a9/(11 x 12 x 13) = (-(2 x 6 x 10 x a1))/(3 x 4 x 5 x6 x 7 x 8 x 9 x 10 x 11 x 12 x 13)

n = 11: a14 = -11a10/(12 x 13 x 14) = (-(3 x 7 x 11 x a2))/(4 x 5 x6 x 7 x 8 x 9 x 10 x 11 x 12 x 13 x 14)

Okay, we can here break the coefficients down in 4 sub cases specified by a4k, a4k+1, a4k+2 and a4k+3  for k = 0,1, 2, 3,?  We'll give a semi-detailed derivation for a4k and after that leave the remain to you with only couple of comments like they are nearly the same derivations.

First see that all the a4k terms have a0 in them and they will optional in sign. Next see that we can turn the denominator in a factorial, (4k!) to be exact, if we multiply top and bottom through the numbers which are already in the numerator and thus it will turn these numbers in squares.  Next see that the product in the top will create at 1 and rise by 4 till we reach 4k - 3.  Therefore, taking all of that in account we find,

a4k = ((-1)k (1)2(5)2.....(4k -3)2a0)/(4k)!

Here k = 1,2,3...

And see that this will only work starting along with k = 1 as we won't find a0 out of this formula as we must by plugging in k = 0.

Here, for a4k +1 the derivation is almost same and hence the formula is,

a4k+1 = ((-1)k (2)2(6)2.....(4k -2)2a1)/(4k + 1)!

Here k = 1,2,3...

and again see that this was not work for k = 0

The formula for a4k+2 is again nearly same except for this one see that we also require to multiply top and bottom with a2 in order to find the factorial to seem in the denominator and thus the formula here is,

a4k+2 = (2(-1)k (3)2(7)2.....(4k -2)2a2)/(4k + 2)!

Here k = 1,2,3...

Noticing even one more time that it won't work for k = 0. At last, we have a4k +3 = 0 for k = 0,1, 2, 3,...

Now that we contain all the coefficients let's find the solution,

551_SERIES SOLUTIONS5.png

Collecting up the terms which contain identical coefficient (excluding for the first one in each case as the formula won't work for such) and writing all things as a set of series provides us our solution,

581_SERIES SOLUTIONS6.png

Therefore, there we have this. As we can notice the work in finding formulas for the coefficients was a bit messy since we had three formulas to find, but individually they were not as bad as even several of them could be when dealing with 2nd order differential equations. Also note that while we found lucky with such problem and we were capable to find general formulas for the terms the higher the order the less likely this will turn into.


Related Discussions:- Series solutions - higher order differential equations

Write your own version of the strcmp function string_compare, Write your ow...

Write your own version of the strcmp function string_compare. Supply a main program that will test each of the 3 differing outcomes. int string_compare(char *s, cha

Silver light uses wpf to provide included web handles, Silver light uses WP...

Silver light uses WPF to provide included web handles Microsoft Technologies Silverlight uses WPF to provide included web handles similar to Adobe Display, but with more focus on a

CGI mailer Script, i neeed an CGI Script that send mass emails i need this...

i neeed an CGI Script that send mass emails i need this input fields Sender Name: Sender Email: Subject: Message: choose (HTML Or text ) , by default HTML Emails and send bu

Write a program to decrypt encrypted messages, You are working for a crypto...

You are working for a cryptography department, where one of your jobs is to decipher intercepted messages that have been encrypted using a book cipher. The messages are sent by dif

Write use case description for the process, The following is the process an...

The following is the process an account holder of eBroker, a discount online brokerage firm, uses to sell stocks.  The user first logs in by entering the username and password.

Define functions with no arguments and no return values, Define Functions w...

Define Functions with no arguments and no return values? When a function has no arguments it doesn't receive any data from the calling function. Likewise, it doesn't return any

Discuss about wap architecture, Question 1 How to call a WML Script from a...

Question 1 How to call a WML Script from a WML Page? Question 2 Write short notes on WML Script Operators and Expressions Question 3 Write short notes on WML Script Statements

Russian peasant, This is Python program I am stuck Modify the Russian peas...

This is Python program I am stuck Modify the Russian peasant multiplication mod n function from class to perform "Russian peasant exponentiation" instead. You can assume that you

Determine that the processes are iterative or recursive, Each of the follow...

Each of the following two procedures defines a method for adding two positive integers in  terms of the procedures inc, which increments its argument by 1, and dec, which decrement

Asp.net support for ajax and javascript intellisense, ASP.NET Support for A...

ASP.NET Support for AJAX and JavaScript IntelliSense IntelliSense for Enthusiasm JScript makes it accessible client-script selection components in the value manager in Vision Facil

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd