findiff_exp_eur_call.cc

来自「Financial Recipes」· CC 代码 · 共 46 行

#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;

double option_price_call_european_finite_diff_explicit(double S, 
						       double X, 
						       double r,
						       double sigma,
						       double time,
						       int no_S_steps,
						       int no_t_steps) {
    double sigma_sqr = sigma*sigma;

    unsigned int M;           // need M = no_S_steps to be even:
    if ((no_S_steps%2)==1) { M=no_S_steps+1; } else { M=no_S_steps; };
    double delta_S = 2.0*S/M;
    vector<double> S_values(M+1);
    for (unsigned m=0;m<=M;m++) { S_values[m] = m*delta_S; };
    int N=no_t_steps;
    double delta_t = time/N;
    
    vector<double> a(M);
    vector<double> b(M);
    vector<double> c(M);
    double r1=1.0/(1.0+r*delta_t);
    double r2=delta_t/(1.0+r*delta_t);
    for (unsigned int j=1;j<M;j++){
	a[j] = r2*0.5*j*(-r+sigma_sqr*j);
	b[j] = r1*(1.0-sigma_sqr*j*j*delta_t);
	c[j] = r2*0.5*j*(r+sigma_sqr*j);
    };
    vector<double> f_next(M+1);
    for (unsigned int m=0;m<=M;++m) { f_next[m]=max(0.0,S_values[m]-X); };
    vector<double> f(M+1);
    for (int t=N-1;t>=0;--t) {
	f[0]=0;
	for (unsigned m=1;m<M;++m) {
	    f[m]=a[m]*f_next[m-1]+b[m]*f_next[m]+c[m]*f_next[m+1];
	};
	f[M] = 0;
	for (unsigned m=0;m<=M;++m) { f_next[m] = f[m]; };
    };
    return f[M/2];
};