High Dimensional Integration: New Weapons Fighting the Curse of Dimensionality

Similar documents
c Springer Verlag. The copyright for this contribution is held by Springer Verlag. The original publication is available at

Dyadic diaphony of digital sequences

Numerical Methods in Economics MIT Press, Chapter 9 Notes Quasi-Monte Carlo Methods. Kenneth L. Judd Hoover Institution.

f(x n ) [0,1[ s f(x) dx.

arxiv: v1 [math.co] 8 Feb 2013

NEW SEQUENCES FROM OLD: A SEARCH FOR LOW DISCREPANCY SEQUENCES. Jarvis Haupt

Quasi- Monte Carlo Multiple Integration

Improved Discrepancy Bounds for Hybrid Sequences. Harald Niederreiter. RICAM Linz and University of Salzburg

Chapter 8 Indeterminate Forms and Improper Integrals Math Class Notes

uniform distribution theory

A LeVeque-type lower bound for discrepancy

On the existence of higher order polynomial. lattices with large figure of merit ϱ α.

Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )

DIGITAL EXPANSION OF EXPONENTIAL SEQUENCES

QMC methods in quantitative finance. and perspectives

arxiv: v5 [math.ca] 23 Jan 2016

Uniform distribution of sequences connected with the weighted sum-of-digits function

Lecture 4: Numerical solution of ordinary differential equations

Abstract. 2. We construct several transcendental numbers.

APPLIED MATHEMATICS REPORT AMR04/16 FINITE-ORDER WEIGHTS IMPLY TRACTABILITY OF MULTIVARIATE INTEGRATION. I.H. Sloan, X. Wang and H.

Quasi-Monte Carlo Algorithms with Applications in Numerical Analysis and Finance

Mathematical Methods for Physics and Engineering

2 K. ENTACHER 2 Generalized Haar function systems In the following we x an arbitrary integer base b 2. For the notations and denitions of generalized

Digital lattice rules

Random and Quasi-Random Point Sets

On the inverse of the discrepancy for infinite dimensional infinite sequences

epub WU Institutional Repository

Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed?

A NEW UPPER BOUND ON THE STAR DISCREPANCY OF (0,1)-SEQUENCES. Peter Kritzer 1. Abstract

1 Which sets have volume 0?

1. Introduction. In this paper we consider stochastic optimization problems of the form

Part 2 Continuous functions and their properties

Introduction to Discrepancy Theory

uniform distribution theory

The Discrepancy Function and the Small Ball Inequality in Higher Dimensions

Tutorial on quasi-monte Carlo methods

NORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY

11.8 Power Series. Recall the geometric series. (1) x n = 1+x+x 2 + +x n +

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1

LECTURE 22: INTEGRATION ON MANIFOLDS. 1. Orientations

The Halton sequence and its discrepancy in the Cantor expansion

Counting patterns in digital expansions

f(s) e -i n π s/l d s

Tractability of Multivariate Problems

Convergence of greedy approximation I. General systems

A NOTE ON ALMOST PERIODIC VARIATIONAL EQUATIONS

Hyperuniformity on the Sphere

Non-linear wave equations. Hans Ringström. Department of Mathematics, KTH, Stockholm, Sweden

Low-discrepancy constructions in the triangle

An introduction to Mathematical Theory of Control

Chapter 31. The Laplace Transform The Laplace Transform. The Laplace transform of the function f(t) is defined. e st f(t) dt, L[f(t)] =

Progress in high-dimensional numerical integration and its application to stochastic optimization

Uniformly distributed sequences of partitions

Mathematics for Economists

A List of Problems in Real Analysis

LS-sequences of points in the unit square

Scientific Computing

Taylor and Laurent Series

Constructing Guaranteed Automatic Numerical Algorithms for U

CALCULUS JIA-MING (FRANK) LIOU

The Hilbert Transform and Fine Continuity

Verona Course April Lecture 1. Review of probability

1 Math 241A-B Homework Problem List for F2015 and W2016

THE DISCREPANCY OF GENERALIZED VAN-DER-CORPUT-HALTON SEQUENCES

Strictly Positive Definite Functions on the Circle

Integral representations in models with long memory

Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012

Partial Differential Equations, 2nd Edition, L.C.Evans Chapter 5 Sobolev Spaces

Physics 411 Lecture 7. Tensors. Lecture 7. Physics 411 Classical Mechanics II

Scenario generation in stochastic programming

Monte Carlo Method for Numerical Integration based on Sobol s Sequences

Note that in the example in Lecture 1, the state Home is recurrent (and even absorbing), but all other states are transient. f ii (n) f ii = n=1 < +

CSCI-6971 Lecture Notes: Monte Carlo integration

Chapter 8. Infinite Series

Importance Sampling to Accelerate the Convergence of Quasi-Monte Carlo

Raktim Bhattacharya. . AERO 632: Design of Advance Flight Control System. Norms for Signals and Systems

SINGULAR INTEGRALS ON SIERPINSKI GASKETS

Pseudorandom Sequences II: Exponential Sums and Uniform Distribution

L p -convergence of Bernstein Kantorovich-type operators. by Michele Campiti (Bari) and Giorgio Metafune (Lecce)

2 2 + x =

Approximation numbers of Sobolev embeddings - Sharp constants and tractability

Received: 2/7/07, Revised: 5/25/07, Accepted: 6/25/07, Published: 7/20/07 Abstract

SJÄLVSTÄNDIGA ARBETEN I MATEMATIK

Infinite Series Summary

lim when the limit on the right exists, the improper integral is said to converge to that limit.

On the law of the iterated logarithm for the discrepancy of lacunary sequences

IEOR 6711: Stochastic Models I Fall 2013, Professor Whitt Lecture Notes, Thursday, September 5 Modes of Convergence

Both these computations follow immediately (and trivially) from the definitions. Finally, observe that if f L (R n ) then we have that.

MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem.


Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

A CENTRAL LIMIT THEOREM FOR NESTED OR SLICED LATIN HYPERCUBE DESIGNS

INTERPOLATION. and y i = cos x i, i = 0, 1, 2 This gives us the three points. Now find a quadratic polynomial. p(x) = a 0 + a 1 x + a 2 x 2.

Analytic families of multilinear operators

DIMENSIONS OF JULIA SETS OF HYPERBOLIC ENTIRE FUNCTIONS

Multiple Random Variables

EE1 and ISE1 Communications I

Lower Tail Probabilities and Normal Comparison Inequalities. In Memory of Wenbo V. Li s Contributions

Lecture Quantitative Finance Spring Term 2015

Fractional Derivatives of Weierstrass-Type Functions

Transcription:

High Dimensional Integration: ew Weapons Fighting the Curse of Dimensionality Peter Zinterhof Technical Report 26-4 October 26 Department of Computer Sciences Jakob-Haringer-Straße 2 52 Salzburg Austria www.cosy.sbg.ac.at Technical Report Series

HIGH DIMESIOAL ITEGRATIO: EW WEAPOS FIGHTIG THE CURSE OF DIMESIOALITY P.Zinterhof Department of Computer Sciences, University of Salzburg DEDICATED TO THE MEMORY OF.M. KOROBOV ITRODUCTIO The approximate computation of the definite integral of a function of several variables is one of the basic problems of numerical analysis. The problem is hard because of the so called curse of dimensionality. This curse consists of the following: applying an integration rule with nodes to an univariate function, you will get an integration error, say, ε >. Applying the corresponding cartesian product rule to a s-variate function, you will need s nodes for the same integration error ε >. In mechanics we deal with at least six-dimensional functions, but in contemporary financial mathematics occur 3-variate functions. The probabilistic Monte-Carlo-Methods provide error estimates independent of the dimensionality of the problem. Unfortunately these methods are both slow in convergence end suffer of a lack of effectiveness as well. The Quasi-Monte-Carlo-Methods, based on number theory, are working fast and effectively, at least in the case of finite and smooth integrands. Unfortunately, in reality multivariate functions with singularities do occur. The scope of the present paper is numerical integration of multivariate functions with singularities. In many cases the proposed methods are best possible with respect to the order of convergence. Best possible means an exact order of the error term, essentially not worse than in the univariate case.. THE PROBLEM SETTIG Consider functions f(x, x 2,..., x s ) = y, x ρ, ρ =,..., s. Let I s = (, ) s the open unit cube, and Īs = [, ] s the closed s-dimensional unit cube. We are concerned with the numerical approximation of the integral of the function f by means of finite sums. Given a finite set of points in I s or Īs, (x (), x(2) we consider the integration method R =,..., x(s) ),..., (x() n, x (2) n f(x () n,..., x(s) n )...,..., x (s) n ),..., (x (),..., x(s) ), f(x,..., x s )dx... dx s () One is interested in small values of R, of course. Some known results: If the pointed (x () n,..., x (s) n ), n =,...,, is a set of uniform distributed and independent random variables, one receives the domical estimation of Monte-Carlo-Integration:

2 ( ) R = O (2) This convergence rate is rather poor, but independent of the dimensionality of the problem and independent of the smoothness of the function f(x,..., x s ). othing is said about the constants involved. On the other hand we consider the Cartesian Product Rules: Let x, x 2,..., x Īs and y = f(x) be a continuous function on Ī = [, ]. So we have an one-dimensional integration rule R () = f(x n ) f(x)dx (3) The principle of the cartesian product rules consists of a repeated application of the onedimensional rule to a s-variate function: R (s) s = s n = f(x n,..., x ns ) n s= f(x,..., x s )dx... dx s (4) The error term R (s) will not be better than s R(), in general. But the computational complexity is s. This fact is the well known Curse of Dimensionality. There are to remedies: The inequality of Hlawka-Koksma and Korobovs method: Let x, x 2,..., x Īs. Let I( a) = x : x ρ a ρ, ρ =,..., s, a Īs. Definition: D := sup a #{x n I( a)} a a 2... a s (5) is called the *-discrepancy (star discrepancy) of the finite point set x,..., x. The following theorem is essentially due to H. Weyl: Weyl s Criterion: The infinite sequence ( x n ), x n Īs, is uniform distributed if one of the following conditions holds: (a) for all continuous functions f : Īs holds lim f( x n ) = f( x)d x (6) Ī s (b) for all m s holds lim e 2πi m xn = { m m = (7)

3 (c) lim D = Weyl s criterion is the guideline for numerical application of number theoretical methods. At first we cite the Hlawka-Koksma-Inequality: Theorem: (Hlawka): Let f( x) be a function with bounded variation in the sense of Hardy-Krause, V (f( x)) <. Then holds the inequality R (f) = f( x) f( x)d x Ī D V (f) (8) s There is a huge number of estimations of the discrepancy of special sequences. We give only two examples. Example : Let x n,...,n s = ( n, n2,..., ) ns, n,..., n s =,...,. Then D s 2s. This also means the Curse of Dimensionality. Example 2: Let (a,..., a s ) s be optimal coefficients modulo in the sense of Korobov. Let x n = ( na,..., ) nas mod n, n =,...,. Then ( ) D = O (ln ) β, β s, (9) holds. Apart of the logarithmic factor this estimation is independent of the dimensionality of the problem. Unfortunately, the Hlawka-Koksma-inequality does not take into account additional smoothness conditions of the function f( x). Korobovs method overcomes this flaw: Let m = max(, m ), m. Consider the Korobov classes } Es {f( x) α (C) = C : C( m) ( m,..., m s ) α, m s, () where C( m) means the Fouriercoefficients of f( x): C( m) = f( x)e 2πi m x d x () Ī s Remark: If f( x) is -periodic in each variable x,..., x s, and if αs f α x,..., α x is continuous and bounded by C, then f E α s (C). This can be shown by αs-fold partial integrations of formular ().

4 Theorem: (Korobov): If f( x) Es α(c)and if a = (a,..., a s ) consists of optimal coefficients in the sense of Korobov, then the estimation holds: R (f) = f( n a ) f( x)d x Ī C C(ln αβ ) α, (2) s with an explicit constant C and some β s. This estimation is best possible apart from logarithmic factors: There is always a function f( x) Es α (C), such that f( n a ) f( x)d x Ī C(s)lns () α. (3) s More general, there is no integration rule with R = o ( α ), if f E α s. All this methods are classical and can be found in Korobov [3], Drmota-Tichy [] or iederreiter [2]. The methods described are concerned only with proper integrals of bounded functions. Singularities are not allowed. From the theoretical and also from the practical point of view it is important to develop integration rules for unbounded functions as well: Problem: Let f( x): Ī s or I s. Find classes of unbounded functions f and integration rules g n,f( x n ), such that lim g n, f( x n ) = f( x)d x. (4) I s Furthermore, give estimations for the error term R = g n, f( x n ) f( x)d x. (5) I s 2. SOLUTIOS OF THE PROBLEM We distinguish the two cases: First case: The location of the singularities of f( x) in Īs is unknown. Second case: The location of the singularities is known. We assume, that f( x) is unbounded at most on the bonudary of I s = (, ) s. For the sake of completeness we refer some of own former results [4]. Given a function f : Īs, so we define functions f B, ˆf B, B > such that

5 f B ( x) = f( x), if f( x) B =, if f( x) > B ˆf B ( x) =, if f( x) B = f(x), if f( x) > B (6) (7) So we have f( x) = f B ( x) + ˆf B ( x). We gave a suitable class of functions in the following manner: Definition: The class C(β, γ) of s-variate functions f( x), x, consists of all functions which fulfill B > : (a) I( ˆf B ) = O(B β ) for some β > (8) (b) V (f B ) = O(B γ ) for some γ (9) Here V (.) means again the variation of a function in the sense of Hardy and Krause. For dimension s = the definition coincide with the usual total variation of an univariate function. The use of V (.) is natural, because of the functional analytic connection between the spaces of continuous functions and the spaces of Radon measures, i.e. point measures and Lebesgue-measure. We proved the following theorem: Theorem: If f( x) C(β, γ) and if the discrepancy of the set of nodes x, x 2,..., x is D, then for B = (D ) (β+γ) the estimation holds: I(f) = f B ( x n ) + O ( (D) β (β+γ) ) (2) Remark: We also proved, that the order of convergence stated in (2) is best possible even in the case s =, provided f( x) C(β, γ). ow we come to the case two, the new and much more efficient results concerning the case, that the singularities of the integrand are concentrated on the boundary I s of the unit cube. The idea of the method: Consider an univariate function f(x), f : (, ), which has singularities at x = or x =, and which fulfills some smoothness conditions in (, ). We ask

6 for an integral-preserving transformation of f(x) which also continuates the differentiability conditions of f(x) to I = [, ]. Let p(t) = x be a function, which is strictly increasing in [, ] and which fulfills differentiability conditions of sufficient high order. Then we have for functions p(t) with p() =, p() = : f(x)dx = f(p(t))p (t)dt = g(t)dt (2) If p(t) does not tend to fast to p() = and p() =, then one will be able to remove singularities at x =, by means of (2). We propose the function p(t) = p γ (t) = p t (τ( τ))γ dτ, p = ( (τ( τ))γ dτ) (22) The connection of p(t) with the incomplete Beta-Integral is clear. We state some important properties of p(t): Lemma: (a) p() =, p() = (b) p () = p () =, p(t) > for t (, ) (c) p (n) () = p (n) () = for n =, 2,..., n < γ (d) p (n) (t) p γ (t( t)) γ+ n for n < γ + and t (e) p γ p i+2j=n n! i!j! (f) p(t)( p(t)) 4+2γ+ (γ+) p (t( t)) γ+ (g) p(t) p γ+ tγ+, p(t) p γ+ ( t)γ+ for t Some proofs of the parts of the Lemma are straight forward, some are not. We now introduce a suitable class of functions, having singularities on I s : Definition: Hs β,α (C) consists of all functions f(x,..., x s ), < x ρ <, ρ =,..., s, such that for all n,..., n s, n ρ α, ρ =,..., s, holds: n+...+ns f(x,..., x s ) C x n xn2 2... xns s ( s ρ= (x ρ( x ρ )) β+nρ ) (23)

7 whereas all the derivatives are continuous, and < β <. The introduction of the class Hs β,α (C) was motivated by the univariate ëxtremefunction f(x) = (x( x)) β, < β <. We remind (2) for general s =, 2,... : with... f(x, x 2,..., x s )dx dx 2... dx s =... g(t,..., t s )dt dt s (24) g(t,..., t s ) = f(p(t ), p(t 2 ),..., p(t s ))p (t )p (t 2 )... p (t s ) (25) We consider now the reactors of nodes T n = ( 2 + na, 2 + na2,..., 2 + ) nas, mod, where a = (a,..., a s ) are optimal coefficients, a = a(), and n =,...,. We get the integration rule I (f) := f(p(t,n ), p(t 2,n )..., p(t s,n ))p (t,n ), p (t 2,n ),..., p (t s,n ), (26) with t ρ,n = 2 + naρ, ρ =,..., s. ow we are able to state the Theorem: If f Hs β,α (C), and if γ > α+β β, then... f(x,..., x s )dx... dx s I (f) C (α, β, γ, s)c (ln )α,β α, (27) where the constant C (α, β, γ, s) is explicit. The proof makes heavy use of the lemma and makes use of an explicit and complicated estimation of all of the derivatives of g(t,..., t s ). Remark : According to (3), our theorem can not be improved significantly, even in the case of boundedness of f( x). Remark 2: The use of the classical optimal coefficients is only one example of the application of number theoretical methods to improper integrals. We have further methods, using e.g. the Weyl-sequences, (n Θ), especially the sequences n(e r, e r2,..., e rs ), n =, 2,..., r i r k, i k. Estimations of R = fdx I (f) via the Diaphony are available as well.

REFERECES 8 LITERATUR Korobovs book is the classical reference, whereas iederreiters book contains most of the resent developments in number theoretical numerics. Drmota-Tichy is the perhaps comprehensive book on uniform distribution of sequences, containing two thousands of references. REFERECES [] M.-Drmota, R.-F.-Tichy, Sequences, Discrepancies and Applications. Lecture otes in Mathematics 65. Springer (997). [2] H.-iederreiter, Random umber Generation and Quasi-Monte Carlo Methods. CBMS- SF REGIOAL COFERECE SERIES I APPLIED MATHEMAICS 63. Capital City Press (992). [3].-M.- Korobov, umber-theoretic Methods in Approximate Analysis, (963). [4] P.-Zinterhof, High Dimension Improper Integration.Proceedings of 7th Intern. Scientific Conference-Section, Applied Mathematics, pg. 9-5, Kosice, Slovakia (22).