QMC designs and covering of spheres by spherical caps

Size: px
Start display at page:

Download "QMC designs and covering of spheres by spherical caps"

Transcription

1 QMC designs and covering of spheres by spherical caps Ian H. Sloan University of New South Wales, Sydney, Australia Joint work with Johann Brauchart, Josef Dick, Ed Saff (Vanderbilt), Rob Womersley and Yu Guang Wang

2 Given X N := {x 1,...,x N } S d R d+1, in this talk we relate two different quality measures::

3 Cubature the quality of equal weight (or Quasi-Monte Carlo) integration Q[X N ](f) := 1 N N k=1 f(x k ), as an approximation to the integral of f, I(f) := f(x)dσ d (x), S d where σ d denotes the normalised surface measure on S d.

4 Covering the covering radius or mesh norm, or fill distance ρ(x N ) := max x S d min arccos(x x k). 1 k N

5 Covering by spherical caps

6 Now move just one point

7 Covering by spherical caps

8 Covering by spherical caps

9 Trivial lower bound ρ(x N ) c d N 1/d We will say that the sequence X N ) has the optimal covering property if ρ(x N ) N 1/d

10 Worst case error Recall Q[X N ](f) := 1 N N j=1 f(x j ) S d f(x)dσ d (x) = I[X N ]. The worst case error in a Banach space B is defined by: wce(q[x N ];B)) } := sup{ Q[X N](f) I(f) : f B, f B 1, We are particularly interested in Sobolev spaces, B = Wp s(sd ), for 1 p.

11 Function spaces For f L 2 (S d ), f(x) = Z(d,l) f l,k Y l,k (x), where l=0 k=1 The Laplace-Fourier coefficients are defined by f l,k = (f,y l,k ) L2 (S d ) = f(x)y l,k (x)dσ d (x). S d Y l,k for k = 1,...,Z(d,l) is an L 2 orthonormal set of spherical harmonics of degree l: d Y l,k = λ l Y l,k. with λ l := l(l + d 1) the lth eigenvalue of d.

12 The Sobolev space W s p (Sd ) Then f W s p (Sd ) if (1 d )s/2 f L p (S d ), that is, if f W s p (S d ) := l=0 Z(d,l) k=0 (1 + λ l ) s/2 fl,k Y l,k Lp (S d ) <. The case s = 0 gives W s p (Sd ) = L p (S d ).

13 The main result The covering radius of a point set X N on S d is upper bounded by a power of the worst-case error in a Sobolev space : Theorem Let d 1,1 p,q such that 1/q + 1/p = 1 and s > d/p. For a positive integer N, let X N be an N-point set on S d. Then ρ(x N ) c s,d [wce(q[x N ];W s p (Sd ))] 1/(s+d/q),

14 Idea of the proof We need to show wce(q[x N ];W s p (Sd )) ρ(x N ) s+d/q, We construct a fooling function f W s p (Sd ) with support a circle of radius ρ(x N ) that contains no points of X N in its interior Then Q N f = 0, = wce(q[x N ];W s p (Sd )) If. f W s p (S d ) Finally, show If cρ d, and f W s p (S d ) ρ(x N ) s+d/p.

15 Rate of convergence of wce? 1/(s+d/q), ρ(x N ) c s,d [wce(q[x N ];W s p ))] (Sd This result raises the question: how fast can the wce decay> Definition. For s > 0, sequence of point sets (X N ) S d with N is a sequence of QMC designs for the Sobolev space Wp s(sd ) for some s > d/p, if there exists c(s,d) > 0, such that for all f Wp s(sd ) 1 f(x) N x X N f(x)dσ d (x) S c(s,d) d N f s/d H s. That is, it is a QMC design iff wce(q[x N ];W s p (Sd )) c(s,d) N s/d

16 QMC designs QMC designs were introduced previously (Brauchart, Saff, Sloan, Womersley 2014) in the Hilbert space setting (p = 2). Recall: (X N ) is a sequence of QMC designs iff wce(q[x N ];W s p (Sd )) c(s,d) N s/d This is the optimal rate of convergence in Wp s(sd ) for p = 2 proved by Hesse & IHS 2005 for d = 2, then Hesse 2006 for general d; for general p (0, ) by Brandolini et al 2013.

17 QMC designs lead to good covering Corollary of main theorem Let d 1,1 p,q with 1/q + 1/p = 1. For a fixed s > d/p, let (X N ) with N be any QMC design sequence for W s p (Sd ). Then there exist a constant c > 0 depending on d,s,p and the sequence (X N ) but not on N such that ρ(x N ) cn β/d for all N, where β := s/(s + d/q). In particular, if p = 1 (and thus β = 1 and s > d), then the sequence of covering radii ρ(x N ) has the optimal covering property, ρ(x N ) N 1/d.

18 Do QMC designs exist? We know they exist for all s because of what we know about spherical designs.

19 Spherical designs Definition: A spherical t-design on S d R d+1 is a set X N := {x 1,...,x N } S d such that 1 N N p(x j ) = j=1 S d p(x)dσ d (x) p P t. Here dσ d (x) is normalised measure on S d. So X N is a spherical t-design if the QMC (i.e. equal weight) cubature rule with these points integrates exactly all polynomials of degree t.

20 Spherical designs are good for integration Spherical designs are tools for numerical integration. The following theorem shows a good rate of convergence for sufficiently smooth functions f: Theorem. Let 1 p. Given s > d/p, there exists C(p,s,d) > 0 such that for every spherical t-design X N on S d there holds wce(q[x N ];W s p (Sd )) C(s,d) t s. For p = 2: Hesse & IHS, 2005, 2006 For general p: Brandolini et al.2013

21 How many points for a spherical t-design? It is known (Seymour & Zaslavsky, 1984) that for every t 1 (and for every dimension of the sphere) there always exists a spherical design. But how many points does a spherical t-design need? There is no possible upper bound because... Delsarte, Goethals, Seidel (1977) established lower bounds of exact order t d : N ( ) d+t/2 d + ( d+ t/2 d ( ) d+t/2 1 d, if t is even ), if t is odd Yudin (1997) established larger lower bounds, still of exact order t d.

22 Is N O(t d ) enough for a spher. t design? It has long been conjectured that c d t d points is enough, for some c d > 0, but until very recently there was no proof. Recently Bondarenko, Radchenko and Viazovska (Annals of Mathematics, 2013) proved this important existence result. We say that a sequence of spherical t designs on S d with n t d is an optimal order sequence of spherical designs. For such a sequence we have, for all p (0, ) and all s > d/p, wce(q[x N ];W s p (Sd )) N s/d.

23 But what is the constant? But what is the constant? The Bondarenko et al. constant is huge. For S 2 Chen, Frommer and Lang (2011) proved that (t + 1) 2 points is enough for all t up to 100. For S 2, we believe that (t + 1) 2 points is enough for all t. Even N 1 2 (t + 1)2 seems to be enough (R. Womersley, private communication).

24 Covering and spherical designs Reimer 2000, extending Yudin 1995, showed that a spherical t-design yields a covering radius ρ(x N ) c d t 1., (The result holds also for any positive weight cubature rule.) Thus an optimal order sequence (X N ) of spherical t-designs yields optimal covering: ρ(x N ) c d N 1/d. The difference in the present work is that we do not require any form of polynomial exactness.

25 Are there other QMC designs? There are many. Here are two different kinds: For 1 p and s d/p, minimisers of wce(q[x N ];W s p (Sd )) form a sequence of QMC designs for W s p (Sd ) Theorem. (Brauchart, Saff, IHS, Womersley, Math Comp, t2014) A sequence of N-point sets X N that maximize the sum of pairwise Euclidean distances is a sequence of QMC designs for W (d+1)/2 2 (S d ). Thus for S 2 the points that maximize the sum of Euclidean distances form a sequence of QMC designs for W 3/2 2.

26 The nested property of QMC designs Theorem. (Brauchart, Saff, IHS, Womersley, 2014, for p = 2) Given s > d/2, let (X N ) be a sequence of QMC designs for W s 2 (S d ). Then (X N ) is a sequence of QMC designs for all coarser s W 2 (S d ), i.e. for all s satisfying d/2 < s s. This result isn t trivial for larger s the set is smaller but we demand faster convergence. So there is some upper bound on the admissible values of s: s := sup{s : (X N ) is a sequence of QMC designs forh s }. We called s the QMC strength of the sequence (X N ).

27 The nested property for general p Our present proof yields a weaker result for general p unless we have quasi-uniformity. The mesh ratio of a sequence X N be defined as Definition γ(x N ) := ρ(x N) δ(x N ). A sequence (X N ) of N-point sets on S d is said to be quasi-uniform if the mesh ratios are uniformly bounded in N. Theorem Let 1 p < and s > d/p. A quasi-uniform QMC design sequence (X N ) for W s p (Sd ) is also a QMC design sequence for W s p (Sd ) for all s satisfying d/p < s s. We conjecture that the quasi-uniform condition can be removed.

28 Nested property So for each p [0, ] there is some upper bound on the admissible values of s: s p := sup{s : (X N) is a sequence of QMC designs forw s p (Sd )}. We call s p the (L p) strength of the sequence (X N ).

29 Idea of the proof of nested property Express the wce in terms of Bessel kernel, B (s) (x y) := (1 + λ l ) s/2 Z(d,l)P (d) l (x y). l=0 Specifically, wce(q[x N ];W s p (Sd )) = 1 N N j=1 B (s) (x j ) 1. Lq A Bernstein ineq. (using Mhaskar, Narcowich, Prestin, Ward 2010) gives 1 N N j=1 B (s ) (x j ) 1 c[γ(x N )] d/p N (s s )/d Lq 1 N N j=1 B (s) (x j ) 1. Lq

30 Candidates for sequences of QMC designs For the sphere S 2, some plausible candidates are: Random points, uniformly distributed on the sphere. NO at least for p = 2. Equal area points (cf. Rakhmanov-S-Zhou). Fekete points which maximize the determinant (cf. Sloan-Womersley). Log. energy points and Coulomb energy points, which minimize N N log j=1 i=1 1 x j x i, N N j=1 i=1 1 x j x i.

31 (continued) Generalized spiral points (cf. Rakhmanov-S-Zhou; Bauer), with spherical coordinates (θ j,φ j ) given by θ j = cos 1 (1 2j 1 N ), φ j = 1.8 Nθ j mod 2π, j = 1,..., Distance points, which maximize N N j=1 i=1 x j x i. Sphericalt-designs with N = (t + 1) 2 /2 + 1 points.

32 WCE for W s 2 (S2 ) and s = Random 1.18 N 0.52 Fekete 0.90 N 0.75 Equal area 0.93 N 0.75 Coulomb energy 0.90 N 0.75 Log energy 0.90 N 0.75 Generalized spiral 0.91 N 0.75 Distance 0.90 N 0.75 Spherical design 0.91 N Number of points N

33 There are many overlapping curves Random 1.18 N 0.52 Fekete 0.90 N 0.75 Equal area 0.93 N 0.75 Coulomb energy 0.90 N 0.75 Log energy 0.90 N 0.75 Generalized spiral 0.91 N 0.75 Distance 0.90 N 0.75 Spherical design 0.91 N 0.75

34 WCE for W s 2 (S2 ) and s = Random 2.25 N 0.53 Fekete 0.42 N 1.04 Equal area 0.82 N 0.98 Coulomb energy 1.03 N 1.23 Log energy 1.18 N 1.26 Generalized spiral 1.24 N 1.26 Distance 1.17 N 1.26 Spherical design 1.22 N Number of points N

35 WCE for W s 2 (S2 ) and s = Random 4.92 N 0.52 Fekete 0.13 N 0.82 Equal area 1.80 N 0.95 Coulomb energy 0.17 N 1.06 Log energy 1.50 N 1.58 Generalized spiral 2.51 N 1.55 Distance 3.50 N 1.77 Spherical design 3.59 N Number of points N

36 WCE for W s 2 (S2 ) and s = Random N 0.52 Fekete 0.35 N 0.79 Equal area 4.09 N 0.95 Coulomb energy 0.29 N 1.01 Log energy 1.29 N 1.48 Generalized spiral 4.82 N 1.53 Distance 7.00 N 2.00 Spherical design N Number of points N

37 Integrating a smooth function Franke function in C (S 2 ) f ( x,y,z ) := 0.75exp( (9x 2) 2 /4 (9y 2) 2 /4 (9z 2) 2 /4) +0.75exp( (9x + 1) 2 /49 (9y + 1)/10 (9z + 1)/10) +0.5exp( (9x 7) 2 /4 (9y 3) 2 /4 (9z 5) 2 /4) 0.2exp( (9x 4) 2 (9y 7) 2 (9z 5) 2 ) And note: S 2 f(x)dσ 2 (x) = Q[X N ](f) I(f) wce(q[x N ];W s 2 (Sd )) f W s 2. Thus we should see in the error a rate of decay of order N s /2.

38 The Franke function

39 Integration errors for the Franke function Random 0.28 N 0.51 Fekete 0.03 N 0.90 Equal area 0.24 N 0.96 Coulomb energy 0.04 N 1.17 Log energy 0.47 N 1.68 Generalized spiral 0.68 N 1.71 Distance 3.23 N 2.14 Spherical design Number of points N

40 Estimates of s 2 s := sup{s : (X N ) is a sequence of QMC designs for W s 2 (S2 )}. Table 1: Estimates ofs 2 Point set s 2 Fekete 1.5 Equal area 2 Coulomb energy 2 Log energy 3 Generalized spiral 3 Distance 4 Spherical designs

41 Thus for S 2 : All the well known point set sequences we have looked at, except for random points, appear to be QMC designs for W2 s, for a significant range of values of s. But so far this has been proved only for point sets that maximize the sum of distances, and only for s up to 3/2. (And we have proved similar results for generalized sums of distances for 1 < s < 2 ). For the sum of distances points we have therefore proved that s 2 3/2. But the experimental s 2 in this case is s 2 = 4 there s a big gap in our knowledge! QMC designs can be valuable tools for numerical integration, especially if s p is large.

42 What does this tell us about covering? From our main theorem, IF we know that the strength of the QMC design X N in L 2 (S d ) is s 2 then we can conclude from the Main Theorem that ρ(x N ) N (β /d)+ǫ, where β = s 2 s 2 + d/q = s 2 s For example, for the case of minimum Coulomb energy points, IF s 2 = 2, then ρ(x N) cn 2/(3d)+ǫ.

43 Of course we have not PROVED that s 2 = 2 for the minimum Coulomb energy points. And perhaps we believe that minimal Coulomb energy points give optimal covering ρ(x N ) N 1/d? This would follow if we could prove for the minimum Coulomb energy points that X N is a QMC design for W s 1 for just one s > 2.

44 References J Brauchart, E Saff, I Sloan, R Womersley, Optimal order quasi-monte Carlo integration schemes on the sphere. Math Comp J Brauchart, J Dick, E Saff, I Sloan, Y Wang and R Womersley, Covering of spheres by spherical caps and worst-case error for equal weight cubature in Sobolev spaces, arxiv: v

Efficient Spherical Designs with Good Geometric Properties

Efficient Spherical Designs with Good Geometric Properties Efficient Spherical Designs with Good Geometric Properties Rob Womersley, R.Womersley@unsw.edu.au School of Mathematics and Statistics, University of New South Wales 45-design with N = 1059 and symmetrtic

More information

Spherical t ɛ -Design for Numerical Approximations on the Sphere, I

Spherical t ɛ -Design for Numerical Approximations on the Sphere, I Spherical t ɛ -Design for Numerical Approximations on the Sphere, I Xiaojun Chen Department of Applied Mathematics The Hong Kong Polytechnic University April 2015, Shanghai Jiaotong University X. Chen

More information

Low-discrepancy point sets lifted to the unit sphere

Low-discrepancy point sets lifted to the unit sphere Low-discrepancy point sets lifted to the unit sphere Johann S. Brauchart School of Mathematics and Statistics, UNSW MCQMC 2012 (UNSW) February 17 based on joint work with Ed Saff (Vanderbilt) and Josef

More information

Spherical designs with close to the minimal number of points 1

Spherical designs with close to the minimal number of points 1 Spherical designs with close to the minimal number of points Robert S. Womersley School of Mathematics and Statistics, University of New South Wales, Sydney, NSW, 05, Australia Abstract In this paper we

More information

Hyperuniformity on the Sphere

Hyperuniformity on the Sphere Hyperuniformity on the Sphere Johann S. Brauchart j.brauchart@tugraz.at 14. June 2018 Week 2 Workshop MATRIX Research Program "On the Frontiers of High Dimensional Computation" MATRIX, Creswick [ 1 / 56

More information

Quadrature using sparse grids on products of spheres

Quadrature using sparse grids on products of spheres Quadrature using sparse grids on products of spheres Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at ANZIAM NSW/ACT Annual Meeting, Batemans Bay. Joint

More information

Quadrature using sparse grids on products of spheres

Quadrature using sparse grids on products of spheres Quadrature using sparse grids on products of spheres Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at 3rd Workshop on High-Dimensional Approximation UNSW,

More information

Numerical Integration over unit sphere by using spherical t-designs

Numerical Integration over unit sphere by using spherical t-designs Numerical Integration over unit sphere by using spherical t-designs Congpei An 1 1,Institute of Computational Sciences, Department of Mathematics, Jinan University Spherical Design and Numerical Analysis

More information

Local radial basis function approximation on the sphere

Local radial basis function approximation on the sphere Local radial basis function approximation on the sphere Kerstin Hesse and Q. T. Le Gia School of Mathematics and Statistics, The University of New South Wales, Sydney NSW 05, Australia April 30, 007 Abstract

More information

into regions of equal measure and small diameter p. 1/2

into regions of equal measure and small diameter p. 1/2 into regions of equal measure and small diameter Paul Leopardi paulleopardi@unsweduau School of Mathematics, University of New South Wales For presentation at Vanderbilt University, Nashville, November

More information

Uniform approximation on the sphere by least squares polynomials

Uniform approximation on the sphere by least squares polynomials Uniform approximation on the sphere by least squares polynomials Woula Themistoclakis Marc Van Barel August 7, 8 Abstract The paper concerns the uniform polynomial approximation of a function f, continuous

More information

Spherical designs and some generalizations : An overview

Spherical designs and some generalizations : An overview Spherical designs and some generalizations : An overview Eiichi Bannai Shanghai Jiao Tong University 2015 April 21 Workshop on spherical designs and numerical analysis Shanghai, China Spherical t-designs

More information

NEEDLET APPROXIMATION FOR ISOTROPIC RANDOM FIELDS ON THE SPHERE

NEEDLET APPROXIMATION FOR ISOTROPIC RANDOM FIELDS ON THE SPHERE NEEDLET APPROXIMATION FOR ISOTROPIC RANDOM FIELDS ON THE SPHERE Quoc T. Le Gia Ian H. Sloan Yu Guang Wang Robert S. Womersley School of Mathematics and Statistics University of New South Wales, Australia

More information

Polynomial interpolation on the sphere, reproducing kernels and random matrices

Polynomial interpolation on the sphere, reproducing kernels and random matrices Polynomial interpolation on the sphere, reproducing kernels and random matrices Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at MASCOS Workshop on Stochastics

More information

Tutorial on quasi-monte Carlo methods

Tutorial on quasi-monte Carlo methods Tutorial on quasi-monte Carlo methods Josef Dick School of Mathematics and Statistics, UNSW, Sydney, Australia josef.dick@unsw.edu.au Comparison: MCMC, MC, QMC Roughly speaking: Markov chain Monte Carlo

More information

c 2010 Society for Industrial and Applied Mathematics

c 2010 Society for Industrial and Applied Mathematics SIAM J. NUMER. ANAL. Vol. 48, No. 6, pp. 2135 2157 c 2010 Society for Industrial and Applied Mathematics WELL CONDITIONED SPHERICAL DESIGNS FOR INTEGRATION AND INTERPOLATION ON THE TWO-SPHERE CONGPEI AN,

More information

Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels

Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels Y.C. Hon and R. Schaback April 9, Abstract This paper solves the Laplace equation u = on domains Ω R 3 by meshless collocation

More information

QUADRATURE ON A SPHERICAL SURFACE CASPER H. L. BEENTJES. Mathematical Institute, University of Oxford, Oxford, UK

QUADRATURE ON A SPHERICAL SURFACE CASPER H. L. BEENTJES. Mathematical Institute, University of Oxford, Oxford, UK QUADRATURE O A SPHERICAL SURFACE CASPER H. L. BEETJES Mathematical Institute, University of Oxford, Oxford, UK Abstract. Approximately calculating integrals over spherical surfaces in R 3 can be done by

More information

Approximate Fekete points and discrete Leja points based on equal area partitions of the unit sphere

Approximate Fekete points and discrete Leja points based on equal area partitions of the unit sphere Approximate Fekete points and discrete Leja points based on equal area partitions of the unit sphere Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at Computational

More information

Applied and Computational Harmonic Analysis

Applied and Computational Harmonic Analysis Appl Comput Harmon Anal 32 (2012) 401 412 Contents lists available at ScienceDirect Applied and Computational Harmonic Analysis wwwelseviercom/locate/acha Multiscale approximation for functions in arbitrary

More information

Quasi-Monte Carlo Methods for Applications in Statistics

Quasi-Monte Carlo Methods for Applications in Statistics Quasi-Monte Carlo Methods for Applications in Statistics Weights for QMC in Statistics Vasile Sinescu (UNSW) Weights for QMC in Statistics MCQMC February 2012 1 / 24 Quasi-Monte Carlo Methods for Applications

More information

On Euclidean designs and potential energy

On Euclidean designs and potential energy On Euclidean designs and potential energy Tsuyoshi Miezaki Department of Mathematics Oita National College of Technology Oita, 870 0152, Japan miezaki@oita-ct.ac.jp Makoto Tagami Department of Mechanical

More information

Sparse grid quadrature on products of spheres

Sparse grid quadrature on products of spheres Sparse grid quadrature on products of spheres Markus Hegland a, Paul Leopardi a, a Centre for Mathematics and its Applications, Australian National University. Abstract This paper examines sparse grid

More information

Boundary Integral Equations on the Sphere with Radial Basis Functions: Error Analysis

Boundary Integral Equations on the Sphere with Radial Basis Functions: Error Analysis Boundary Integral Equations on the Sphere with Radial Basis Functions: Error Analysis T. Tran Q. T. Le Gia I. H. Sloan E. P. Stephan Abstract Radial basis functions are used to define approximate solutions

More information

DISCRETE MINIMAL ENERGY PROBLEMS

DISCRETE MINIMAL ENERGY PROBLEMS DISCRETE MINIMAL ENERGY PROBLEMS Lecture III E. B. Saff Center for Constructive Approximation Vanderbilt University University of Crete, Heraklion May, 2017 Random configurations ΩN = {X1, X2,..., XN }:

More information

What s new in high-dimensional integration? designing for applications

What s new in high-dimensional integration? designing for applications What s new in high-dimensional integration? designing for applications Ian H. Sloan i.sloan@unsw.edu.au The University of New South Wales UNSW Australia ANZIAM NSW/ACT, November, 2015 The theme High dimensional

More information

Delsarte-Yudin LP method and Universal Lower Bound on energy

Delsarte-Yudin LP method and Universal Lower Bound on energy Peter Dragnev, IPFW Delsarte-Yudin LP method and Universal Lower Bound on energy Peter Dragnev Indiana University-Purdue University Fort Wayne Joint work with: P. Boyvalenkov (BAS); D. Hardin, E. Saff

More information

DISCRETE MINIMAL ENERGY PROBLEMS

DISCRETE MINIMAL ENERGY PROBLEMS DISCRETE MINIMAL ENERGY PROBLEMS Lecture II E. B. Saff Center for Constructive Approximation Vanderbilt University University of Crete, Heraklion May, 2017 Recall Notation ω N = {x 1,..., x N } A, A compact,

More information

APPLIED MATHEMATICS REPORT AMR04/2 DIAPHONY, DISCREPANCY, SPECTRAL TEST AND WORST-CASE ERROR. J. Dick and F. Pillichshammer

APPLIED MATHEMATICS REPORT AMR04/2 DIAPHONY, DISCREPANCY, SPECTRAL TEST AND WORST-CASE ERROR. J. Dick and F. Pillichshammer APPLIED MATHEMATICS REPORT AMR4/2 DIAPHONY, DISCREPANCY, SPECTRAL TEST AND WORST-CASE ERROR J. Dick and F. Pillichshammer January, 24 Diaphony, discrepancy, spectral test and worst-case error Josef Dick

More information

A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere

A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere ANZIAM J. 42 (E) ppc1536 C1557, 2000 C1536 A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere Robert S. Womersley (Received 7 August 2000) Abstract

More information

Approximation by Conditionally Positive Definite Functions with Finitely Many Centers

Approximation by Conditionally Positive Definite Functions with Finitely Many Centers Approximation by Conditionally Positive Definite Functions with Finitely Many Centers Jungho Yoon Abstract. The theory of interpolation by using conditionally positive definite function provides optimal

More information

Multiscale RBF collocation for solving PDEs on spheres

Multiscale RBF collocation for solving PDEs on spheres Multiscale RBF collocation for solving PDEs on spheres Q. T. Le Gia I. H. Sloan H. Wendland Received: date / Accepted: date Abstract In this paper, we discuss multiscale radial basis function collocation

More information

Tractability of Multivariate Problems

Tractability of Multivariate Problems Erich Novak University of Jena Chemnitz, Summer School 2010 1 Plan for the talk Example: approximation of C -functions What is tractability? Tractability by smoothness? Tractability by sparsity, finite

More information

Eigenvalues and eigenfunctions of the Laplacian. Andrew Hassell

Eigenvalues and eigenfunctions of the Laplacian. Andrew Hassell Eigenvalues and eigenfunctions of the Laplacian Andrew Hassell 1 2 The setting In this talk I will consider the Laplace operator,, on various geometric spaces M. Here, M will be either a bounded Euclidean

More information

arithmetic properties of weighted catalan numbers

arithmetic properties of weighted catalan numbers arithmetic properties of weighted catalan numbers Jason Chen Mentor: Dmitry Kubrak May 20, 2017 MIT PRIMES Conference background: catalan numbers Definition The Catalan numbers are the sequence of integers

More information

Application of QMC methods to PDEs with random coefficients

Application of QMC methods to PDEs with random coefficients Application of QMC methods to PDEs with random coefficients a survey of analysis and implementation Frances Kuo f.kuo@unsw.edu.au University of New South Wales, Sydney, Australia joint work with Ivan Graham

More information

Bernstein-Szegö Inequalities in Reproducing Kernel Hilbert Spaces ABSTRACT 1. INTRODUCTION

Bernstein-Szegö Inequalities in Reproducing Kernel Hilbert Spaces ABSTRACT 1. INTRODUCTION Malaysian Journal of Mathematical Sciences 6(2): 25-36 (202) Bernstein-Szegö Inequalities in Reproducing Kernel Hilbert Spaces Noli N. Reyes and Rosalio G. Artes Institute of Mathematics, University of

More information

New Multilevel Algorithms Based on Quasi-Monte Carlo Point Sets

New Multilevel Algorithms Based on Quasi-Monte Carlo Point Sets New Multilevel Based on Quasi-Monte Carlo Point Sets Michael Gnewuch Institut für Informatik Christian-Albrechts-Universität Kiel 1 February 13, 2012 Based on Joint Work with Jan Baldeaux (UTS Sydney)

More information

Quasi-Monte Carlo integration over the Euclidean space and applications

Quasi-Monte Carlo integration over the Euclidean space and applications Quasi-Monte Carlo integration over the Euclidean space and applications f.kuo@unsw.edu.au University of New South Wales, Sydney, Australia joint work with James Nichols (UNSW) Journal of Complexity 30

More information

Overlapping additive Schwarz preconditioners for interpolation on the unit sphere by spherical radial basis functions

Overlapping additive Schwarz preconditioners for interpolation on the unit sphere by spherical radial basis functions Overlapping additive Schwarz preconditioners for interpolation on the unit sphere by spherical radial basis functions Q. T. Le Gia T. Tran I. H. Sloan October, 008 Abstract We present an overlapping domain

More information

Boundary Integral Equations on the Sphere with Radial Basis Functions: Error Analysis

Boundary Integral Equations on the Sphere with Radial Basis Functions: Error Analysis Boundary Integral Equations on the Sphere with Radial Basis Functions: Error Analysis T. Tran Q. T. Le Gia I. H. Sloan E. P. Stephan Abstract Radial basis functions are used to define approximate solutions

More information

Spherical Harmonics on S 2

Spherical Harmonics on S 2 7 August 00 1 Spherical Harmonics on 1 The Laplace-Beltrami Operator In what follows, we describe points on using the parametrization x = cos ϕ sin θ, y = sin ϕ sin θ, z = cos θ, where θ is the colatitude

More information

Curriculum vitae. Alexander Reznikov September 21, 2016

Curriculum vitae. Alexander Reznikov September 21, 2016 Curriculum vitae Alexander Reznikov September 21, 2016 Contact information Name : Alexander Reznikov Address: 1527 Stevenson Center, Department of Mathematics, Vanderbilt University, Nashville, TN, 37240

More information

Extremal systems of points and numerical integration on the sphere

Extremal systems of points and numerical integration on the sphere Advances in Computational Mathematics 21: 107 125, 2004. 2004 Kluwer Academic Publishers. Printed in the Netherlands. Extremal systems of points and numerical integration on the sphere Ian H. Sloan and

More information

Trivariate polynomial approximation on Lissajous curves 1

Trivariate polynomial approximation on Lissajous curves 1 Trivariate polynomial approximation on Lissajous curves 1 Stefano De Marchi DMV2015, Minisymposium on Mathematical Methods for MPI 22 September 2015 1 Joint work with Len Bos (Verona) and Marco Vianello

More information

Recall that any inner product space V has an associated norm defined by

Recall that any inner product space V has an associated norm defined by Hilbert Spaces Recall that any inner product space V has an associated norm defined by v = v v. Thus an inner product space can be viewed as a special kind of normed vector space. In particular every inner

More information

arxiv: v1 [math-ph] 14 Feb 2014

arxiv: v1 [math-ph] 14 Feb 2014 AN ELECTROSTATICS PROBLEM ON THE SPHERE ARISING FROM A NEARBY POINT CHARGE JOHANN S. BRAUCHART, PETER D. DRAGNEV, EDWARD B. SAFF arxiv:4.3367v [math-ph] 4 Feb 4 Abstract. For a positively charged insulated

More information

INTEGRATION BY RBF OVER THE SPHERE

INTEGRATION BY RBF OVER THE SPHERE INTEGRATION BY RBF OER THE SPHERE ALISE SOMMARIA AND ROBERT S. WOMERSLEY Abstract. In this paper we consider numerical integration over the sphere by radial basis functions (RBF). After a brief introduction

More information

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

APPLIED MATHEMATICS REPORT AMR04/16 FINITE-ORDER WEIGHTS IMPLY TRACTABILITY OF MULTIVARIATE INTEGRATION. I.H. Sloan, X. Wang and H. APPLIED MATHEMATICS REPORT AMR04/16 FINITE-ORDER WEIGHTS IMPLY TRACTABILITY OF MULTIVARIATE INTEGRATION I.H. Sloan, X. Wang and H. Wozniakowski Published in Journal of Complexity, Volume 20, Number 1,

More information

Daniel M. Oberlin Department of Mathematics, Florida State University. January 2005

Daniel M. Oberlin Department of Mathematics, Florida State University. January 2005 PACKING SPHERES AND FRACTAL STRICHARTZ ESTIMATES IN R d FOR d 3 Daniel M. Oberlin Department of Mathematics, Florida State University January 005 Fix a dimension d and for x R d and r > 0, let Sx, r) stand

More information

Shape Preserving Approximation: the Final Frontier???

Shape Preserving Approximation: the Final Frontier??? Shape Preserving Approximation: the Final Frontier??? Kirill Kopotun kopotunk@ccumanitobaca Department of Mathematics and the Institute of Industrial Mathematical Sciences, University of Manitoba, Winnipeg,

More information

Uniformly bounded sets of orthonormal polynomials on the sphere

Uniformly bounded sets of orthonormal polynomials on the sphere Uniformly bounded sets of orthonormal polynomials on the sphere J. Marzo & J. Ortega-Cerdà Universitat de Barcelona October 13, 2014 Some previous results W. Rudin (80), Inner function Conjecture : There

More information

Sphere packing, lattice packing, and related problems

Sphere packing, lattice packing, and related problems Sphere packing, lattice packing, and related problems Abhinav Kumar Stony Brook April 25, 2018 Sphere packings Definition A sphere packing in R n is a collection of spheres/balls of equal size which do

More information

A LeVeque-type lower bound for discrepancy

A LeVeque-type lower bound for discrepancy reprinted from Monte Carlo and Quasi-Monte Carlo Methods 998, H. Niederreiter and J. Spanier, eds., Springer-Verlag, 000, pp. 448-458. A LeVeque-type lower bound for discrepancy Francis Edward Su Department

More information

Diffeomorphic Warping. Ben Recht August 17, 2006 Joint work with Ali Rahimi (Intel)

Diffeomorphic Warping. Ben Recht August 17, 2006 Joint work with Ali Rahimi (Intel) Diffeomorphic Warping Ben Recht August 17, 2006 Joint work with Ali Rahimi (Intel) What Manifold Learning Isn t Common features of Manifold Learning Algorithms: 1-1 charting Dense sampling Geometric Assumptions

More information

Design theory from the viewpoint of algebraic combinatorics

Design theory from the viewpoint of algebraic combinatorics Design theory from the viewpoint of algebraic combinatorics Eiichi Bannai Shanghai Jiao Tong University May 27, 2017, at 9SHCC This talk is based on the paper: Eiichi Bannai, Etsuko Bannai, Hajime Tanaka,

More information

Discrete Minimum Energy Problems

Discrete Minimum Energy Problems Discrete Minimum Energy Problems D.P. Hardin Department of Mathematics Vanderbilt University TU Graz, July 3, 2009 Reisz s energy The Riesz s-energy of ω N = {x 1, x 2,..., x N } R p is, for s > 0, E s(ω

More information

List of Symbols, Notations and Data

List of Symbols, Notations and Data List of Symbols, Notations and Data, : Binomial distribution with trials and success probability ; 1,2, and 0, 1, : Uniform distribution on the interval,,, : Normal distribution with mean and variance,,,

More information

CHAPTER VIII HILBERT SPACES

CHAPTER VIII HILBERT SPACES CHAPTER VIII HILBERT SPACES DEFINITION Let X and Y be two complex vector spaces. A map T : X Y is called a conjugate-linear transformation if it is a reallinear transformation from X into Y, and if T (λx)

More information

Tomato Packing and Lettuce-Based Crypto

Tomato Packing and Lettuce-Based Crypto Tomato Packing and Lettuce-Based Crypto A. S. Mosunov and L. A. Ruiz-Lopez University of Waterloo Joint PM & C&O Colloquium March 30th, 2017 Spring in Waterloo Love is everywhere... Picture from https://avatanplus.com/files/resources/mid/

More information

Hyperuniformity on the Sphere

Hyperuniformity on the Sphere Hyperuniformity on the Sphere Peter Grabner Institute for Analysis and Number Theory Graz University of Technology Problem Session, ICERM, February 12, 2018 Two point distributions Quantify evenness For

More information

Continuous functions that are nowhere differentiable

Continuous functions that are nowhere differentiable Continuous functions that are nowhere differentiable S. Kesavan The Institute of Mathematical Sciences, CIT Campus, Taramani, Chennai - 600113. e-mail: kesh @imsc.res.in Abstract It is shown that the existence

More information

Outline of Fourier Series: Math 201B

Outline of Fourier Series: Math 201B Outline of Fourier Series: Math 201B February 24, 2011 1 Functions and convolutions 1.1 Periodic functions Periodic functions. Let = R/(2πZ) denote the circle, or onedimensional torus. A function f : C

More information

Post-processing of solutions of incompressible Navier Stokes equations on rotating spheres

Post-processing of solutions of incompressible Navier Stokes equations on rotating spheres ANZIAM J. 50 (CTAC2008) pp.c90 C106, 2008 C90 Post-processing of solutions of incompressible Navier Stokes equations on rotating spheres M. Ganesh 1 Q. T. Le Gia 2 (Received 14 August 2008; revised 03

More information

MATH 205C: STATIONARY PHASE LEMMA

MATH 205C: STATIONARY PHASE LEMMA MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)

More information

A Tilt at TILFs. Rod Nillsen University of Wollongong. This talk is dedicated to Gary H. Meisters

A Tilt at TILFs. Rod Nillsen University of Wollongong. This talk is dedicated to Gary H. Meisters A Tilt at TILFs Rod Nillsen University of Wollongong This talk is dedicated to Gary H. Meisters Abstract In this talk I will endeavour to give an overview of some aspects of the theory of Translation Invariant

More information

Solving the Dirichlet-to-Neumann map on an oblate spheroid by a mesh-free method

Solving the Dirichlet-to-Neumann map on an oblate spheroid by a mesh-free method Solving the Dirichlet-to-Neumann map on an oblate spheroid by a mesh-free method A. Costea a, Q.T. Le Gia b,, D. Pham c, E. P. Stephan a a Institut für Angewandte Mathematik and QUEST (Centre for Quantum

More information

Optimal Randomized Algorithms for Integration on Function Spaces with underlying ANOVA decomposition

Optimal Randomized Algorithms for Integration on Function Spaces with underlying ANOVA decomposition Optimal Randomized on Function Spaces with underlying ANOVA decomposition Michael Gnewuch 1 University of Kaiserslautern, Germany October 16, 2013 Based on Joint Work with Jan Baldeaux (UTS Sydney) & Josef

More information

Solutions to Laplace s Equations- II

Solutions to Laplace s Equations- II Solutions to Laplace s Equations- II Lecture 15: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay Laplace s Equation in Spherical Coordinates : In spherical coordinates

More information

Lattice rules and sequences for non periodic smooth integrands

Lattice rules and sequences for non periodic smooth integrands Lattice rules and sequences for non periodic smooth integrands dirk.nuyens@cs.kuleuven.be Department of Computer Science KU Leuven, Belgium Joint work with Josef Dick (UNSW) and Friedrich Pillichshammer

More information

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces. Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,

More information

Adapting quasi-monte Carlo methods to simulation problems in weighted Korobov spaces

Adapting quasi-monte Carlo methods to simulation problems in weighted Korobov spaces Adapting quasi-monte Carlo methods to simulation problems in weighted Korobov spaces Christian Irrgeher joint work with G. Leobacher RICAM Special Semester Workshop 1 Uniform distribution and quasi-monte

More information

Harmonic Analysis on the Cube and Parseval s Identity

Harmonic Analysis on the Cube and Parseval s Identity Lecture 3 Harmonic Analysis on the Cube and Parseval s Identity Jan 28, 2005 Lecturer: Nati Linial Notes: Pete Couperus and Neva Cherniavsky 3. Where we can use this During the past weeks, we developed

More information

Exponential Convergence and Tractability of Multivariate Integration for Korobov Spaces

Exponential Convergence and Tractability of Multivariate Integration for Korobov Spaces Exponential Convergence and Tractability of Multivariate Integration for Korobov Spaces Josef Dick, Gerhard Larcher, Friedrich Pillichshammer and Henryk Woźniakowski March 12, 2010 Abstract In this paper

More information

Construction Algorithms for Higher Order Polynomial Lattice Rules

Construction Algorithms for Higher Order Polynomial Lattice Rules Construction Algorithms for Higher Order Polynomial Lattice Rules Jan Baldeaux, Josef Dick, Julia Greslehner and Friedrich Pillichshammer Dedicated to Gerhard Larcher on the occasion of his 50th birthday

More information

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )

More information

Sobolev spaces. May 18

Sobolev spaces. May 18 Sobolev spaces May 18 2015 1 Weak derivatives The purpose of these notes is to give a very basic introduction to Sobolev spaces. More extensive treatments can e.g. be found in the classical references

More information

NON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT

NON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT NON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT Abstract. We prove that the Nazarov-Sodin constant, which up to a natural scaling gives the leading order growth for the expected number of nodal components

More information

FFTs in Graphics and Vision. Homogenous Polynomials and Irreducible Representations

FFTs in Graphics and Vision. Homogenous Polynomials and Irreducible Representations FFTs in Graphics and Vision Homogenous Polynomials and Irreducible Representations 1 Outline The 2π Term in Assignment 1 Homogenous Polynomials Representations of Functions on the Unit-Circle Sub-Representations

More information

Arithmetic progressions in sumsets

Arithmetic progressions in sumsets ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains

More information

Hypercontractivity of spherical averages in Hamming space

Hypercontractivity of spherical averages in Hamming space Hypercontractivity of spherical averages in Hamming space Yury Polyanskiy Department of EECS MIT yp@mit.edu Allerton Conference, Oct 2, 2014 Yury Polyanskiy Hypercontractivity in Hamming space 1 Hypercontractivity:

More information

Optimal embeddings of Bessel-potential-type spaces into generalized Hölder spaces

Optimal embeddings of Bessel-potential-type spaces into generalized Hölder spaces Optimal embeddings of Bessel-potential-type spaces into generalized Hölder spaces J. S. Neves CMUC/University of Coimbra Coimbra, 15th December 2010 (Joint work with A. Gogatishvili and B. Opic, Mathematical

More information

Fourier Transform & Sobolev Spaces

Fourier Transform & Sobolev Spaces Fourier Transform & Sobolev Spaces Michael Reiter, Arthur Schuster Summer Term 2008 Abstract We introduce the concept of weak derivative that allows us to define new interesting Hilbert spaces the Sobolev

More information

Math 328 Course Notes

Math 328 Course Notes Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the

More information

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

Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed? Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed? Xiaoqun Wang 1,2 and Ian H. Sloan 2 1 Department of Mathematical Sciences, Tsinghua University, Beijing 100084,

More information

Applications of equal area partitions of the unit sphere

Applications of equal area partitions of the unit sphere Applications of equal area partitions of the unit sphere Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at Oak Ridge National Laboratory. Based on PhD thesis

More information

Optimal Polynomial Admissible Meshes on the Closure of C 1,1 Bounded Domains

Optimal Polynomial Admissible Meshes on the Closure of C 1,1 Bounded Domains Optimal Polynomial Admissible Meshes on the Closure of C 1,1 Bounded Domains Constructive Theory of Functions Sozopol, June 9-15, 2013 F. Piazzon, joint work with M. Vianello Department of Mathematics.

More information

Part III. Quasi Monte Carlo methods 146/349

Part III. Quasi Monte Carlo methods 146/349 Part III Quasi Monte Carlo methods 46/349 Outline Quasi Monte Carlo methods 47/349 Quasi Monte Carlo methods Let y = (y,...,y N ) be a vector of independent uniform random variables in Γ = [0,] N, u(y)

More information

Efficient Algorithms for the Computation of Optimal Quadrature Points on Riemannian Manifolds

Efficient Algorithms for the Computation of Optimal Quadrature Points on Riemannian Manifolds Efficient Algorithms for the Computation of Optimal Quadrature Points on Riemannian Manifolds Inaugural Dissertation zur Erlangung des Akademischen Grades Doktor eines Wissenschaftszweiges doctor rerum

More information

Course Description for Real Analysis, Math 156

Course Description for Real Analysis, Math 156 Course Description for Real Analysis, Math 156 In this class, we will study elliptic PDE, Fourier analysis, and dispersive PDE. Here is a quick summary of the topics will study study. They re described

More information

Convergence Rates of Kernel Quadrature Rules

Convergence Rates of Kernel Quadrature Rules Convergence Rates of Kernel Quadrature Rules Francis Bach INRIA - Ecole Normale Supérieure, Paris, France ÉCOLE NORMALE SUPÉRIEURE NIPS workshop on probabilistic integration - Dec. 2015 Outline Introduction

More information

Uniform Distribution and Quasi-Monte Carlo Methods

Uniform Distribution and Quasi-Monte Carlo Methods Workshop on Uniform Distribution and Quasi-Monte Carlo Methods October 14-18, 2013 as part of the Radon Special Semester 2013 on Applications of Algebra and Number Theory Metric number theory, lacunary

More information

The Almost Everywhere Convergence of Eigenfunction Expansions of Schrödinger Operator in L p Classes.

The Almost Everywhere Convergence of Eigenfunction Expansions of Schrödinger Operator in L p Classes. Malaysian Journal of Mathematical Sciences (S) April : 9 36 (7) Special Issue: The nd International Conference and Workshop on Mathematical Analysis (ICWOMA 6) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

Notes on Special Functions

Notes on Special Functions Spring 25 1 Notes on Special Functions Francis J. Narcowich Department of Mathematics Texas A&M University College Station, TX 77843-3368 Introduction These notes are for our classes on special functions.

More information

Zeta Functions and Regularized Determinants for Elliptic Operators. Elmar Schrohe Institut für Analysis

Zeta Functions and Regularized Determinants for Elliptic Operators. Elmar Schrohe Institut für Analysis Zeta Functions and Regularized Determinants for Elliptic Operators Elmar Schrohe Institut für Analysis PDE: The Sound of Drums How Things Started If you heard, in a dark room, two drums playing, a large

More information

LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011

LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011 LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS S. G. Bobkov and F. L. Nazarov September 25, 20 Abstract We study large deviations of linear functionals on an isotropic

More information

Qualifying Exams I, Jan where µ is the Lebesgue measure on [0,1]. In this problems, all functions are assumed to be in L 1 [0,1].

Qualifying Exams I, Jan where µ is the Lebesgue measure on [0,1]. In this problems, all functions are assumed to be in L 1 [0,1]. Qualifying Exams I, Jan. 213 1. (Real Analysis) Suppose f j,j = 1,2,... and f are real functions on [,1]. Define f j f in measure if and only if for any ε > we have lim µ{x [,1] : f j(x) f(x) > ε} = j

More information

Strauss conjecture for nontrapping obstacles

Strauss conjecture for nontrapping obstacles Chengbo Wang Joint work with: Hart Smith, Christopher Sogge Department of Mathematics Johns Hopkins University Baltimore, Maryland 21218 wangcbo@jhu.edu November 3, 2010 1 Problem and Background Problem

More information

Topic: Primal-Dual Algorithms Date: We finished our discussion of randomized rounding and began talking about LP Duality.

Topic: Primal-Dual Algorithms Date: We finished our discussion of randomized rounding and began talking about LP Duality. CS787: Advanced Algorithms Scribe: Amanda Burton, Leah Kluegel Lecturer: Shuchi Chawla Topic: Primal-Dual Algorithms Date: 10-17-07 14.1 Last Time We finished our discussion of randomized rounding and

More information

Representation theory and quantum mechanics tutorial Spin and the hydrogen atom

Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Justin Campbell August 3, 2017 1 Representations of SU 2 and SO 3 (R) 1.1 The following observation is long overdue. Proposition

More information