首页> 外文会议>Workshop on sparse grids and its applications >Asymptotic Expansion Around Principal Components and the Complexity of Dimension Adaptive Algorithms
【24h】

Asymptotic Expansion Around Principal Components and the Complexity of Dimension Adaptive Algorithms

机译:主要成分周围的渐近扩张及维度自适应算法的复杂性

获取原文
获取外文期刊封面目录资料

摘要

In this short article, we describe how the correlation of typical diffusion processes arising e.g. in financial modelling can be exploited-by means of asymptotic analysis of principal components-to make Feynman-Kac PDEs of high dimension computationally tractable. We explore the links to dimension adaptive sparse grids (Gerstner and Griebel, Computing 71:65-87, 2003), anchored ANOVA decompositions and dimension-wise integration (Griebel and Holtz, J Complexity 26:455-489, 2010), and the embedding in infinite-dimensional weighted spaces (Sloan and Wozniakowski, J Complexity 14:1-33, 1998). The approach is shown to give sufficient accuracy for the valuation of index options in practice. These numerical findings are backed up by a complexity analysis that explains the independence of the computational effort of the dimension in relevant parameter regimes.
机译:在这简短的文章中,我们描述了典型的扩散过程的相关性是如何产生的。在金融建模中,可以通过主要成分的渐近分析来利用 - 使Feynman-Kac PDE在计算上进行的高维度。我们探索维度自适应稀疏电网(Gerstner和Griebel,计算71:65-87,2003)的链接,锚定Anova分解和维度 - 明智的集成(Griebel和Holtz,J复杂性26:455-489,2010),以及嵌入无限尺寸加权空间(Sloan和Wozniakowski,J复杂性14:1-33,1998)。该方法被证明在实践中提供了足够的准确性。这些数值发现由复杂性分析备份,该复杂性分析解释了相关参数制度中维度的计算工作的独立性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号