Saved in:
Bibliographic Details
Main Author: Kuperberg, Greg
Format: Preprint
Published: 2004
Subjects:
Online Access:https://arxiv.org/abs/math/0405366
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911217632673792
author Kuperberg, Greg
author_facet Kuperberg, Greg
contents Archimedes' hat-box theorem states that uniform measure on a sphere projects to uniform measure on an interval. This fact can be used to derive Simpson's rule. We present various constructions of, and lower bounds for, numerical cubature formulas using moment maps as a generalization of Archimedes' theorem. We realize some well-known cubature formulas on simplices as projections of spherical designs. We combine cubature formulas on simplices and tori to make new formulas on spheres. In particular $S^n$ admits a 7-cubature formula (sometimes a 7-design) with $O(n^4)$ points. We establish a local lower bound on the density of a PI cubature formula on a simplex using the moment map. Along the way we establish other quadrature and cubature results of independent interest. For each $t$, we construct a lattice trigonometric $(2t+1)$-cubature formula in $n$ dimensions with $O(n^t)$ points. We derive a variant of the Möller lower bound using vector bundles. And we show that Gaussian quadrature is very sharply locally optimal among positive quadrature formulas.
format Preprint
id arxiv_https___arxiv_org_abs_math_0405366
institution arXiv
publishDate 2004
record_format arxiv
spellingShingle Numerical cubature from Archimedes' hat-box theorem
Kuperberg, Greg
Numerical Analysis
Metric Geometry
Archimedes' hat-box theorem states that uniform measure on a sphere projects to uniform measure on an interval. This fact can be used to derive Simpson's rule. We present various constructions of, and lower bounds for, numerical cubature formulas using moment maps as a generalization of Archimedes' theorem. We realize some well-known cubature formulas on simplices as projections of spherical designs. We combine cubature formulas on simplices and tori to make new formulas on spheres. In particular $S^n$ admits a 7-cubature formula (sometimes a 7-design) with $O(n^4)$ points. We establish a local lower bound on the density of a PI cubature formula on a simplex using the moment map. Along the way we establish other quadrature and cubature results of independent interest. For each $t$, we construct a lattice trigonometric $(2t+1)$-cubature formula in $n$ dimensions with $O(n^t)$ points. We derive a variant of the Möller lower bound using vector bundles. And we show that Gaussian quadrature is very sharply locally optimal among positive quadrature formulas.
title Numerical cubature from Archimedes' hat-box theorem
topic Numerical Analysis
Metric Geometry
url https://arxiv.org/abs/math/0405366