Prove The Recurrence Relation - Mathematics Assignment Help

Assignment Task:

Task:

Problem 1
(5 points) Consider the following integral:
In =
Z 1 0 x n x + 5
dx, n = 0, 1, 2, · · · ,

(i) Prove the recurrence relation
?
??
??
I0 = ln 1.2
In = −5In−1 +
1
n , n = 1, 2, · · · ;

(ii) Use the above recurrence to compute I1, I2, · · · , I30. (The best way to do it is to write a very short program - but it is not meant to be a programming problem, you can use a calculator to compute 30 numbers if you prefer.) Print out your answers to see if they look reasonable. If not, give an explanation.

Problem 2
(5 points) Assume we are doing arithmetics in a floating point system with base 10 and 8 digits in the mantissa. (i.e. numbers are represented as:  ?x = 0.a1, · · · , a8 · 10e .) We do not specify the lower and upper bound of the exponent, but assume they are sufficiently small and large respectively. Floating point addition is carried out in the following fashion: consider the addition of x1 = m1 · 10e1 and x2 = m2 · 10e2

, where e1 > e2. We first rewrite x2 as: x2 = (m2 · 10e2−e1 ) · 10e1

:=  ?m2 · 10e1
, where

m ?2 = m2 · 10e2−e1

is the new mantissa. Then we perform the addition, rounding the result to the closest floating point number.

With the information given above, consider the addition of the three floating point numbers:

x = 0.23371258 × 10−4
y = 0.33678429 × 102
z = −0.33677811 × 102
(i) What are the results of (x+y)+z and x+(y+z) respectively?
(ii) What is the exact result (in the real number system)? Compare the results and make a conclusion.
(Does the associative law still hold in the floating number system? What’s the lesson learned?)

Problem 3
(0 point - You do not have to submit your work on this one. But if you have time, it is a fun problem to think over! If you do submit your answer to this one, we will take a look and provide feedback.) Bessel functions (of the first kind), denoted as Jn(x), is an important class of special functions. They are formally defined to be solutions to the following ordinary differential equation:

x 2 y 00 + xy 0+ (x 2 − n2)y = 0,

where n is a parameter. (You do not need to know ordinary differential equations to solve this problem!) They satisfy the following three-term recurrence relation:

2x n Jn(x) = Jn−1(x) + Jn+1(x).

It provides us a tool to evaluate Jn(x) for all n given two initial values. Now let’s fix x = 1.0 and try it out.
(i) Given J0(x) = 0.765197686557967, J1(x) = 0.440050585744934. Use the recurrence to compute J0(x), · · · , J20(x). Plot (n, Jn(x)) using the semilogy plot.
(ii) Given J20(x) = 3.873503008524651e − 25, J19(x) = 1.548478441211653e − 23. Use the recurrence to compute J0(x), · · · , J20(x). Plot (n, Jn(x)) using the semilogy plot.
(iii) The exact values of the Bessel functions can be obtained by calling the function besselj in MATLAB. plot the exact (n, Jn(x)), compare with the results obtained above, make a conclusion.
(iv) Other interesting facts and algorithms about Bessel functions can be found here. Take a look when you have time! Enjoy!

This Mathematics Assignment has been solved by our Mathematics Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment Experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.