Approximation complexity of sums of random processes

DOI10.1016/j.jco.2019.02.002zbMath1461.60035arXiv1805.12581OpenAlexW2919609371MaRDI QIDQ2274403

A. A. Khartov, M. Zani

Publication date: 19 September 2019

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.12581

zbMATH Keywords

Wiener processasymptotic analysisaverage case approximation complexityadditive random fields

Mathematics Subject Classification ID

Random fields (60G60) Algorithms for approximation of functions (65D15)

Related Items (1)

Decomposition of additive random fields

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation of additive random fields based on standard information: average case and probabilistic settings
• Approximation complexity of additive random fields
• Tractability of multivariate problems. Volume I: Linear information
• Polynomial-time algorithms for multivariate linear problems with finite-order weights: Average case setting
• Average case optimal algorithms in Hilbert spaces
• Average-case analysis of numerical problems
• Asymptotic analysis of average case approximation complexity of additive random fields
• Exact small ball constants for some Gaussian processes under the \(L^2\)-norm
• Mean Square Truncation Error in Series Expansions of Random Functions
• Small ball probabilities for Gaussian random fields and tensor products of compact operators

This page was built for publication: Approximation complexity of sums of random processes