Yield volatility and graph, Mathematics

This question has two related parts, (a) and (b).

(a) Use the daily yields in the table below to compute a daily standard deviation of yields. Next annualize the daily standard deviation just calculated first using 365 calendar days, then using 250 trading days in a year. Finally, construct a 4 -day moving average equal weight volatility forecast for each day in the period from Day 5 to Day 24, assuming that the expected value of the daily change in yield is zero. Please show your calculations, including formulas used. Please note: for this question 1) if you use Excel please attach your Excel worksheet to your assignment and 2) keep at least 6 decimal places in both your calculations and your final answers.

(b) Plot in the same graph for each day between Day 5 and Day 24 (inclusive) the computed daily standard deviation of yields and volatility forecast obtained in part (a) above. Please briefly comment on the volatility forecasting method in light of the graph. 

 

 

Posted Date: 2/28/2013 6:16:59 AM | Location : United States







Related Discussions:- Yield volatility and graph, Assignment Help, Ask Question on Yield volatility and graph, Get Answer, Expert's Help, Yield volatility and graph Discussions

Write discussion on Yield volatility and graph
Your posts are moderated
Related Questions
Define an ordered rooted tree. Cite any two applications of the tree structure, also illustrate using an example each the purpose of the usage.   Ans: A  tree is a graph like t

Which of the subsequent numbers will yield a number larger than 23.4 while it is multiplied by 23.4? When multiplying through a number less than 1, you get a product in which i

Decision-Making Under Conditions of Certainty Conditions of certainty tend to be rare, especially when significant decisions are involved. Under conditions of certainty, decis

Related Rates : In this section we will discussed for application of implicit differentiation.  For these related rates problems usually it's best to just see some problems an

Problem 1 Work through TALPAC 10 Basics (refer to attached handout). Answer the set of questions at the end of tutorial module. Problem 2 Referring to both the haul cyc

Use the maximum flow algorithm to find a maximum flow and a minimum cut in the given network, where the capacities of arc CF, EC , DE and BD are w = 13, x = 7, y =1, a

The following exercises may help you to look more closely at the activities done above. E1) Why did the two dice game become more difficult? E2) Do you find the activities in

find the normalised differential of the following {1,x,x^3}

theory about solving sequencing problem using graphical method