MC vs. Binomial Tree vs. Trinomial Tree
- Thread starter sak
- Start date
Daniel Duffy
C++ author, trainer
- Joined
- 10/4/07
- Messages
- 10,436
- Points
- 648
Maybe you should bring PDE/FDM into your list? BM and TM are like _explicit_ versions of FDM.
One can benchmark based on
Applicability to a range of problems
Performance and the amount of effort to achieve a given accuracy
Reliability
Maintainability
With the exception of n factor, PDE/FDM is probably the overall winner.
One can benchmark based on
Applicability to a range of problems
Performance and the amount of effort to achieve a given accuracy
Reliability
Maintainability
With the exception of n factor, PDE/FDM is probably the overall winner.
- Joined
- 3/3/10
- Messages
- 169
- Points
- 28
Use binomial tree for low dimension problem involving early-exercise.
Use MC for high dimension problem involving path dependency.
Compared to binomial tree, trinomial tree can not only avoid oscillation but also provide flexibility. For example, trinomial tree is easy to adjust line above barrier.
Use MC for high dimension problem involving path dependency.
Compared to binomial tree, trinomial tree can not only avoid oscillation but also provide flexibility. For example, trinomial tree is easy to adjust line above barrier.
