๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improved Error Bounds for Lattice Rules

โœ Scribed by Harald Niederreiter

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
424 KB
Volume
9
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

โœฆ Synopsis

We establish results on the worst-case errors that can be achieved by wellchosen lattice rules for standard classes of multivariate periodic functions. These theorems improve or generalize earlier results of this type. 1993 Academic Press, Inc

๐Ÿ“œ SIMILAR VOLUMES

Error bounds for EOQ
Error bounds for EOQ
โœ Ram Rachamadugu ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 284 KB ๐Ÿ‘ 1 views

In this article we explore the properties of the discounted total cost function for the economic order quantity. We show that it is convex. Furthermore, it is shown that the classical economic order quantity (based on Wilson's formula) is not less than the true optimum value based on discounting. Bo

Bounds for circular error probabilities
Bounds for circular error probabilities
โœ Y. S. Sathe; S. M. Joshi; S. P. Nabar ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 277 KB ๐Ÿ‘ 1 views
New Error Bounds for Solomonoff Predicti
New Error Bounds for Solomonoff Prediction
โœ Marcus Hutter ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 149 KB

Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when it knows the true probability distribution of the sequence. Several new relations between universal Solomonoff sequence pr

Tighter error bounds and weighted error
Tighter error bounds and weighted error metrics for hierarchical radiosity
โœ Chang, Chin-Chen ;Shih, Zen-Chung ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 66 KB ๐Ÿ‘ 1 views

In this paper we first derive a tighter error bound on form factors as a subdivision criterion for the hierarchical radiosity algorithm. Such an error bound can reduce more unnecessary links and improve the performance of the hierarchical radiosity algorithm to meet a user-specified error tolerance.