Documentation

This is machine translation

Translated by Microsoft
Mouseover text to see original. Click the button below to return to the English verison of the page.

Note: This page has been translated by MathWorks. Please click here
To view all translated materals including this page, select Japan from the country navigator on the bottom of this page.

mktree

Create recombining binomial tree

Syntax

Tree = mktree(NumLevels, NumPos, NodeVal, IsPriceTree)

Arguments

NumLevels

Number of time levels of the tree.

NumPos

1-by-NUMLEVELS vector containing the length of the state vectors in each time level.

NodeVal

(Optional) Initial value at each node of the tree. Default = NaN.

IsPriceTree

(Optional) Boolean determining if a final horizontal branch is added to the tree. Default = 0.

Description

Tree = mktree(NumLevels, NumPos, NodeVal, IsPriceTree) creates a recombining tree Tree with initial values NodeVal at each node.

Examples

Create a recombining tree of four time levels with a vector of two elements in each node and each element initialized to NaN.

Tree = mktree(4, 2);

Related Examples

See Also

|

Introduced before R2006a

Was this topic helpful?