• Home
  • Search
  • Generalized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability
  • Open Access IconOpen Access
  • Cite Icon8
  • https://doi.org/10.1007/s10208-009-9044-6Copy DOI Icon

Generalized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We continue the study of generalized tractability initiated in our previous paper “Generalized tractability for multivariate problems, Part I: Linear tensor product problems and linear information”, J. Complex. 23:262–295, 2007. We study linear tensor product problems for which we can compute linear information which is given by arbitrary continuous linear functionals. We want to approximate an operator S d given as the d-fold tensor product of a compact linear operator S 1 for d=1,2,…, with ‖S 1‖=1 and S 1 having at least two positive singular values. Let n(e,S d ) be the minimal number of information evaluations needed to approximate S d to within e∈[0,1]. We study generalized tractability by verifying when n(e,S d ) can be bounded by a multiple of a power of T(e −1,d) for all (e −1,d)∈Ω⊆[1,∞)×ℕ. Here, T is a tractability function which is non-decreasing in both variables and grows slower than exponentially to infinity. We study the exponent of tractability which is the smallest power of T(e −1,d) whose multiple bounds n(e,S d ). We also study weak tractability, i.e., when $\lim_{\varepsilon^{-1}+d\to\infty,(\varepsilon^{-1},d)\in \varOmega}\ln n(\varepsilon,S_{d})/(\varepsilon^{-1}+d)=0$. In our previous paper, we studied generalized tractability for proper subsets Ω of [1,∞)×ℕ, whereas in this paper we take the unrestricted domain Ω unr=[1,∞)×ℕ. We consider the three cases for which we have only finitely many positive singular values of S 1, or they decay exponentially or polynomially fast. Weak tractability holds for these three cases, and for all linear tensor product problems for which the singular values of S 1 decay slightly faster than logarithmically. We provide necessary and sufficient conditions on the function T such that generalized tractability holds. These conditions are obtained in terms of the singular values of S 1 and mostly asymptotic properties of T. The tractability conditions tell us how fast T must go to infinity. It is known that T must go to infinity faster than polynomially. We show that generalized tractability is obtained for T(x,y)=x 1+ln y . We also study tractability functions T of product form, T(x,y)=f 1(x)f 2(x). Assume that a i =lim inf x→∞(ln ln f i (x))/(ln ln x) is finite for i=1,2. Then generalized tractability takes place iff $$a_{i}>1\quad\mbox{and}\quad(a_{1}-1)(a_{2}-1)\ge1$$, and if (a 1−1)(a 2−1)=1 then we need to assume one more condition given in the paper. If (a 1−1)(a 2−1)>1 then the exponent of tractability is zero, and if (a 1−1)(a 2−1)=1 then the exponent of tractability is finite. It is interesting to add that for T being of the product form, the tractability conditions as well as the exponent of tractability depend only on the second singular eigenvalue of S 1 and they do not depend on the rate of their decay. Finally, we compare the results obtained in this paper for the unrestricted domain Ω unr with the results from our previous paper obtained for the restricted domain Ω res=[1,∞)×{1,2,…,d *}∪[1,e 0−1)×ℕ with d *≥1 and e 0∈(0,1). In general, the tractability results are quite different. We may have generalized tractability for the restricted domain and no generalized tractability for the unrestricted domain which is the case, for instance, for polynomial tractability T(x,y)=xy. We may also have generalized tractability for both domains with different or with the same exponents of tractability.

Similar Papers
  • Research Article
  • Citations11

([formula omitted])-weak tractability of linear problems

  • Nov 02, 2016
  • Journal of Complexity
  • A Papageorgiou +2
  • Research Article
  • Citations4

EC-(t1,t2)-tractability of approximation in weighted Korobov spaces in the worst case setting

  • Jun 01, 2022
  • Journal of Complexity
  • Jia Chen
  • Research Article
  • Citations57

Quasi-polynomial tractability

  • Jul 22, 2010
  • Journal of Complexity
  • Michael Gnewuch +1
  • Research Article
  • Citations63

Stability Analysis of Variational Inequalities and Nonlinear Complementarity Problems, via the Mixed Linear Complementarity Problem and Degree Theory

  • Nov 01, 1994
  • Mathematics of Operations Research
  • M Seetharama Gowda +1
  • Book Chapter

Uniform Weak Tractability of Weighted Integration

  • Jan 01, 2016
  • Paweł Siedlecki
  • Research Article
  • Citations44

Notes on [formula omitted]-weak tractability: A refined classification of problems with (sub)exponential information complexity

  • Aug 21, 2015
  • Journal of Approximation Theory
  • Paweł Siedlecki +1
  • Research Article
  • Citations81

Ground states and singular vectors of convex variational regularization methods

  • Jan 01, 2013
  • Methods and Applications of Analysis
  • Martin Benning +1
  • Dissertation

Analysis and synthesis of positive systems under l₁ and L₁ performance

  • Jan 01, 2014
  • Xiaoming Chen
  • Research Article
  • Citations6

Termination Criteria for Linear Problems

  • Mar 01, 1995
  • Journal of Complexity
  • S.H Paskov
  • Research Article

Nonlinear boundary value problems for degenerate differential-algebraic systems in the noncritical case

  • Nov 01, 2024
  • V. N. Karazin Kharkiv National University. Ser. Mathematics, Applied Mathematics and Mechanics
  • Sergey Chuiko +2
  • Research Article

Interior of the Integral of a Set-Valued Mapping and Problems with a Linear Control System

  • Dec 15, 2023
  • Дифференциальные уравнения
  • M V Balashov
  • Research Article
  • Citations2

Kernels of representations and group extensions

  • Feb 01, 1972
  • Proceedings of the American Mathematical Society
  • I Schochetman
  • Research Article
  • Citations22

LQ-optimal control of positive linear systems

  • Nov 01, 2010
  • Optimal Control Applications and Methods
  • Charlotte Beauthier +1
  • Book Chapter
  • Citations4

One-Factorizations of Tensor Products of Graphs

  • Jan 01, 1990
  • B. Alspach +1
  • Book Chapter

Tensor Products and Functional Calculus of Polynomially Paranormal Operators

  • Sep 16, 2025
  • Tapan Kumar Chutia +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.