Skip to Main content Skip to Navigation
Journal articles

Approximation Complexity of Additive Random Fields

Abstract : Let X (t), t ∈ [0, 1]d be an additive random field. We investigate the complexity of finite rank approximation n X (t, ω) ≈ ) ξk (ω)ϕk (t). k=1 The results obtained in asymptotic setting d → ∞, as suggested H.Wo'zniakowski, provide quantitative version of dimension curse phe- nomenon: we show that the number of terms in the series needed to obtain a given relative approximation error depends on d exponentially and find the explosion coefficients.
Document type :
Journal articles
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Marguerite Zani Connect in order to contact the contributor
Submitted on : Monday, March 4, 2013 - 2:17:16 PM
Last modification on : Saturday, January 15, 2022 - 4:01:59 AM
Long-term archiving on: : Sunday, April 2, 2017 - 8:32:52 AM


Files produced by the author(s)


  • HAL Id : hal-00796311, version 1


Mihail A. Lifshits, Marguerite Zani. Approximation Complexity of Additive Random Fields. Journal of Complexity, Elsevier, 2008, 24 (3), pp.362--379. ⟨hal-00796311⟩



Record views


Files downloads