首页 > 其他分享 >MATH60082有限差

MATH60082有限差

时间:2023-05-02 09:01:06浏览次数:37  
标签:option 有限 MATH60082 results T1 marks your bond


MATH60082 (Computational Finance) Finite Difference Methods Assignment

1 Background Theory

1.1 Coupon Bonds with Stochastic Interest Rate

Consider a set of coupon bonds B are trading on the financial markets, and the term structure of interest rates is stochastic. Let us denote B(r,t;T) as the value of a bond at time t that matures at time T, given the current stochatic interest rate is r. Later on in this project, you will be asked to price the option to buy (or sell) a coupon bond at some time T1 before the bond matures T1 < T. To price this contract, we need to first calculate the value of the bond B(r,t;T) at all time t < T.

The risk-neutral process followed by interest rate is given by

dr = κ ?θeμt ? r? dt + σrβ dW. (1)

Here κ, θ, μ, σ and β are all constant model parameters that can be determined from market prices of zero coupon bonds.

It is relatively straightforward to show that the market value of the coupon bond B(r,t;T) satisfies the following PDE

?B+1σ2r2β?2B+κ?θeμt?r??B?rB+Ce?αt =0, (2) ?t 2 ?r2 ?r

if the bond pays out a continuous coupon at the rate of

C e?αt for constants C and α defined in the bond contract.

(3)

The domain of this problem is r ∈ [0, ∞) and t < T . The boundary conditions are:

B(r,t = T;T) = F; (4)

and

1.2 Options on a Bond

?B + κθeμt ?B + Ce?αt = 0, at r = 0; (5) ?t ?r

B(r,t;T) → 0 as r → ∞. (6)

Now consider an option V to buy the bond at time T1. Let V(r,t;T1,T) be the value of a call (or put) option to buy (or sell) at time T1 the coupon bond B(r, t; T ) maturing at time T . On the domain r ∈ [0, ∞), t < T1, it can be shown that function V satisfies the following PDE:

European Call Option

For a European call option, the boundary conditions are given by:

V (r, t = T1; T1, T ) = max(B(r, T1; T ) ? X, 0); (8)

and

European Put Option

?V +κθeμt?V =0, atr=0; (9) ?t ?r

V (r, t; T1 , T ) → 0 as r → ∞. (10)

For a European put option, the boundary conditions are given by:

V (r, t = T1; T1, T ) = max(X ? B(r, T1; T ), 0); (11)

and

American Call Option

?V +κθeμt?V =0, atr=0; (12) ?t ?r

V (r, t; T1 , T ) → 0 as r → ∞. (13)

For an American call option, the boundary conditions are given by:

V (r, t; T1, T ) ≥ max(B(r, t; T ) ? X, 0) for t ≤ T1; (14)

and

American Put Option

V (r, t; T1, T ) = B(r, t; T ) ? X at r = 0; (15) V (r, t; T1 , T ) → 0 as r → ∞. (16)

For an American put option, the boundary conditions are given by:

V (r, t; T1, T ) ≥ max(X ? B(r, t; T ), 0) for t ≤ T1; (17)

and

2 Tasks 2.1 Bonds

V (r, t; T1, T ) → X ? B(r, t; T )

atr=0; (18) as r → ∞. (19)
Write out the correct numerical scheme (i.e. aj =, bj =, cj = and dj =) matching the PDE for a bond (2), including the boundary conditions (5) and (6) at j = 0 and j = jMax. Be careful to make your notation clear and understandable.

(understanding 5 marks)

Unless otherwise instructed, you should assume that the following standard values for the parameters apply: T = 2, F = 140, θ = 0.035, r0 = 0.0271, κ = 0.1172, μ = ?0.0075, C = 7, α = 0.01, β = 0.317 and σ = 0.104.

Write code to calculate the value of the bond B(r,0;T) using rmax = 1, iMax = 100 and jMax = 100. You must use the finite-difference method with a Crank-Nicolson scheme, along with an appropriate method to solve the algebraic system. State the value of the bond B(r0, 0; T ) using these parameters.

An alternative boundary condition is

Plot out the value of the option B(r, 0; T ) against the interest rate r for r ∈ [0, rmax] and compare the

results with different boundary conditions.

Comment on the results in each case, can you explain which boundary condition works best and why?

(understanding 5 marks)

Include in your report an accurate estimate for the bond price B(r0,t = 0;T) using the parameters outlined above. Explain how you obtained your result, how efficient it is, and also how accurate it is, by exploring the effect that each of the different numerical parameters (iMax, jMax, rmax) have on your solution.

2.2 Options on Bonds

You are tasked to solve for a European and an American put option.

Unless otherwise instructed, you should assume that the following standard values for the parameters apply: T = 2, T1 = 0.73737, X = 142, F = 140, θ = 0.035, r0 = 0.0271, κ = 0.1172, μ = ?0.0075, C = 7, α = 0.01, β = 0.317 and σ = 0.104.

Write out the correct numerical scheme (i.e. aj =, bj =, cj = and dj =) matching the PDE for the European or American put option (7), and also appropriate boundary conditions such as (12), (13), (18) and (19) at j = 0 and j = jMax. Describe how you create a grid to account for any discontinuities that may arise.

(understanding 5 marks )

WritecodetocalculatethevalueofboththeoptionV(r,t;T1,T)(fort≤T1)andthebondB(r,t;T) (for t ≤ T). Plot out the value of the European option V against the interest rate r at time t = T1 and time t = 0. What is the minimum value of r at time t = T1 at which the option is exercised?

(coding 2 marks, understanding 5 marks)

StateanaccuratevalueforboththeEuropeanandAmericanstyleversionsoftheoptionV(r0,0;T1,T) using the parameters as given above. Explain how you obtained your result, how efficient it is, and also how accurate it is, by exploring the effect that each of the different numerical parameters (iMax, jMax, rmax) and different boundary conditions have on your solution.

(understanding 5 marks, originality 10 marks)

3

(coding 3 marks)

(originality 5 marks )

 

3 Instructions

The deadline for this assignment is 11am on Tuesday 9th May, and as part of a 15 credit course unit you should expect this may take up to 25 hours to complete. Unless you have an agreed extension on coursework deadlines with DASS reports handed in AFTER 11am Tuesday 9th May will be docked 5 marks plus an additional 5 marks each day thereafter until a mark of zero is reached. Reports handed in after 5pm Friday 19th May will be awarded a mark of zero and will not be marked.

In order that your report conforms to the standards for a technical report, you should use the following structure:

MS Word, LaTeX, or similar, and must be submitted without your name, but with your univer- sity ID number online through the TurnItIn system.

approximately 8 - 10 pages long (excluding appendices)
be written in continuous prose

give a brief introduction stating the problem you are solving and the parameters you are using (from the model or method),

present your results in the form of figures and tables, using the order of items in the bullet points as a guide as to the order of your document

absolutely NO screenshots of running code need to be included,

do not include overly long tables – a table should never cross over a page,

present the results for any methods you have implemented, there is no credit for a discussion of a method that has not been shown to be implemented by you (through results) for your problem

refer to and discuss each of your results in the text, part of the marks available in each bullet point are for interpreting the results

try to keep to the page limit, removing any unnecessary results from the main text

number and caption your figures and tables and refer to them by their number (not their position in

the text),

number any equations to which you refer,

use consistent internal (and external) referencing.

4 RUBRIC

This assignment is the last assignment, and it will account for 50% of your final assessment for this module. Marks will be awarded as follows:

(i) 5% for working codes; Grade Description

0-50% Little or no attempt, codes not working

50%-70% One or two bugs in the code are affecting the results

70%-100%

Results in 2.1 and 2.2 from the codes appear correct

(ii) 5% for the presentation of your written report; Grade Description

0-50% Poorly presented work. Significant amount of text unreferenced. Graphs and tables poorly labelled making it difficult to interpret them.

50%-70% Good presentation. Text is readable. Graphs are ok, maybe miss- ing labels and not always referenced correctly. Report is overly long and unnecessarily repeats the same (or similar) results. Excellent presentation, well written and well referenced. Graphs are clear, tables used when appropriate. Report keeps within the page limit.

(iii) 25% for the understanding of the problems involved; Grade Description

0-50% Results are poorly presented or they are without supporting text. The methods are described but are not shown to be implemented through results. The student is unable to demonstrate they can correctly interpret results.

50%-70% Demonstrates a good understanding of the standard methods. Is able to generate standard results and discuss them. Results are well presented.

Student is able to correctly interpret standard results and evaluate the efficiency of the standard methods.

(iv) 15% for originality/initiative. Grade Description

0-50% Little or no attempt at adapting the methods for this particular problem. Those adaptations that have been implemented have poorly presented results or the student is unable to demonstrate they can correctly interpret results.

50%-70% Is able to efficiently adapt the method for this problem, or make improvements to the standard implementation. Is able to present results and discuss them. Results are well presented.

Is able to implement new or combine existing algorithms together to produce a highly efficient numerical method. Presentation of the results is excellent. Student is able to correctly interpret re- sults and compare methods in a coherent way.

Please see bullet points for a more detailed breakdown of marks.

70%-100%

70%-100%

70%-100%

 WX:codehelp

标签:option,有限,MATH60082,results,T1,marks,your,bond
From: https://www.cnblogs.com/mondayw/p/17367322.html

相关文章

  • 【Unity】高级——有限状态机(角色控制)移动、待机
    简介有限状态机是unity游戏开发中经常用到的一个概念,能制作敌人AI,玩家控制器等。有限状态机允许对象在内部状态发生改变时改变它的行为,对象看起来好像修改了它的类实现:将一个个具体的状态类抽象出来经典案例:玩家行动器案例中玩家行动包括:待机、移动、跳跃、冲刺、爬墙等而这......
  • Go中的有限状态机FSM的详细介绍
    1、FSM简介1.1有限状态机的定义有限状态机(FiniteStateMachine,FSM)是一种数学模型,用于描述系统在不同状态下的行为和转移条件。状态机有三个组成部分:状态(State)、事件(Event)、动作(Action),事件(转移条件)触发状态的转移和动作的执行。动作的执行不是必须的,可以只转移状态,不指定任何......
  • 求解带有限重的三维装箱问题——启发式深度优先搜索算法
    引子在这篇文章中,只考虑了尺寸的限制,没有加入重量限制。加入重量限制后,主要思路有两个关键点: 1、在简单块和复合块生成的时候,记录块的重量。 2、在填充块的时候,记录装箱过程中的总重量,达到限重则不进行填充。代码:importcopyfromitertoolsimportproductfrommatplotl......
  • pytorch在有限的资源下部署大语言模型(以ChatGLM-6B为例)
    pytorch在有限的资源下部署大语言模型(以ChatGLM-6B为例)Part1知识准备在PyTorch中加载预训练的模型时,通常的工作流程是这样的:my_model = ModelClass(...)state_dict =torch.load(checkpoint_file)用简单的话来说,这些步骤是:用随机初始化的权重创建模型。从磁盘上加载模型权......
  • 探索FSM (有限状态机)应用
    我们是袋鼠云数栈UED团队,致力于打造优秀的一站式数据中台产品。我们始终保持工匠精神,探索前端道路,为社区积累并传播经验价值。。本文作者:木杪有限状态机(FSM)是计算机科学中的一种数学模型,可用于表示和控制系统的行为。它由一组状态以及定义在这些状态上的转换函数组成。FS......
  • 江苏坤和鑫电子科技有限公司2023年第一季度销量猛增
    江苏坤和鑫电子科技有限公司2023年第一季度营销收入比往年增长,在杨总带领下,该公司全体员工,心往一处想,劲往一处使,首度开门红,公司成立于2014年,是一家专业加工销售进口/国产精密不锈钢带的企业。公司目前占地面积2000M,年销售材料1000吨以上,主营产品于,日本,南韩马来西亚,欧洲等国家的精密......
  • 在有限 computational budget 下,借助 low-fidelity 模型提高精度
    论文名称:context-awarelearningofhierarchiesoflow-fidelitymodelsformulti-fidelityuncertaintyquantification链接:https://www.sciencedirect.com/science/article/pii/S0045782523000312国际计算力学领域的顶级期刊《ComputerMethodsinAppliedMechanicsand......
  • 兴元(山东)信息科技有限公司董事长于卓带队考察店数集团并签署战略合作协议
      3月29日,兴元(山东)信息科技有限公司董事长于卓及受邀,率公司技术团队考察店数集团,并签订战略合作协议。 兴元(山东)信息科技有限公司考察团队到达店数集团总部后,首先参观了店数集团的元宇宙场景展示区,体验了元宇宙技术在商业、教育、商务、文化等场景的应用案例。在参观之后,......
  • 2389. 和有限的最长子序列
    题目链接:2389.和有限的最长子序列方法:前缀和+二分查找解题思路根据题意,子序列与\(nums\)数组的元素顺序无关,因此可以先对\(nums\)从小到大排序,并计算前缀和\(nums[i]+=nums[i-1]\),此时的\(nums[i]\)表示原来nums数组\([0,i]\)的区间和。那么\(answer[i]=idx+1\),......
  • 有限域的实例化表示探讨
    Z /(p)有限域最普通的例子是Zp= Z/(p),其中Z是整数环,p是一个素数. Zp有非常直观的实例化表示,即:Zp={0+(p),1+(p),...,p-1+(p)}={[0]p,[1]p,...,[p-1]p}.这个表示法可以非常直观地看到char(Zp)=p,以及(Zp,+)构成加法交换群,比如[i]p的加法逆元......