前向打靶格方法计算变异期权的价格

前向打靶格方法是Banaquand和Latombe在解决非完全型Hamilton—Jacobi—Bellman方程时介绍的．本将用它来解决未定权益定价问题．中首先介绍这种方法。然后用它计算变异期权的价格。     

阶梯期权价格的计算方法

本文应用前向打靶格方法 ,计算阶梯期权价格 .     

倒向随机微分方程与巴黎期权的非线性定价

巴黎期权是一种复杂的奇异期权. 本文基于倒向随机微分方程, 定义了巴黎期权的非线性价格过程, 分析其性质, 并且给出巴黎期权非线性定价的偏微分方程表达式. 在金融市场收益率不确定的情形以及存贷利率不同的情形下分别对连续巴黎期权进行定价和具体的数值分析, 结论显示巴黎期权的非线性定价机制更具合理性.     

跳-扩散结构下内含巴黎期权特征的可转债定价研究

考虑了跳-扩散结构下的可转换债券定价问题.首先分析了回售、赎回等条款,发现可转换债券具有巴黎期权特征.然后,根据期权定价理论,运用近似对冲跳跃风险的方法,建立了可转换债券的定价模型,得到了可转换债券价格所满足的偏微分方程.基于半离散化方法,给出了偏微分方程求解的数值方法,并且对数值方法的稳定性和误差进行了分析.最后,以重工转债和南山转债为例,对可转债市场进行了实证研究.     

倒向随机方程期权定价模型的一类随机算法

期权定价问题可以转化为对倒向随机微分方程的求解,进而转化为对相应抛物型偏微分方程的求解.为了求解与倒向随机微分方程相应的二阶拟线性抛物型微分方程初值问题,引入一类新的随机算法-分层方法取代传统的确定性数值算法.这种数值方法理论上是通过弱显式欧拉法,离散其相应随机系统解的概率表示而得到.该随机算法的收敛性在文中得到证明,其稳定性是自然的.并构造了易于数值实现的基于插值的算法,实证研究说明这种算法能很好地提供期权定价模型的数值模拟.     

改进的带驻留时间隐Markov模型的前向-后向算法

对隐Maxkov模型(hidden Markov model:HMM)的状态驻留时间的概率进行了修订,给出了改进的带驻留时间隐Markov模型的结构,并在传统的隐Markov模型(traditional hidden Markov model:THMM)的基础上讨论了新模型的前向.后向变量,导出了新模型的前向-后向算法的迭代公式,同时也给出了新模型各个参数的重估公式.     

基于最大熵和最小交叉熵方法的上证50ETF期权定价

基于最大熵方法和最小交叉熵方法,给出了根据期权价格推断标的资产价格分布的模型和已知先验信息下推断标的资产价格分布的模型,利用拉格朗日乘子法给出了模型的简化解,通过粒子群算法求出标的资产价格的密度函数,进而对上证50ETF期权进行定价比较.实证结果表明:基于最大熵方法推断的分布可以作为标的资产价格分布的较好估计;基于最小交叉熵方法推断的分布是在先验信息下标的资产价格分布的较好估计,两种方法适用于我国上证50ETF期权定价.     

具有固定敲定价格的算术平均亚式期权的计算

本文研究算术平均的欧式亚式期权.我们将充分利用偏微分方程的Fichera理论和边值问题的定解理论,求出了一个简单的近似解析表达式.经实际数据验算,有较满意的逼近结果,特别地,在部分区域内的计算效果好于文章[1].     

股票期权VaR的一种计算方法

本文提出一种运用Laplace分布来计算股票期权VaR的新方法.首先对股票价格的运动规律进行理论和实证分析,表明利用Laplace分布来来拟合股票的对数收益率是合理的,然后在此基础上推导了股票期权VaR的计算公式,最后给出了算例.     

跳跃-扩散模型中期权定价的倒向随机微分方程方法及等价概率鞅测度

本文研究的是跳跃一扩散模型中的期权定价问题.通过研究该模型中未定权益所对应的倒向随机微分方程,找到市场中的-个等价概率鞅测度,借助测度变换,未定权益的定价问题就可转化为在等价概率鞅测度下的求期望问题.利用该方法,本文解得了标的股票价格过程为带非时齐:Poisson跳跃的扩散过程且股价期望增长率,波动率,无风险利率均为时间函数时欧式期权价格公式.并且,借助倒向随机微分方程找到在以上参数均为常数时,期权价格所满足的偏微分方程.     

On applicability of the sparse grid method in the worst case setting

Let be bounded linear operators. We provide several sufficient conditions for the validity of the inequality . These results can be applied to error and cost estimates for the sparse grid method.     

Computing the field of values and pseudospectra using the Lanczos method with continuation

The field of values and pseudospectra are useful tools for understanding the behaviour of various matrix processes. To compute these subsets of the complex plane it is necessary to estimate one or two eigenvalues of a large number of parametrized Hermitian matrices; these computations are prohibitively expensive for large, possibly sparse, matrices, if done by use of the QR algorithm. We describe an approach based on the Lanczos method with selective reorthogonalization and Chebyshev acceleration that, when combined with continuation and a shift and invert technique, enables efficient and reliable computation of the field of values and pseudospectra for large matrices. The idea of using the Lanczos method with continuation to compute pseudospectra is not new, but in experiments reported here our algorithm is faster and more accurate than existing algorithms of this type.This work was supported by Engineering and Physical Sciences Research Council grants GR/H/52139 and GR/H/94528.     

Stability and convergence of two‐grid Crank‐Nicolson extrapolation scheme for the time‐dependent natural convection equations

In this paper, we consider the Crank‐Nicolson extrapolation scheme for the 2D/3D unsteady natural convection problem. Our numerical scheme includes the implicit Crank‐Nicolson scheme for linear terms and the recursive linear method for nonlinear terms. Standard Galerkin finite element method is used to approximate the spatial discretization. Stability and optimal error estimates are provided for the numerical solutions. Furthermore, a fully discrete two‐grid Crank‐Nicolson extrapolation scheme is developed, the corresponding stability and convergence results are derived for the approximate solutions. Comparison from aspects of the theoretical results and computational efficiency, the two‐grid Crank‐Nicolson extrapolation scheme has the same order as the one grid method for velocity and temperature in H¹‐norm and for pressure in L²‐norm. However, the two‐grid scheme involves much less work than one grid method. Finally, some numerical examples are provided to verify the established theoretical results and illustrate the performances of the developed numerical schemes.     

Convergence of the Newton method and uniqueness of zeros of vector fields on Riemannian manifolds

The estimates of the radii of convergence balls of the Newton method and uniqueness balls of zeroes of vector fields on the Riemannian manifolds are given under the assumption that the covariant derivatives of the vector fields satisfy some kind of general Lipschitz conditions. Some classical results such as the Kantorovich's type theorem and the Smale's γ-theory are extended.     

Properties of a family of merit functions and a merit function method for the NCP

A family of merit functions are proposed, which are the generalization of several existing merit functions. A number of favorable properties of the proposed merit functions are established. By using these properties, a merit function method for solving nonlinear complementarity problem is investigated, and the global convergence of the proposed algorithm is proved under some standard assumptions. Some preliminary numerical results are given.     

Slip and slide method of factoring trinomials with integer coefficients over the integers

In intermediate and college algebra courses there are a number of methods for factoring quadratic trinomials with integer coefficients over the integers. Some of these methods have been given names, such as trial and error, reversing FOIL, AC method, middle term splitting method and slip and slide method. The purpose of this article is to discuss the Slip and Slide Method and present a theoretical justification of why it works.     

Geometric interpretation of several classical iterative methods for linear system of equations and diverse relaxation parameter of the SOR method

Two kinds of iterative methods are designed to solve the linear system of equations, we obtain a new interpretation in terms of a geometric concept. Therefore, we have a better insight into the essence of the iterative methods and provide a reference for further study and design. Finally, a new iterative method is designed named as the diverse relaxation parameter of the SOR method which, in particular, demonstrates the geometric characteristics. Many examples prove that the method is quite effective.     

Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs

We show that the class of unit grid intersection graphs properly includes both of the classes of interval bigraphs and of P₆-free chordal bipartite graphs. We also demonstrate that the classes of unit grid intersection graphs and of chordal bipartite graphs are incomparable.