Spline approximation of a random process with singularity Konrad - - PowerPoint PPT Presentation

spline approximation of a random process with singularity
SMART_READER_LITE
LIVE PREVIEW

Spline approximation of a random process with singularity Konrad - - PowerPoint PPT Presentation

Spline approximation of a random process with singularity Konrad Abramowicz Department of Mathematics and Mathematical Statistics Ume a university Paris, COMPSTAT Conference, 2010 1 / 28 Coauthor: Oleg Seleznjev Department of Mathematics


slide-1
SLIDE 1

Spline approximation of a random process with singularity

Konrad Abramowicz

Department of Mathematics and Mathematical Statistics Ume˚ a university

Paris, COMPSTAT Conference, 2010

1 / 28

slide-2
SLIDE 2

Coauthor: Oleg Seleznjev

Department of Mathematics and Mathematical Statistics Ume˚ a university

2 / 28

slide-3
SLIDE 3

Outline

1 Introduction. Basic Notation 2 Results

Optimal rate recovery

3 Numerical Experiments

3 / 28

slide-4
SLIDE 4

Suppose a random process X(t), t ∈ [0, 1], with finite second moment is

  • bserved in a finite number of points (sampling designs). At any

unsampled point t, we approximate the value of the process by a composite Hermite spline. The approximation performance on the entire interval is measured by mean errors. In this talk we deal with two problems:

❼ Investigating accuracy of such interpolator in mean norms ❼ Constructing a sequence of sampling designs with asymptotically

  • ptimal properties

4 / 28

slide-5
SLIDE 5

Basic notation

Let X = X(t), t ∈ [0, 1], be defined on the probability space (Ω, F, P). Assume that, for every t, the random variable X(t) lies in the normed linear space L2(Ω) = L2(Ω, F, P) of zero mean random variables with finite second moment and identified equivalent elements with respect to P. We set ||ξ|| =

  • Eξ21/2 for all ξ ∈ L2(Ω) and consider the approximation by

piecewise linear interpolator, based on the normed linear space C m[0, 1] of random processes having continuous q.m. (quadratic mean) derivatives up to order m ≥ 0. We define the integrated mean norm for any X ∈ C m[0, 1] by setting ||X||p = 1 ||X(t)||pdt 1/p , 1 ≤ p < ∞, and the uniform mean norm ||X||∞ = max[0,1] ||X(t)||.

5 / 28

slide-6
SLIDE 6

Local H¨

  • lder’s condition

We say that X ∈ Cm,β([a, b], V (·)) if X ∈ Cm([a, b]) and X(m) is locally H¨

  • lder continuous, i.e., if for all t, t + s, ∈ [a, b],

|| X(m)(t + s) − X(m)(t) || ≤ V (¯ t)1/2|s|β, 0 < β ≤ 1, (1) for a positive continuous function V (t), t ∈ [a, b], and some ¯ t ∈ [t, t + s]. In particular, if V (t) = C, t ∈ [a, b], where C is a positive constant, then X(m) is H¨

  • lder continuous, and we denote it by X ∈ Cm,β([a, b], C)

6 / 28

slide-7
SLIDE 7

Local stationarity

Following Berman(1974) we call process X(t), t ∈ [a, b] ⊆ [0, 1], locally stationary if there exists a positive continuous function c(t) such that, for some 0 < β ≤ 1, lim

s→0

||X(t + s) − X(t)|| |s|β = c(t)1/2, uniformly in t ∈ [a, b]. We denote the class of processes which m-th q.m. satisfy the above condition over [a, b] by Bm,β([a, b], c(·)).

7 / 28

slide-8
SLIDE 8

We say that X ∈ CBm,β((0, 1], c(·), V (·)) if there exist 0 < β ≤ 1 and positive continuous functions c(t), V (t), t ∈ (0, 1], such that X ∈ Cm,β([a, b], V (·)) and X ∈ Bm,β([a, b], c(·)) for any [a, b] ⊂ (0, 1].

8 / 28

slide-9
SLIDE 9

Processes of interest

Let X(t), t ∈ [0, 1], such that, X ∈ Cl,α([0, 1], M) ∩ CBm,β((0, 1], c(·), V (·)).

❼ ❼ ❼

9 / 28

slide-10
SLIDE 10

Processes of interest

Let X(t), t ∈ [0, 1], such that, X ∈ Cl,α([0, 1], M) ∩ CBm,β((0, 1], c(·), V (·)). Example: X(t) = B( √ t), t ∈ [0, 1], where B(t), t ∈ [0, 1], is a fractional Brownian motion with Hurst parameter H and the covariance function r(t, s) = (|t|2H + |s|2H − |t − s|2H)/2

❼ l = 0, α = H/2 ❼ m = 0, β = H ❼ c(t) = V (t) = (4t)−H

10 / 28

slide-11
SLIDE 11

Hermite spline

Suppose that for X ∈ Cm([0, 1]), the process and its first r ≤ m derivatives can be sampled at the distinct design points Tn = (t0, t1, . . . , tn), 0 = t0 < t1 < . . . < tn = 1. The stochastic Hermite spline of order k = 2r + 1 ≤ 2m + 1, denoted by Hk(X, Tn) is a unique solution of the interpolation problem H(j)

k (ti) = X(j)(ti),

i = 0, . . . , n, j = 0, . . . , r.

11 / 28

slide-12
SLIDE 12

Composite Hermite spline

Define Hq,k(X, Tn), q ≤ k, to be a composite Hermite spline Hq,k(X, Tn) := Hq(X, Tn)(t), t ∈ [0, t1] Hk(X, Tn)(t), t ∈ [t1, 1] .

❼ ❼

12 / 28

slide-13
SLIDE 13

Composite Hermite spline

Define Hq,k(X, Tn), q ≤ k, to be a composite Hermite spline Hq,k(X, Tn) := Hq(X, Tn)(t), t ∈ [0, t1] Hk(X, Tn)(t), t ∈ [t1, 1] . Examples:

❼ ❼

t1 t 2 t3

13 / 28

slide-14
SLIDE 14

Composite Hermite spline

Define Hq,k(X, Tn), q ≤ k, to be a composite Hermite spline Hq,k(X, Tn) := Hq(X, Tn)(t), t ∈ [0, t1] Hk(X, Tn)(t), t ∈ [t1, 1] . Examples:

❼ H1,1 (piecewise linear interpolator) ❼

t1 t 2 t3

14 / 28

slide-15
SLIDE 15

Composite Hermite spline

Define Hq,k(X, Tn), q ≤ k, to be a composite Hermite spline Hq,k(X, Tn) := Hq(X, Tn)(t), t ∈ [0, t1] Hk(X, Tn)(t), t ∈ [t1, 1] . Examples:

❼ H1,1 (piecewise linear interpolator) ❼ H1,3

t1 t 2 t3

15 / 28

slide-16
SLIDE 16

quasi Regular Sequences

We consider quasi regular sequences (qRS) of sampling designs {Tn = Tn(h)} generated by a density function h(·) via ti h(t)dt = i n, i = 1, . . . , n, where h(·) is continuous for t ∈ (0, 1] and if h(·) is unbounded in t = 0, then h(t) → +∞ as t → +0. We denote this property of {Tn} by: {Tn} is qRS(h).

16 / 28

slide-17
SLIDE 17

Regularly varying function

Recall that a positive function f(·) is called regularly varying (on the right) at the origin with index ρ, if for any λ > 0, f(λx) f(x) → λρ as x → 0+, and denote this property by f ∈ Rρ(O+). A natural example of such function is a power function, i.e., f(x) = xa ∈ Ra(O+). Moreover we say that g ∈ Rρ(r(·), 0+) if there exists r(x) ≥ g(x), x ∈ [0, 1] such that r ∈ Rρ(O+).

17 / 28

slide-18
SLIDE 18

Previous Results

❼ (Seleznjev, Buslaev 1999)

Optimal approximation rate for linear methods for X ∈ C l,α[0, 1] is n−(l+α)

❼ (Seleznjev, 2000)

Results on Hermite spline approximation when X ∈ Bl,α([0, 1], c(·)) and regular sequences of sampling designs are used ||X − Hk(X, Tn)|| ∼ n−(l+α) as n → ∞, m ≤ k.

18 / 28

slide-19
SLIDE 19

Problem formulation

We have a process which l-th derivative is α-H¨

  • lder on [0, 1].

Can we get the approximation rate better than n−(l+α)?

19 / 28

slide-20
SLIDE 20

Let us define: H(t) = t

0 h(v)dv, G(s) = H−1(s), and g(s) = G′(s),

t, s ∈ [0, 1].

20 / 28

slide-21
SLIDE 21

Let us define: H(t) = t

0 h(v)dv, G(s) = H−1(s), and g(s) = G′(s),

t, s ∈ [0, 1]. Let X ∈ Cl,α([0, 1], M) ∩ CBm,β((0, 1], c(·), V (·)). We formulate the following condition for a local H¨

  • lder function V and a sequence generating density h:

(C) let g ∈ R+(r(·), 0+), where r(s) = o(s(m+β)/(l+α+1/p)−1) as s → 0; (2) if p = ∞, then V (t)1/2r(H(t))m+β → 0 as t → 0; if 1 ≤ p < ∞ and, additionally, V (G(·))1/2 ∈ R+(R(·), 0+), then R(H(t))r(H(t))m+β ∈ Lp[0, b] for some b > 0.

21 / 28

slide-22
SLIDE 22

Optimal rate recovery

Theorem

Let X ∈ Cl,α([0, 1], M) ∩ CBm,β((0, 1], c(·), V (·)), l + α ≤ m + β, with the mean f ∈ Cm,θ([0, 1], C), β < θ ≤ 1, be interpolated by a composite Hermite spline Hq,k(X, Tn), l ≤ q, m ≤ k, where Tn is a qRS(h). Let for the density h and the local H¨

  • lder function V , the condition (C) hold. Then

lim

n→∞ nm+β||X − Hq,k(X, Tn)||p = bm,β k,p ||c1/2h−(m+β)||p > 0.

(3)

22 / 28

slide-23
SLIDE 23

Example

X(t) = B( √ t), t ∈ [0, 1], where B(t), t ∈ [0, 1], is a fractional Brownian motion with Hurst parameter H = 0.8. Then X ∈ C0,0.4([0, 1], 1) ∩ CB0,0.8((0, 1], c(·), V (·)), where c(t) = V (t) = (4t)−0.8.

23 / 28

slide-24
SLIDE 24

Example

X(t) = B( √ t), t ∈ [0, 1], where B(t), t ∈ [0, 1], is a fractional Brownian motion with Hurst parameter H = 0.8. Then X ∈ C0,0.4([0, 1], 1) ∩ CB0,0.8((0, 1], c(·), V (·)), where c(t) = V (t) = (4t)−0.8. We consider the following knot densities hλ(t) = 1 λt

1 λ −1,

t ∈ (0, 1], λ > 0, say, power densities.

24 / 28

slide-25
SLIDE 25

We consider the mean maximal approximation error of the piecewise linear interpolator, and compare the efficiency of the designs generated by the power densities with parameters

❼ λ1 = 1 (uniform knots distribution) ❼ λ2 = 2.1

25 / 28

slide-26
SLIDE 26

3 3.5 4 4.5 5 5.5 6 6.5 7 7 6 5 4 3 2 log(n) 1 2

Figure: Comparison of the uniform mean errors for the uniform density hλ1(·) and hλ2(·) in a log-log scale.

The plot corresponds to the following asymptotic behavior of the approximation errors: en(hλ1) ∼ C1 n−0.4, C1 ≃ 0.377, en(hλ2) ∼ C2 n−0.8, C2 ≃ 0.295 as n → ∞. For example, the minimal number of observations needed to obtain the accuracy 0.01 is approximately 8727 for the equidistant sampling density hλ1, whereas it needs only 69 knots when hλ2 is used, i.e., Theorem 1 is applicable.

26 / 28

slide-27
SLIDE 27

50 100 150 200 250 300 350 400 450 500 0.29 0.295 0.3 0.305 0.31 0.315 0.32 0.325 0.33 0.335 n

Figure: Convergence of the n0.8 scaled uniform mean errors to the asymptotic constant for the generating density h2(·).

27 / 28

slide-28
SLIDE 28

Thank you !

28 / 28