Asymptotic analysis of average case approximation complexity of additive random fields

DOI10.1016/j.jco.2018.04.001zbMath1478.60155arXiv1710.10865OpenAlexW2962679656MaRDI QIDQ2422731

A. A. Khartov, M. Zani

Publication date: 20 June 2019

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

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

zbMATH Keywords

asymptotic analysisaverage case approximation complexityKorobov kernelsadditive random fields

Mathematics Subject Classification ID

Random fields (60G60) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

Decomposition of additive random fields ⋮ Approximation complexity of sums of random processes ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average case tractability of non-homogeneous tensor product problems
• Approximation of additive random fields based on standard information: average case and probabilistic settings
• Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements
• 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
• Asymptotic Statistics

This page was built for publication: Asymptotic analysis of average case approximation complexity of additive random fields