CC BY
6^HHaMH^ecKHe CHCTemM, tom 3(31), No. 3-4, 275-280
MSC 2010: 46E30
Rectangle formula with randomly shifted knots
K. V. Runovski*, A. B. Vints**
*The Kyiv State Maritime Academy named after hetman Petro Konashevich- Sahaydachniy Sevastopol 99045. E-mail: k_runov@mail.ru "Taurida National V. I. Vernadsky University, Simferopol 95007. E-mail: venkman@inbox.ru
Abstracts. The classical rectangle formula of calculating integrals is modified to be applicable to L2-functions by using the method of approximation by families of linear operators. The algorithm of numerical integration is developed according to the modified formula and its approximation properties dependent on the input parameters and function to be integrated are evaluated
Keywords: families of linear operators, piecewise constant functions, cubature formulas, modulus of continuity, stochastic approximation
Introduction
In this paper we study the classical rectangle formula with randomly shifted knots (see e. g. [2]) and we show that such a method is relevant for the numerical integration of square-integrable functions. Our approach is based on applying the method of approximation by families of piecewise constant functions systematically studied in [1]. More precisely, we discuss the following formula
1
1 n-1 /- \
f (x) dx ~ f*( - + a) , f* £ L2 ,n £ N, (0.1)
u— n V /
0
nn k=0
where L2 is the space of 1-periodic square-integrable functions equipped with the standard norm, f * is a periodic extension of f and A is a uniformly distributed on [0,1) random variable. For the sake of simplicity we denote the left-hand side and the right-hand side of (0.1) by I(f) and In;x(f), respectively.
By the symbol Cn we denote the set
Cn --Cn,T ,
t eR
where Cn,T, t G R, is the space of 1-periodic functions f (x) satysfying f (x + t) — ck for x G [ n, ^nr), k — 0,1,.. .,n - 1. Clearly, Cn,\ — Cn x+1. Following [1], we define the family of operators mapping L2 into the space Cn, n G N of piecewise constant functions by (A is a real parameter)
1 n-1
In-, x(f ; x) = -v f(- + a) kJx---n £ N , (0.2)
n n n
k=0
© K. V. RUNOVSKI, A. B. VINTS
where the 1-periodic function Kn given on the period by setting
n,h €
Kn(h) =
1
0, -n
0, h €
1
-, 1 n
(0.3)
is called kernel.
Dealing with families (0.2) we consider functions in L2([0,1)2), which depending on two variables x and A. We use the symbol || • ||r2i to denote the corresponding norm, i. e.,
1 1
II f II [2] = (J f I f(x,A) |2 dxdA)1/2 . (0.4)
0 0
As it was shown in [1], the quality of approximation by families (0.2) can be described in terms of the modulus of continuity given by
u(f, 5) = sup II f *(x + h) - f *(x) 112 , 0 < 5 < 1, (0.5)
0<h<S
More precisely, the following inequality holds.
II f -In; X(f) II [2] < 9 U(f,n-1) , f € L2 , n & N , (0.6)
The paper is organized as follows. The main result on quality of formula (0.1) is formulated and proved in Section 1. Section 2 is devoted to description of the corresponding algorithm of numerical integration. In Section 3 the table demonstrating the approximating properties of the algorithm is placed.
1. Main result
In this section P{A} denotes the probability of an event A. The symbols E and D stand for mathematical expectation and variance, respectively.
Theorem. Let m & N and r/j, j = 1,---,m, be independent random variables uniformly distributed on [0,1], dj = nj In, j = 1,...,m. Then for f & L2, n & N and e > 9m-1/2u(f, n-1)
P{\lE ^ j (f) - <*} > 1 - ( j=i
9u(f,n-1)
me
(1.1)
Proof. Taking into account that the function In;\(f) is n 1 -periodic and
dF0j (A) = nd\, A e [0, n)
(1.2)
for j = 1,... ,m, where FOj is the distribution function of dj, we get by the definitions of expectation and variance
n 1
E ( In; Oj (f) ) = E ( In; O1 (f))= nj In; x(f) dA = j In; x(f) dA = I(f) , (1.3)
V
(In; в, (/))= D ( In; в1 (/)) = E (( In; в, (/) -E ( In; в, (/)) )2 )
n У (In; л(/) - nj In; t(/) dt) 2 d\ = J \ In; л(/) - I (/) |2 d\ . (1.4)
0
л(/) - ny Jra:
0
In view of the Chebyshev inequality and (1.3) the left-hand side of (1.1) can be estimated from below by
1 - d( m z In;e, (/о
j=i
(1.5)
As the values In; Oj are independent and they have one and the same distribution law, we get
D(mE In;вj (/)) = m-2 E D(In;в, (/)) = m-1 D{In;в, (/)) .
j=i
j=i
(1.6)
Combining (1.4)-(1.6) we get
p{\mE In;в,(/) -1(/)\ <4 ^ 1 - e j=i
21 2 m 1
In;л(/) - I(/) dX. (1.7
Applying (0.6) in combination with Holder inequality and taking into account that
1
J In; л(/,х) dX = In; л(/) ,
(1.8)
we get
1 1
j\I (/) - In; л(/)\2 dX J\ / (x) -In; л(/, x) \ dx) 2dX (1.9
00
and
1 1
J ( J \ /(x)-In;л(/,х) \ dx)2dX <|| /-In;л(/) 1122] < 81 u(/,n-1)2 . (1.10
1
1
1
That means P<
{IroE j (/) " I(/)|<4 - 1 _ 81 e"2 w(f'n-1)2 = m j=i
= 1 _ (9 f-1))2 ^ (111)
V -J me J
The proof is complete. □
2. Computational aspects
In this section we describe the algorithm of numerical integration of L2-functions based on Theorem above. It has the following input parameters:
(i) / € L2 — function to be integrated;
(ii) e € (0, — approximation error;
(iii) a € (0,1) — probability error;
(iv) n € N — number of knots or volume of the grid;
(v) m € N — number of random shifts of the grid.
The parameters e, a, n and m are dependent on each other. If the approximation error and probability error are given, then we are looking for n and m satisfying
P
m
{|mE nj(f) - f <4 ^1 - ^' (2Л
m
3 = 1
If the estimate from above for the modulus of continuity is known, i. e., w(/, S) < w(S) for 0 < S < 1, in view of (1.1) it is sufficient to require
cn = 9 w(n-1) < ■Jmae (2.2)
in order to achieve the desired level of both the approximation and probability errors.
The computational procedure can be described as follows. First we choose independent uniformly distributed on [0,1) random variables nj, j = 1, ■ ■ ■ ,m, and we determine dj = Vj/n, j = 1, ■ ■ ■ ,m. After that we compute the numbers
n- 1
n j (/) = -E/[n + j , (j = 1,---,m) ■ k=0 V 7
Finally we calculate
(2.3)
1 m— 1
pn (f ;Ф) = -EJn; j (f) ' (Ф = { = 1,''' }) ' (2.4)
, , в
m
3 = 1
By Theorem and (2.2) this number satisfies (2.1), i. e., it approximates I(f) up to e with the probability at least 1 — a.
Relation (2.2) can be fulfilled in some different ways. If n is given, its left-hand side cn is a constant and the prescribed level of errors is achieved by choosing the parameter m only. Taking into account that it should be chosen as small as possible we get from (2.2) the explicit formula for its optimal value
m=
ae2
+ 1
(2.5)
2
c
n
It is interesting to notice that the classical Monte-Carlo method is a special case of our method corresponding to n = 1. It is convenient, if we lack information on the smoothness properties of a given function f or f is "bad" in the sense that its modulus of continuity tends to 0 slowly. On the other hand, m is the only parameter which is responsible for both errors. Thus, the Monte-Carlo method being quite universal does not take into account any information on the smoothness properties of a function to be approximated.
If we a priori determine m , the necessary level of errors can be reached by increasing the parameter n. It is an effective and economic way of calculations, if a given function has a"good" smoothness in L2. Indeed, in contrast to the Monte-Carlo method it is not necessary now to increase the number of random variables, in order to achieve the desired approximation error, that is, we do not need to be "too careful" when choosing the generator of random variables we would like to use. Reminding the well-known principle that the greater m, the "better" generator should be, we avoid in such a way one of the most complicated technical problems, which does always arise, if stochastic approaches are applied.
In a certain sense, our method with fixed m is close to the classical rectangle formula, which can be interpreted as the degenerated case of the general situation corresponding formally to m = 0. On the other hand, its properties are much better than the properties of classical cubatures. Indeed, in contrast to the rectangle formula with fixed nodes, which is applicable only for continuous functions, we can integrate functions in L2, even, if m = 1. Moreover, the approximation error is estimated by the L2-modulus of continuity, which is less than the classical modulus of continuity in the uniform metric.
3. Table of practical results
In this section we present the results obtained by program which implements the previously mentioned algorithm. The program integrated the function f (x) = sin(1|x) which is strongly oscillating. So, the classical cubature formulas and algorithms of numerical integration would be ineffective applied to this function.
K. V. RUNOVSKI, A. B. VINTS Таблица 1. The average approximation error depending on n and m
n m Average approximation error
100 100 10"3
100 1000 4•10"4
100 10000 1.5 • 10"4
100 100000 5.3 • 10"5
1000 100 2•10"4
1000 1000 6•10"5
1000 10000 2•10"5
1000 100000 5.5 • 10"6
10000 100 4.5 • 10"5
10000 1000 1.5 • 10"5
10000 10000 4•10"6
100000 100 8.5 • 10"6
100000 1000 2•10"6
Alas, in virtue of the computing capabilities of computer used these are the maximum values that could be obtained during the reasonable time. However, with the aid of the modern computers one can easily integrate strongly oscillating functions with minor approximation errors.
References
1. Runovski K. V., Vints A. B. Approximation by families of piecewise constant functions. // Uchenye Zapiski Tavricheskogo Natsyonal'nogo Universiteta. — Vol. 26(65), no. 1. — 2013 — p. 132-139.
2. Sloan I. H., Kuo F. Y, Joe S. Constructing randomly schifted lattice rules in weighted Sobolev spaces. // SIAM J. Numer. Anal. — Vol. 40, no. 5. — 2002 — p. 1650-1665.
Получена 17.10.2013
