arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2004.05687math.NAcs.NA
收藏

基于Karhunen-Loève展开和矩阵函数的随机微分方程采样

Sampling of Stochastic Differential Equations using the Karhunen-Loève Expansion and Matrix Functions

Antti Koskela, Samuel D. Relton

摘要:

利用Karhunen-Loève展开方法研究了带加性噪声的随机微分方程的线性化问题。我们得到我们的线性化截断的扩展和书面的解决方案作为一系列的矩阵向量产品使用矩阵论函数。此外,我们重申的解决方案作为一个线性微分方程组的解决方案。我们得到强和弱的截断过程的误差界,并表明,在适当的条件下,均方误差的收敛顺序$\mathcal{O}(\frac{1}{m})$和二阶矩有一个弱的收敛顺序$\mathcal{O}(\frac{1}{m})$,其中$m$表示的大小的扩展。我们还讨论了有效的数值线性代数技术来近似一系列的矩阵函数和线性化系统的微分方程。这些理论结果的支持实验表明,我们的算法相比,标准的方法,如欧拉-丸山计划的有效性。

英文摘要:

We consider linearizations of stochastic differential equations with additive noise using the Karhunen-Loève expansion. We obtain our linearizations by truncating the expansion and writing the solution as a series of matrix-vector products using the theory of matrix functions. Moreover, we restate the solution as the solution of a system of linear differential equations. We obtain strong and weak error bounds for the truncation procedure and show that, under suitable conditions, the mean square error has order of convergence $\mathcal{O}(\frac{1}{m})$ and the second moment has a weak order of convergence $\mathcal{O}(\frac{1}{m})$, where $m$ denotes the size of the expansion. We also discuss efficient numerical linear algebraic techniques to approximate the series of matrix functions and the linearized system of differential equations. These theoretical results are supported by experiments showing the effectiveness of our algorithms when compared to standard methods such as the Euler-Maruyama scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑