Legendre多项式与三角函数在Ito随机微分方程数值积分中的效率比较分析
Comparative Analysis of the Efficiency of Application of Legendre Polynomials and Trigonometric Functions to the Numerical Integration of Ito Stochastic Differential Equations
AI总结:
本文比较Legendre多项式与三角函数在Ito随机微分方程数值积分中的效率,发现Legendre多项式展开更高效,计算成本更低。
摘要:
本文致力于比较Legendre多项式和三角函数在Ito随机微分方程数值积分中的效率,基于广义多重傅里叶级数对迭代Ito和Stratonovich随机积分的近似方法进行分析。以包含在Taylor-Ito展开中的迭代Ito随机积分(乘数为1到3)为例,显示基于Legendre多项式的随机积分展开比使用三角函数系统得到的展开更容易且计算成本显著更低。本文结果可为构造高阶强数值方法提供参考。
英文摘要:
The article is devoted to comparative analysis of the efficiency of application of Legendre polynomials and trigonometric functions to the numerical integration of Ito stochastic differential equations in the framework of the method of approximation of iterated Ito and Stratonovich stochastic integrals based on generalized multiple Fourier series. On the example of iterated Ito stochastic integrals of multiplicities 1 to 3, included in the Taylor-Ito expansion, it is shown that expansions of stochastic integrals based on Legendre polynomials are much easier and require significantly less computational costs compared to their analogues obtained using the trigonometric system of functions. The results of the article can be useful for construction of high-order strong numerical methods for Ito stochastic differential equations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。