Approximation complexity of additive random fields

DOI10.1016/j.jco.2007.11.002zbMath1152.65014OpenAlexW2009288092MaRDI QIDQ933416

Marguerite Zani, Mikhail Lifshits

Publication date: 21 July 2008

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

Full work available at URL: https://doi.org/10.1016/j.jco.2007.11.002

zbMATH Keywords

Gaussian processesrandom fieldscurse of dimensionalitytractabilityapproximation complexitylinear approximation error

Mathematics Subject Classification ID

Related Items (9)

A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications ⋮ Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements ⋮ ABC on IBC ⋮ Asymptotic analysis of average case approximation complexity of additive random fields ⋮ Average case tractability of non-homogeneous tensor product problems ⋮ Decomposition of additive random fields ⋮ Piecewise-Multilinear Interpolation of a Random Field ⋮ Approximation of additive random fields based on standard information: average case and probabilistic settings ⋮ Approximation complexity of sums of random processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the average complexity of multivariate problems
• Comparison results for the lower tail of Gaussian seminorms
• Tractability and strong tractability of linear multivariate problems
• Approximation, metric entropy and small ball estimates for Gaussian measures
• Average-case analysis of numerical problems
• Optimal series representation of fractional Brownian sheets
• Small ball probabilities for Gaussian random fields and tensor products of compact operators

This page was built for publication: Approximation complexity of additive random fields