Opening book details…
Can I read Approximation Complexity of Additive Random Fields on EtoBox?
Approximation Complexity of Additive Random Fields by M.A. Lifshits; M. Zani is a Mathematics article available to read on EtoBox.
What is Approximation Complexity of Additive Random Fields about?
Let X(t, ) be an additive random field for (t, ) ∈ [0, 1] d × . We investigate the complexity of finite rank approximation The results are obtained in the asymptotic setting d → ∞ as suggested by Woźniakowski [Tractability and strong tractability of linear multivariate problems, J. Complexity 10 (1994) 96-128.]; [Tractability for multivariate problems for weighted spaces of functions, in: Approximation and Probability. Banach Center Publications, vol. 72, Warsaw, 2006, pp. 407-427.]. They provide quantitative version of the curse of dimensionality: we show that the number of terms in the series needed to obtain a given relative approximation error depends exponentially on d. More precisely, this dependence is of the form V d , and we find the explosion coefficient V.
Who reads Approximation Complexity of Additive Random Fields?
It is typically read by researchers, students, and practitioners in Mathematics.
- Author
- M.A. Lifshits; M. Zani
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0885-064X)
- Published
- 2008
- Language
- EN
- Field
- Mathematics (Physical Sciences)