• Journal of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.383-398
• /
• 2006

We consider a geometric Levy process for an underlying asset. We prove first that the option price is the unique solution of certain integro-differential equation without assuming differentiability and boundedness of derivatives of the payoff function. Second result is to provide convergence rate for option prices when the small jumps are removed from the Levy process.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.2
• /
• pp.77-84
• /
• 2000

Black-Scholes equation arising from option pricing in the presence of cost in trading the underlying asset is derived. The transaction cost is chosen precisely and generalized to reflect the trade in the real world. Furthermore the concept of the bandwidth is introduced to obtain the better rehedging. The model with bandwidth derived in this paper can be used to calculate the more accurate option price numerically even if it is nonlinear and more complicated than the models shown before.

• Communications of the Korean Mathematical Society
• /
• v.23 no.1
• /
• pp.141-151
• /
• 2008

In this paper, we derive the nonlinear equation for European option pricing containing liquidity risk which can be defined as the inverse of the partial derivative of the underlying asset price with respect to the amount of assets traded in the efficient market. Numerical solutions are obtained by using finite element method and compared with option prices of KOSPI200 Stock Index. These prices computed with liquidity risk are considered more realistic than the prices of Black-Scholes model without liquidity risk.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1241-1261
• /
• 2018

We derive discrete time model of the geometric fractional Brownian motion. It provides numerical pricing scheme of financial derivatives when the market is driven by geometric fractional Brownian motion. With the convergence analysis, we guarantee the convergence of Monte Carlo simulations. The strong convergence rate of our scheme has order H which is Hurst parameter. To obtain our model we need to convert Wick product term of stochastic differential equation into Wick free discrete equation through Malliavin calculus but ours does not include Malliavin derivative term. Finally, we include several numerical experiments for the option pricing.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.75-89
• /
• 2018

This paper presents the numerical valuation of the arithmetic Asian option by using the operator-splitting method (OSM). Since there is no closed-form solution for the arithmetic Asian option, finding a good numerical algorithm to value the arithmetic Asian option is important. In this paper, we focus on a two-dimensional PDE. The OSM is famous for dealing with plural-dimensional PDE using finite difference discretization. We provide a detailed numerical algorithm and compare results with MCS method to show the performance of the method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.1
• /
• pp.61-74
• /
• 2014

This paper presents accurate and efficient numerical methods for calculating the sensitivities of two-asset European options, the Greeks. The Greeks are important financial instruments in management of economic value at risk due to changing market conditions. The option pricing model is based on the Black-Scholes partial differential equation. The model is discretized by using a finite difference method and resulting discrete equations are solved by means of an operator splitting method. For Delta, Gamma, and Theta, we investigate the effect of high-order discretizations. For Rho and Vega, we develop an accurate and robust automatic algorithm for finding an optimal value. A cash-or-nothing option is taken to demonstrate the performance of the proposed algorithm for calculating the Greeks. The results show that the new treatment gives automatic and robust calculations for the Greeks.

• The Pure and Applied Mathematics
• /
• v.28 no.4
• /
• pp.329-341
• /
• 2021

In this study, we consider an efficient and accurate finite difference method for the four underlying asset equity-linked securities (ELS). The numerical method is based on the operator splitting method with non-uniform grids for the underlying assets. Even though the numerical scheme is implicit, we solve the system of discrete equations in explicit manner using the Thomas algorithm for the tri-diagonal matrix resulting from the system of discrete equations. Therefore, we can use a relatively large time step and the computation of the ELS option pricing is fast. We perform characteristic computational test. The numerical test confirm the usefulness of the proposed method for pricing the four underlying asset equity-linked securities.

• Honam Mathematical Journal
• /
• v.37 no.4
• /
• pp.441-455
• /
• 2015

In this paper, we perform a comparison study of explicit and implicit numerical methods for the equity-linked securities (ELS). The option prices of the two-asset ELS are typically computed using an implicit finite diffrence method because an explicit finite diffrence scheme has a restriction for time steps. Nowadays, the three-asset ELS is getting popularity in the real world financial market. In practical applications of the finite diffrence methods in computational finance, we typically use relatively large space steps and small time steps. Therefore, we can use an accurate and effient explicit finite diffrence method because the implementation is simple and the computation is fast. The computational results demonstrate that if we use a large space step, then the explicit scheme is better than the implicit one. On the other hand, if the space step size is small, then the implicit scheme is more effient than the explicit one.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.4
• /
• pp.791-812
• /
• 2011

This is a survey on American options. An American option allows its owner the privilege of early exercise, whereas a European option can be exercised only at expiration. Because of this early exercise privilege American option pricing involves an optimal stopping problem; the price of an American option is given as a free boundary value problem associated with a Black-Scholes type partial differential equation. Up until now there is no simple closed-form solution to the problem, but there have been a variety of approaches which contribute to the understanding of the properties of the price and the early exercise boundary. These approaches typically provide numerical or approximate analytic methods to find the price and the boundary. Topics included in this survey are early approaches(trees, finite difference schemes, and quasi-analytic methods), an analytic method of lines and randomization, a homotopy method, analytic approximation of early exercise boundaries, Monte Carlo methods, and relatively recent topics such as model uncertainty, backward stochastic differential equations, and real options. We also provide open problems whose answers are expected to contribute to American option pricing.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.9-13
• /
• 2014

The performance of large scale software applications has been automatically increasing for last few decades under the influence of Moore's law - the number of transistors on a microprocessor roughly doubled every eighteen months. However, on-chip transistors limitations and heating issues led to the emergence of multicore processors. The energy efficient ARM based System-on-Chip (SoC) processors are being considered for future high performance computing systems. In this paper, we present a case study of two widely used parallel programming models i.e. MPI and MapReduce on distributed memory cluster of ARM SoC development boards. The case study application, Black-Scholes option pricing equation, was parallelized and evaluated in terms of power consumption and throughput. The results show that the Hadoop implementation has low instantaneous power consumption that of MPI, but MPI outperforms Hadoop implementation by a factor of 1.46 in terms of total power consumption to execution time ratio.