{"title":"ε-Monotone Fourier Methods for Optimal Stochastic Control in Finance","authors":"P. Forsyth, G. Labahn","doi":"10.21314/JCF.2018.361","DOIUrl":null,"url":null,"abstract":"Stochastic control problems in finance having complex controls inevitably give rise to low order accuracy, usually at most second order. Fourier methods are efficient at advancing the solution between control monitoring dates, but are not monotone. This gives rise to possible violations of arbitrage inequalities. We devise a preprocessing step for Fourier methods which involves projecting the Green's function onto the set of linear basis functions. The resulting algorithm is guaranteed to be monotone (to within a tolerance), infinity norm stable and satisfies an epsilon-discrete comparison principle. The algorithm has the same complexity per step as a standard Fourier method and has second order accuracy for smooth problems.","PeriodicalId":236552,"journal":{"name":"DecisionSciRN: Other Decision-Making in Operations Research (Topic)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"DecisionSciRN: Other Decision-Making in Operations Research (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21314/JCF.2018.361","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31
Abstract
Stochastic control problems in finance having complex controls inevitably give rise to low order accuracy, usually at most second order. Fourier methods are efficient at advancing the solution between control monitoring dates, but are not monotone. This gives rise to possible violations of arbitrage inequalities. We devise a preprocessing step for Fourier methods which involves projecting the Green's function onto the set of linear basis functions. The resulting algorithm is guaranteed to be monotone (to within a tolerance), infinity norm stable and satisfies an epsilon-discrete comparison principle. The algorithm has the same complexity per step as a standard Fourier method and has second order accuracy for smooth problems.