Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal International Journal of Computing Science and Applied Mathematics-IJCSAM
Endah Rokhmati Merdika Putri
Department of Mathematics, Institut Teknologi Sepuluh Nopember, Surabaya
Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Comparison of Numerical Methods on Pricing of European Put Options Lutfi Mardianto; Aditya Putra Pratama; Annisa Rahmita Soemarsono; Amirul Hakam; Endah Rokhmati Merdika Putri
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 5 No. 1 (2019)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Put option is a contract to sell some underlying assets in the future with a certain price. On European put options, selling only can be exercised at maturity date. Behavior of European put options price can be modeled by using the Black-Scholes model which provide an analytical solution. Numerical approximation such as binomial tree, explicit and implicit finite difference methods also can be used to solve Black-Scholes model. Some numerical methods are applied and compared with the analytical solution to determine the best numerical method. The results show that numerical approximations using the binomial tree is more accurate than explicit and implicit finite difference method in pricing European put options. Moreover when the value of T is higher then the error obtained is also higher, while the error obtained is lower when the value of N is higher. The value of T and N cause the increase of the computation time. When the value of T is higher the computation time is lower, while computation time is higher if the value of N is higher. Overall, the lowest computation time is obtained by using an explicit finite difference method with an exceptional as the value of T is big and the value of N is small. The lowest computation time is obtained by using a binomial tree method.
Co-Authors Aditya Putra Pratama Annisa Rahmita Soemarsono Hakam, Amirul Lutfi Mardianto