Linear homogeneous differential equations, Programming Languages

Assignment Help:

As with 2nd order differential equations we can't determine a non-homogeneous differential equation unless we can initially solve the homogeneous differential equation. We'll also require to restrict ourselves down to constant coefficient differential equations since solving non-constant coefficient differential equations is quite hard and thus we won't be discussing them now. Similarly, we'll only be searching for linear differential equations.

Therefore, let's start off with the subsequent differential equation,

an y(n) +an y(n-1)+     .....................      +a1 y' +  a0 y = 0

 Here, suppose that solutions to this differential equation will be in the form y(t) = ert and plug that in the differential equation and along with a little simplification we find,

ert = (an rn +an r(n-1)+     .....................      +a1 r +  a0) = 0

And therefore in order for this to be zero we will require that,

an rn +an r(n-1)+     .....................      +a1 r +  a0 = 0

This is termed as the characteristic polynomial/equation and its roots/solutions will provides us the answers to the differential equation. We know that, containing repeated roots, an nth degree polynomial that we have now will have n roots. Therefore, we require going through all the possibilities which we've found for roots here.

It is where we start to notice differences in how we deal along with nth order differential equations versus 2nd order differential equations. There are even the three major cases as: real distinct roots, complex roots and repeated roots (though these can here also be repeated as we'll notice). In 2nd order differential equations all differential equations could only include one of these cases. However, now, this will not essentially be the case. We could very simply have differential equations which include each of these cases.

For illustration assume that we have an 9th order differential equation. The whole list of roots could contain 3 roots that only occur once in the list that is real distinct roots, a root with multiplicity 4 that is happens 4 times in the list and a set of complex conjugate roots (recall this since the coefficients are all real complex roots will always happen in conjugate pairs).

Therefore, for each nth order differential equation we'll require to form a set of n linearly independent functions (that is a fundamental set of solutions) in order to find a general solution. In the work which follows we'll discuss the solutions that we find from all cases but we will leave this to you to verify that while we put everything together to form a general solution which we do indeed find a fundamental set of solutions.  Recall this that we need to verify this Wronskian is not zero.

Therefore, let's get started with the work now. Let's start off through assuming that in the list of roots of the characteristic equation we contain, r1, r2,  ....   rk and they only happen once in the list. The solution from all of these will be after that,

Here is nothing really new now for real distinct roots.

Here we take a look at repeated roots. The result this time is a natural extension of the work we noticed in the 2nd order case. Let's assume that r is a root of multiplicity k (that is r happens k times in the list of roots). We will after that gets the following k solutions to the differential equation as,

ert, t ert,    ........., tk-1 ert

Therefore, for repeated roots we only add in a t for all of the solutions past the first one till we have a sum of k solutions. Again, we will leave this to you to calculate the Wronskian to verify that such are actually a set of linearly independent solutions.

At last we require dealing with complex roots. The biggest matter now is that we can here have repeated complex roots for 4th order or higher differential equations. We'll start off through assuming that r = l + mi arises only once in the list of roots. For this case we'll find the standard two solutions as,

elt cos(mt)        elt sin(mt)

Here let's assume that r = l + mi has a multiplicity of k (that is they arise k times in the list of roots). In that case we can utilize the work from the repeated roots above to find the following set of 2k complex-valued solutions,

e(l + mi)t,  t e(l + mi)t,    ........., tk-1 e(l + mi)t

e(l - mi)t,  t e(l - mi)t,    ........., tk-1 e(l - mi)t

The problem now obviously is that we really need real-valued solutions. Therefore, recall this in the case where they occurred one time all we had to do was use Euler's formulas on the first one and after that take the real and imaginary part to find two real valued solutions.  We'll do similar thing here and use Euler's formula on the first set of complex-valued solutions given above, split all one in its real and imaginary parts to get there at the following set of 2k real-valued solutions.

elt cos(mt),       elt sin(mt),        t elt cos(mt),     t elt sin(mt),     ............,

                        tk-1 elt cos(mt),             tk-1 elt sin(mt),

Once again we'll leave this to you to verify that these do actually form a fundamental set of solutions.

Before we work a couple of quick illustrations now we must point out that the characteristic polynomial is this time going to be at least a 3rd degree polynomial and determining the roots of these by hand is frequently a very hard and time consuming process and in several cases if the roots are not rational (that is in the form p) this can be almost not possible to get them all by hand. In practice though, we usually use several form of computation aid as Maple or Mathematica to get all the roots.


Related Discussions:- Linear homogeneous differential equations

Assembly language, I need help with having a user input a year, and my prog...

I need help with having a user input a year, and my program to spit out what day of the week Christmas is on.... any helping hands on this?

Define a prolog predicate flatten, Define a Prolog predicate flatten(List, ...

Define a Prolog predicate flatten(List, FlattenedList) that asserts List is any nested list of atoms and FlattenedList is the same list with the nesting removed. The atom [] should

Statistical parametric mapping, A large offshore accommodation barge is to ...

A large offshore accommodation barge is to be converted into a floating luxury hotel.  It will be connected to a single point mooring buoy (SPM) in a beautiful inland loch where th

Miranda, Hi, Can you do exercises: D2, D3, D4, and D5 on page 230 of the fo...

Hi, Can you do exercises: D2, D3, D4, and D5 on page 230 of the following book: http://www.daimi.au.dk/~bra8130/Wiley_book/wiley.html . The book can be downloaded for free from t

Explain the booch methodology, Problem 1 Explain the Booch Methodology ...

Problem 1 Explain the Booch Methodology 2 Why does every interaction diagram need a written description? Explain 3 Explain the five core workflows of the Unified Process

Shell script to check a given number is palindrome or not, Normal 0 ...

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

Creates an object and prompt the user to enter the name, Design an object d...

Design an object definition named Pet, which should have the following fields: name: The name field holds the name of a Pet type: The type field holds the type of anima

Use an insertion sort to sort an array, Use an insertion sort to sort an ar...

Use an insertion sort to sort an array (sequence) of long word integers. The size of the list will appear just before the list itself. Use the same labels as in this example: LE

C, what is the c.

what is the c.

Flowchart and Pseudocode using Control Breaks, Shemrock Inc. is a brake pad...

Shemrock Inc. is a brake pad manufacturing company. This company uses raw materials, such as carbon powder, iron, ash, and resin. It wants to develop an inventory management system

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