登录
首页 » matlab » eur_call_dw

eur_call_dw

于 2011-04-01 发布 文件大小:1KB
0 221
下载积分: 1 下载次数: 1

代码说明:

说明:  用对偶法(underlying_dw),给定2M条样本轨道,给出一个欧式看涨期权的价格(With the dual method, sample path of a given article 2M, given the price of a European call option)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Algorithm-Collections-for-Digital-Signal-Processin
    此书是关于数字信号处理的一些算法收集,很详细,全面。(This book is about the digital signal processing algorithms to collect some very detailed and comprehensive.)
    2010-12-03 22:05:11下载
    积分:1
  • fdtd2D
    2-D FDTD code with simple radiation boundary conditions
    2013-02-25 12:37:00下载
    积分:1
  • LaTeX
    Latex is a software for publishing, text editing of research papers, publications, and thesis.
    2014-02-13 13:37:07下载
    积分:1
  • dvbs
    MATLAB code for the simulation of Channel DVB-S
    2012-02-14 08:13:46下载
    积分:1
  • svm_regressive
    基于支持向量机(SVM)回归的MATLAB演示程序(Based on support vector machine (SVM) regression of the MATLAB demo)
    2009-03-29 23:54:37下载
    积分:1
  • The_application_of_wavelet_analysis_techniques
    这是小波分析的应用技术,介绍了程序的功能作用及一些小算例(This is the application of wavelet analysis techniques, introduced the functional role of the program and some small examples)
    2009-11-26 11:50:10下载
    积分:1
  • FuzzyAnti-windup
    Fuzzy Anti-Windup Schemes for PID Controllers
    2010-12-31 12:12:25下载
    积分:1
  • AF_Simulation
    协作通信中,运用放大转发的误码率分析。运用最大比合并(Collaborative communication, the use of forward error rate analysis of amplification. The use of maximum ratio combining)
    2011-08-05 19:33:35下载
    积分:1
  • 潮流计算的MATLAB源
    潮流计算——牛顿法,程序较为全面的解释说明牛顿法潮流计算编写过程,适合初学者。(The flow calculation - Newton method. The program explains the writing process of the Newton method comprehensively, which is suitable for the beginner.)
    2018-01-22 11:23:55下载
    积分:1
  • kmeans
    说明:  k均值算法是一种迭代求解的聚类分析算法,其步骤是随机选取K个对象作为初始的聚类中心,然后计算每个对象与各个种子聚类中心之间的距离,把每个对象分配给距离它最近的聚类中心。聚类中心以及分配给它们的对象就代表一个聚类。(kmeans algorithm is an iterative solution clustering analysis algorithm. First, the initial clustering centers are randomly selected. Then, distance between between each point ans others are calculated, and each data point is designed to its nearest clustering center.)
    2020-06-21 23:40:01下载
    积分:1
  • 696516资源总数
  • 106918会员总数
  • 4今日下载