近似随机过程的新算法和快速实现
New Algorithms And Fast Implementations To Approximate Stochastic Processes
摘要:
我们提出了新的算法和快速实现,以找到有效的近似建模随机过程。对于许多数值计算来说,建立随机过程的有限近似是必不可少的。虽然目标总是找到有限模型,其尽可能准确地表示关于真实数据过程的给定知识,但是估计离散近似模型的方式可能完全不同:(i)如果随机模型已知为随机微分方程的解,例如,可以直接从指定的模型生成场景树;(i i)如果允许从所有条件分布模拟轨迹的模拟算法可用,则可以通过随机逼近来生成场景树;(iii)如果场景过程的仅一些观测轨迹可用,则逼近过程的构造可以基于非参数条件密度估计。
英文摘要:
We present new algorithms and fast implementations to find efficient approximations for modelling stochastic processes. For many numerical computations it is essential to develop finite approximations for stochastic processes. While the goal is always to find a finite model, which represents a given knowledge about the real data process as accurate as possible, the ways of estimating the discrete approximating model may be quite different: (i) if the stochastic model is known as a solution of a stochastic differential equation, e.g., one may generate the scenario tree directly from the specified model; (ii) if a simulation algorithm is available, which allows simulating trajectories from all conditional distributions, a scenario tree can be generated by stochastic approximation; (iii) if only some observed trajectories of the scenario process are available, the construction of the approximating process can be based on non-parametric conditional density estimates.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。