Ask Question, Ask an Expert

+61-413 786 465

info@mywordsolution.com

Ask Programming Language Expert

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.

Programming Language, Programming

  • Category:- Programming Language
  • Reference No.:- M9619237

Have any Question?


Related Questions in Programming Language

Assignment task -q1 a the fibonacci numbers are the numbers

Assignment Task - Q1. (a) The Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and are characterised by the fact that every number after the first two is the sum of the ...

Task - hand execution of arraysoverviewin this task you

Task - Hand Execution of Arrays Overview In this task you will demonstrate how arrays work by hand executing a number of small code snippets. Instructions Watch the Hand Execution with Arrays video, this shows how to ste ...

Assignment - haskell program for regular expression

Assignment - Haskell Program for Regular Expression Matching Your assignment is to modify the slowgrep.hs Haskell program presented in class and the online notes, according to the instructions below. You may carry out th ...

Structs and enumsoverviewin this task you will create a

Structs and Enums Overview In this task you will create a knight database to help Camelot keep track of all of their knights. Instructions Lets get started. 1. What the topic 5 videos, these will guide you through buildi ...

Task silly name testeroverviewcontrol flow allows us to

Task: Silly Name Tester Overview Control flow allows us to alter the order in which our programs execute. Building on our knowledge of variables, we can now use control flow to create programs that perform more than just ...

Assignment - proposal literature review research method1

Assignment - Proposal, Literature Review, Research Method 1. Abstract - Summary of the knowledge gap: problems of the existing research - Aim of the research, summary of what this project is to achieve - Summary of the a ...

Task working with arraysoverviewin this task you will

Task: Working with Arrays Overview In this task you will create a simple program which will create and work with an array of strings. This array will then be populated with values, printed out to the console, and then, w ...

Overviewthis tasks provides you an opportunity to get

Overview This tasks provides you an opportunity to get feedback on your Learning Summary Report. The Learning Summary Report outlines how the work you have completed demonstrates that you have met all of the unit's learn ...

Extend the adworks applicationi add dialogs to allow the

Extend the AdWorks application I. Add Dialogs to allow the user to Add, Edit, Read and Delete a Customer and refresh the view accordingly. 1. The user should be able to select a specific customer from the DataGrid and cl ...

Assignmentquestion onegiving the following code snippet

Assignment Question One Giving the following code snippet. What kind of errors you will get and how can you correct it. A. public class HelloJava { public static void main(String args[]) { int x=10; int y=2; System.out.p ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Why might a bank avoid the use of interest rate swaps even

Why might a bank avoid the use of interest rate swaps, even when the institution is exposed to significant interest rate

Describe the difference between zero coupon bonds and

Describe the difference between zero coupon bonds and coupon bonds. Under what conditions will a coupon bond sell at a p

Compute the present value of an annuity of 880 per year

Compute the present value of an annuity of $ 880 per year for 16 years, given a discount rate of 6 percent per annum. As

Compute the present value of an 1150 payment made in ten

Compute the present value of an $1,150 payment made in ten years when the discount rate is 12 percent. (Do not round int

Compute the present value of an annuity of 699 per year

Compute the present value of an annuity of $ 699 per year for 19 years, given a discount rate of 6 percent per annum. As