Search

Recently, regime-switching option pricing based on fractional diffusion models has been used, which explains many significant empirical facts about financial markets better. There are many methods to solve the problem, but to the best of our knowledge, effective preconditioners for the second-order schemes have not been proposed. Thus, in this article, an implicit numerical scheme is developed for a regime-switching European option pricing problem under a multi-state tempered fractional model. The scheme is proven to be unconditionally stable and converges quadratically in space and linearly in time. Besides, the resulting linear system is solved using an iterative method, and a preconditioner is proposed to accelerate the rate of convergence. The preconditioner is constructed through circulant approximations to the Toeplitz blocks due to the coefficient matrix, which is is a block matrix with Toeplitz blocks. The spectral analysis of the preconditioned matrix is given, which demonstrates that the spectrum of the preconditioned matrix is clustered around 1. Numerical examples show the efficiency of the proposed method, and an empirical study is also provided.

We consider the solution of differential equations with multidelays by using boundary value methods (BVMs). These methods require the solution of some nonsymmetric, large and sparse linear systems. The GMRES method with the Strang-type block-circulant preconditioner is proposed to solve these linear systems. If an Ak1,k2-stable BVM is used, we show that our preconditioner is invertible and the spectrum of the preconditioned matrix is clustered. It follows that when the GMRES method is applied to solving the preconditioned systems, the method would converge fast. Numerical results are given to show the effectiveness of our methods. [Copyright &y& Elsevier]

In this paper, we study nonsymmetric and highly nondiagonally dominant linear systems that arise from discretizations of constant-coefficient first-order partial differential equations (PDEs). We apply the generalized minimal residual method [Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston] for solving the system with a preconditioner based on the fast sine transform. An analytic formula for the eigenvalues of the preconditioned matrix is derived and it is shown that the eigenvalues are clustered around 1 except some outliers. The outlier eigenvalues are bounded and well separated from the origin when the size of system increases. In numerical experiments, we compare our preconditioner with the semi-Toeplitz preconditioner proposed in [SIAM J. Sci. Comput. 17 (1996) 47]. We refer to [J. Numer. Linear Algebra Appl. 1 (1992) 77, Numer. Math. J. Chinese Univ. 2 (1993) 116, BIT 32 (1992) 650, Linear Algebra Appl. 293 (1999) 85] for the early works on preconditioning techniques for PDEs. [Copyright &y& Elsevier]