On the tractability of linear tensor product problems in the worst case
The authors give a response top the following problem, namely, to derive a necessary and sufficient condition for a linear tensor product problem to be weakly tractable in the worst case. To that purpose they proved following: Theorem: Consider the linear tensor product problem~\(S\) in the worst case setting with \(\lambda_1=1\) and \(\lambda_2\in(0,1)\) with the absolute error criterion. Then~\(S\) is weakly tractable iff \(\lambda_n=o\big((\log\,n)^{-2}\big)\) as \(n\to\infty\), where \(\lambda_i\) are corresponding eigenvalues.
- Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
- Exponential Tractability of Linear Tensor Product Problems
- Tractability of tensor product problems in the average case setting
- Tractability of tensor product linear operators
- On tractability of linear tensor product problems for \(\infty \)-variate classes of functions
- The complexity of linear tensor product problems in (anti)symmetric Hilbert spaces
- Average case tractability of non-homogeneous tensor product problems
- scientific article; zbMATH DE number 7113464
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Average case tractability of non-homogeneous tensor product problems with the absolute error criterion
- The complexity of linear tensor product problems in (anti)symmetric Hilbert spaces
- Average case \((s, t)\)-weak tractability of non-homogeneous tensor product problems
- Weighted tensor product algorithms for linear multivariate problems
- Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
- Uniform weak tractability
- EC-\((s, t)\)-weak tractability of multivariate linear problems in the average case setting
- (\(s, \ln^\kappa\))-weak tractability of linear problems
- A new criterion for tractability of multivariate problems
- Tractability of linear problems defined over Hilbert spaces
- Notes on \((s,t)\)-weak tractability: a refined classification of problems with (sub)exponential information complexity
- On direct sums and tensor products of non-linear programs
- Tractability of tensor product problems in the average case setting
- Quasi-polynomial tractability
- Liberating the dimension for function approximation
- Generalized tractability for multivariate problems. II: Linear tensor product problems, linear information, and unrestricted tractability
This page was built for publication: On the tractability of linear tensor product problems in the worst case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731971)
