Code Directory
 Visual Basic & VB.NET
New Code
Database Workbench Pro 5.4.0
ByteScout Text Recognition SDK
Equipment Rental Script 1.0
Aliexpress Clone- Ec21 Script 1
Agriya Event Booking Solution v2.0b5
Key Transformation 8.1133
IP2Location Geolocation Database 2018
Hotel Restaurant Reviews and Feedback Script 1.0.2
Luxand FaceSDK 6.4
wolfSSL 3.13.0
PHP Survey 1.0
dbForge Studio for MySQL 7.3
Vimeo Script, Dailymotion Clone 1.0.2
SQLi 8
Directory Script- PHP Business Directory Script 1.0.2
Top Code
heap sort
Pet Listing Script 1.0
Directory Script- PHP Business Directory Script 1.0.2
SitePoint Webmaster Discussion Forums
Script For Resize Popup Window In Flash 1.0
Etv Filter 3.5
Hawkeye Computer Graphics Projects in C++ 1.0
gaussian pyramid and laplacian pyramid 1.0
Top Rated
Indiegogo Clone 3.0
PHP Image Resize Script 1.0
Jango Clone Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Deals and Discounts Website Script 1.0.2
Readymade MLM Products 2.01
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
American Option Prices and the Optimal Exercise Boundary 1.0
File ID: 81260

American Option Prices and the Optimal Exercise Boundary 1.0
Download American Option Prices and the Optimal Exercise Boundary 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 10.0 KB
Downloads: 13
Submit Rating:
American Option Prices and the Optimal Exercise Boundary 1.0 Description
Description: In this demo, the price V of an American option is considered as a
function of the stock value S and time t, i.e. V = V(S,t). The financial
parameters like strike, volatility, etc. (a complete list is given below)
are assumed to be constants. The demo computes the option price for a
range of discrete stock values S(i) and a range of discrete time
values t(j).

The demo also computes the optimal exercise boundary Sf as a function
of time, i.e. Sf = Sf(t). For each discrete time value t(j), the value
Sf(j) is the last (in case of a put) or the first (in case of a call)
contact point with the payoff. This point gives the user the information
whether it is optimal to exercise the option at each discrete point in

The results are visualized in three figures. The first figure is a graph
of the American option price at the initial time. For comparison reasons,
this figure also shows a graph of the corresponding European option
and a graph of the payoff. The second figure displays a surface of the
option price as a function of the stock value and time. Finally, the
third graph displays the optimal exercise boundary.

The demo is executed by running the scritp AmericanOptionDemo.m. This scritp calls the functions AmericanOption.m and FreeBoundary.m

License: Shareware

Related: Comparison, initial, reasons, Shows, Graph, figure, results, visualized

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 13

More Similar Code

auction_match: Compute optimal (maximal) weighted assignment
and the corresponding "lattice of dual prices" supporting the
optimal assignment.
auction_match(disMatrix) computes the optimal assignment for the
given rectangular value matrix, for example the assignment
of bidders (in rows) to objects (in columns) and vice versa.

[assignment,r,p,u,v,value] = ASSIGNMENTOPTIMAL(DISTMATRIX) returns...

A useful tool built to help the user gain an intuitive feel for option pricing and the greeks.

Allows the user to create a portfolio of options (and thus straddles, strangles, butterflies and anything else you fancy can be easily...

SRAT for OSS can assess the reliability and the optimal version-upgrade time of Open Source Software. SRAT for OSS is used several software reliability growth models to assess the reliability of OSS development.

This function uses the auction principle to return the optimal assignment and the dual prices. It performs quite well, and is way faster than the hungarian algorithm as the number of points increases. More details on the auction algorithm can be...

You can input the angles and the axis about which the co-ordiante has to be rotated to visualize the rotation and orientation.

you will have full control of what elements to be shown in screen, like path,plane of rotation,initial...

This is an application of the Greedy Algorithm and the Local Search for finding a solution for the SC Distribution Network problem.
We dealt with one level SC composed of a set of factories and a set of Sales Points, each sales point has a...

American option pricing using CRR method with tree output
Improvement: Programme runs slow as time steps (not recommended for time step>50)

Dirty Forms and The UserData Persistence Behavior with XMLDocument Property is an article through which users can gain knowledge about creating web forms on ASP.NET web pages. The author explains how to check whether the visitor has filled all the...

Downloading any file using ASP, FSO and the ADODB Stream object is an online tutorial in which the author has given a brief note on how to employ the FSO and ADODB objects of ASP in enabling your website visitors to download files from your web...

Web site Administration with ADSI and the .NET DirectoryServices Namespace is a web based tutorial in which author describes about utilizing the System.DirectoryServices namespace classes which can work along with IIS, LDAP etc. With the help of...

User Review for American Option Prices and the Optimal Exercise Boundary
- required fields

Please enter text on the image