Computational complexity in worst, stochastic and average case setting on functional approximation problem of multivariate

DOI10.1016/S0252-9602(05)60007-0MaRDI QIDQ2569255zbMATH OpenOpenAlexFDO

Authors Gensun Fang, Pei-Xin Ye

Publication date 18 October 2005

Published in Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0252-9602(05)60007-0

zbMATH Keywords

average case settingerror estimatesfunctional approximation

Mathematics Subject Classification ID

Approximate quadratures (41A55) Numerical integration (65D30) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Average case complexity of linear multivariate problems. I: Theory
• Tractability of tensor product linear operators
• Computational complexity of continuous problems
• Tractability and strong tractability of linear multivariate problems
• Tractability of linear multivariate problems in the average case setting

Cited in

(9)

• Complexity of approximation with relative error criterion in worst, average, and probabilistic settings
• Computational complexity of the integration problem for anisotropic classes
• On the complexity of computing the \(L_q\) norm
• Exact asymptotic orders of various randomized widths on Besov classes
• Average case tractability of a multivariate approximation problem
• Tractability of approximation problems in Sobolev classes definied over products of simplices
• Does Increased Regularity Lower Complexity?
• Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure
• What is the complexity of volume calculation?

This page was built for publication: Computational complexity in worst, stochastic and average case setting on functional approximation problem of multivariate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569255)