Registered Member
|
Hi all,
I was just wondering if any one having a C++ code to compute the European call and put options using the FFT (fast Fourier transform) algorithm. You must use the Eigen package; the upper bound of B must be set at 100; and the number of sample points on the ! domain must be set at N = 2^12. Appreciate your time. Nikhil |
Global Moderator
|
Huh? What?
Can you please elaborate on what you want to do? I don't understand a word Also you posted in the "KDevelop" forum, which is for the KDevelop IDE. Judging from the words appearing in your text this should rather be in the "Eigen" forum. Greetings, Sven
I'm working on the KDevelop IDE.
|
Registered Member
|
I understand enough of it to strongly suspect that he is trying to get others to do his homework for him. The phrasing of the second sentence sounds a lot like a homework question. No idea what call and put options have to do with fourier transformations, though. |
Registered users: Bing [Bot], daret, Google [Bot], Sogou [Bot]