Generalized tractability for multivariate problems. II: Linear tensor product problems, linear information, and unrestricted tractability

DOI10.1007/S10208-009-9044-6zbMath1187.65013OpenAlexW2035736469MaRDI QIDQ839659

Michael Gnewuch, Henryk Woźniakowski

Publication date: 2 September 2009

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10208-009-9044-6

zbMATH Keywords

algorithmeigenvaluesinformation complexityworst case errorweak tractabilitymultivariate problemunrestricted domainlinear tensor product problemgeneralized tractabilitytractability function

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69)

Related Items (3)

Optimal order of convergence and (in)tractability of multivariate approximation of smooth functions ⋮ Quasi-polynomial tractability ⋮ Breaking the curse of dimensionality

Cites Work

• Unnamed Item
• Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information
• Tractability and strong tractability of linear multivariate problems

This page was built for publication: Generalized tractability for multivariate problems. II: Linear tensor product problems, linear information, and unrestricted tractability