An Optimal Polynomial Approximation of Brownian Motion

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong Approximation of Brownian Motion

Simple random walk and Brownian motion are two strongly interconnected mathematical concepts. They are widely involved in not only pure math, but also in many other scientific fields. In this paper I will first introduce and define some basic concepts of discrete-time random walk. Then I will construct Brownian Motion with some basic properties, and use a method called the strong approximation ...

متن کامل

An optimal series expansion of the multiparameter fractional Brownian motion ∗

We derive a series expansion for the multiparameter fractional Brownian motion. The derived expansion is proven to be rate optimal .

متن کامل

Optimal pointwise approximation of stochastic differential equations driven by fractional Brownian motion

We study the approximation of stochastic differential equations driven by a fractional Brownian motion with Hurst parameter H > 1/2. For the mean-square error at a single point we derive the optimal rate of convergence that can be achieved by any approximation method using an equidistant discretization of the driving fractional Brownian motion. We find that there are mainly two cases: either th...

متن کامل

Optimal Pointwise Approximation of Sdes Based on Brownian Motion at Discrete Points

We study pathwise approximation of scalar stochastic differential equations at a single point. We provide the exact rate of convergence of the minimal errors that can be achieved by arbitrary numerical methods that are based (in a measurable way) on a finite number of sequential observations of the driving Brownian motion. The resulting lower error bounds hold in particular for all methods that...

متن کامل

Filtering Motion Data Through Piecewise Polynomial Approximation

In this work we propose a system to filter human movement data and store them into a compact representation. We are interested both in noise reduction and in segmentation. The method described in this paper relies on a iterative optimization and guarantee to converge to a local optimum: it proved anyway to produce stable results and to provide an accurate segmentation on the analyzed data . We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Numerical Analysis

سال: 2020

ISSN: 0036-1429,1095-7170

DOI: 10.1137/19m1261912