an adaptive monte carlo algorithm for european and american options

in this paper, a new adaptive monte carlo algorithm is proposed to solve systems of linear algebraic equations (slaes). the corresponding properties of the algorithm and its advantages over the conventional and previous adaptive monte carlo algorithms are discussed and theoretical results are established to justify the convergence of the algorithm. furthermore, the algorithm is used to solve the slaes obtained from finite difference method for the problem of european and american options pricing. numerical tests are performed on examples with matrices of different sizes and on slaes coming from option pricing problems. comparisons with standard numerical and stochastic algorithms are also done which demonstrate the computational efficiency of the proposed algorithm.