𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hyperbolic cross designs for approximation of random fields

✍ Scribed by Thomas Müller-Gronbach


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
916 KB
Volume
66
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

✦ Synopsis


We consider a random field on the p-dimensional cube with a covariance function of tensor product type. The quality of an approximation which is based on finitely many observations of the field is measured by the integrated mean-squared error and the maximum mean-squared error. We use the optimal affine linear approximation and analyze the asymptotic performance of hyperbolic cross designs which are constructed from regular sequences. These designs are weakly asymptotically optimal in the sense that the corresponding approximation errors are of the same order as the minimal errors. For the integrated mean-squared error we explicitly determine the corresponding asymptotic constants. For the maximum mean-squared error we determine the constants up to the factor (-~)P. Moreover, we provide a simple alternative approximation which neither depends on the mean function nor on the covariance function of the field and which performs asymptotically as well as the optimal approximation.


📜 SIMILAR VOLUMES


Normal approximation for quasi-associate
✍ Alexander Bulinski; Charles Suquet 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 137 KB

For quasi-associated random ÿelds (comprising negatively and positively dependent ÿelds) on Z d we use Stein's method to establish the rate of normal approximation for partial sums taken over arbitrary ÿnite subsets U of Z d .

Random-phase approximation for transport
✍ H.-S. Hahn; E.A. Mason 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 225 KB

The random-phase approximation is tested for the first two transport cross sections with several L potential functtons. Fairly good results are obtained. and the approximation is recommended for exploratory calculations, eince it requires very little computational effort.