Quasi-polynomial tractability of linear problems in the average case setting
From MaRDI portal
Publication:2252145
DOI10.1016/J.JCO.2013.10.006zbMATH Open1302.65141OpenAlexW2079340356MaRDI QIDQ2252145FDOQ2252145
Authors: Guiqiao Xu 
Publication date: 16 July 2014
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2013.10.006
Recommendations
- Average case tractability of non-homogeneous tensor product problems
- Tractability of Korobov space in the average case setting
- Tractability of linear problems defined over Hilbert spaces
- Tractability of linear multivariate problems in the average case setting
- Average case tractability of a multivariate approximation problem
Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Numerical solutions to equations with linear operators (65J10)
Cites Work
- Title not available (Why is that?)
- Tractability and strong tractability of linear multivariate problems
- Tractability of multiparametric Euler and Wiener integrated processes
- Average case tractability of non-homogeneous tensor product problems
- Quasi-polynomial tractability
- Tractability of multivariate problems. Volume III: Standard information for operators
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Tractability of tensor product problems in the average case setting
- Tractability through increasing smoothness
- On tractability of approximation in special function spaces
- Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information
Cited In (15)
- A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications
- Convergence types and rates in generic Karhunen-Loève expansions with applications to sample path properties
- Exponential convergence-tractability of general linear problems in the average case setting
- Average case tractability of non-homogeneous tensor product problems
- Tractability of linear problems defined over Hilbert spaces
- On the power of standard information for tractability for \(L_{\infty}\) approximation of periodic functions in the worst case setting
- Average case \((s, t)\)-weak tractability of non-homogeneous tensor product problems
- Tractability of Korobov space in the average case setting
- Polynomial-time algorithms for multivariate linear problems with finite-order weights: Average case setting
- Complexity of multilinear problems in the average case setting
- EC-\((s, t)\)-weak tractability of multivariate linear problems in the average case setting
- \((s, t)\)-weak tractability of multivariate linear problems in the average case setting
- Average case tractability of non-homogeneous tensor product problems with the absolute error criterion
- On the power of standard information for tractability for \(L_2\)-approximation in the average case setting
- On the power of standard information for \(\mathbb{L}_2\)-approximation in the average case setting
This page was built for publication: Quasi-polynomial tractability of linear problems in the average case setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252145)
